Skip to main content
SpringerLink
Log in

Online Scheduling of Multiprocessor Jobs with Idle Regulation

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3019))

  • 544 Accesses

Abstract

In this paper, we focus on on-line scheduling of multiprocessor jobs with emphasis on the regulation of idle periods in the frame of general list policies. We consider a new family of scheduling strategies based on two phases which successively combine sequential and parallel executions of the jobs. These strategies are part of a more generic scheme introduced in [6]. The main result is to demonstrate that it is possible to estimate the amount of resources that should remain idle for a better regulation of the load and to obtain approximation bounds.

This work was supported in part by CONACYT under grant #32989-A

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Błażewicz, J., Drozdowski, M.: Management of resources in parallel systems. In: The Handbook on Parallel and Distributed Processing, pp. 263–341. Springer, Heidelberg (2000)

    Google Scholar 

  2. Blayo, E., Debreu, L., Mounie, G., Trystram, D.: Dynamic Load Balansing for Adaptive Mesh Ocean Circulation Model. Engineering Simulation V22(2), 8–23 (2000)

    Google Scholar 

  3. Błażewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, New York (2001)

    MATH  Google Scholar 

  4. Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamos (1996)

    Google Scholar 

  5. Chapin, S., Cirne, W., Feitelson, D., Patton Jones, J., Leutenegger, S.T., Schwiegelshohn, U., Smith, W., Talby, D.: Benchmarks and Standards for the Evaluation of Parallel Job Schedulers. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol. 1659, pp. 66–89. Springer, Heidelberg (1999)

    Google Scholar 

  6. Thernykh, A., Rapine, C., Trystram, D.: Adaptive scheme for on-line scheduling of parallel jobs. Technical report at IMAG (2003)

    Google Scholar 

  7. Decker, T., Krandick, W.: Parallel real root isolation using the Descartes method. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds.) HiPC 1999. LNCS, vol. 1745, pp. 261–268. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Downey, A.: A parallel workload model and its implications for processor allocation. In: Proc. the 6th International Symposium of High Performance Distributed Computing, pp. 112–123 (1997)

    Google Scholar 

  9. Feitelson, D., Rudolph, L.: Toward convergence in job schedulers for parallel supercomputers. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol. 1162, pp. 1–26. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  10. Feitelson, D., Rudolph, L.: Metrics and Benchmarking for Parallel Job Scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol. 1459, pp. 1–24. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Feitelson, D., Rudolph, L., Schweigelshohn, U., Sevcik, K., Wong, P.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, pp. 1–34. Springer, Heidelberg (1997)

    Google Scholar 

  12. Ghosal, D., Serazii, G., Tripathi, S.: The processor working set and its use in scheduling multiprocessor system. IEEE Trans. Soft. Eng. 17(5), 443–453 (1991)

    Article  Google Scholar 

  13. Heymann, E., Senar, M., Luque, E., Livny, M.: Self-Adjusting Scheduling of Master-Worker Applications on Distributed Clusters. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 742–751. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Iyer, S., Druschel, P.: Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O. In: Symposium on Operating Systems Principles, pp. 117–130 (2001)

    Google Scholar 

  15. Lloyd, E.: Concurrent task systems. Operational Research 29(1), 189–201 (1981)

    MATH  MathSciNet  Google Scholar 

  16. Lepere, R., Mounie, G., Trystram, D.: An Approximation algorithm for scheduling Trees of Malleable Tasks. EJOR (2002)

    Google Scholar 

  17. McCann, C., Vaswani, R., Zahorjan, J.: A Dynamic Processor Allocation Policy for Multiprogrammed Shared-Memory Multiprocessors. ACM Transactions on Computer System 11(2), 146–178 (1993)

    Article  Google Scholar 

  18. Nguyen, T., Vaswani, R., Zahorjan, J.: Parallel Application Characterization for Multiprocessor Scheduling Policy Design. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol. 1162. Springer, Heidelberg (1996)

    Google Scholar 

  19. Nguyen, T., Vaswani, R., Zahorjan, J.: Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol. 1162. Springer, Heidelberg (1996)

    Google Scholar 

  20. Rosti, E., Smirni, E., Serazzi, G., Dowdy, L.: Analysis of non-work-conserving processor partitioning policies. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 165–181. Springer, Heidelberg (1995)

    Google Scholar 

  21. Rapine, C., Scherson, I., Trystram, D.: On-Line Scheduling of Parallelizable Jobs. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol. 1470, pp. 322–327. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Sgall, J., Feldmann, A., Kao, M., Teng, S.: Optimal online scheduling of parallel jobs with dependencies. J. of Combinatorial Optimization 1(4), 393–411 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  23. Sgall, J.: On-line scheduling-A Survey. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 196–231. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  24. Silva, F., Scherson, I.: Improving Parallel Job Scheduling Using Runtime Measurements. In: Feitelson, D.G., Rudolph, L. (eds.) IPDPS-WS 2000 and JSSPP 2000. LNCS, vol. 1911, pp. 18–39. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  25. Sinnen, O., Sousa, L.: Exploiting Unused Time Slots in List Scheduling. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 166–170. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  26. Shmoys, D., Wein, J., Williamson, D.: Scheduling parallel machines on-line. SIAM J. Comput. 24, 1313–1331 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CICESE, Ensenada, Baja California, México

    Andrei Tchernykh

  2. ID-IMAG, 38330, Montbonnot St. Martin, France

    Denis Trystram

Authors
  1. Andrei Tchernykh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denis Trystram
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences, Czestochowa University of Technology,  

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, TN 37996-3450, Knoxville, USA

    Jack Dongarra

  3. Systems Research Institute, Polish Academy of Science, Warsaw, Poland

    Marcin Paprzycki

  4. Informatics & Mathematical Modeling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tchernykh, A., Trystram, D. (2004). Online Scheduling of Multiprocessor Jobs with Idle Regulation. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24669-5_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21946-0

  • Online ISBN: 978-3-540-24669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation