Skip to main content
SpringerLink
Log in

Coscheduling under Memory Constraints in a NOW Environment

  • Conference paper
  • First Online:
Job Scheduling Strategies for Parallel Processing (JSSPP 2001)

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

Included in the following conference series:

Abstract

Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicated. These two unique factors make scheduling policies on multiprocessor/multicomputer systems unsuitable for NOWs. However, the coscheduling principle is still an important basis for parallel process scheduling in these environments. We propose a new coscheduling algorithm for reducing the number of page faults across a non-dedicated cluster by increasing the execution priority of parallel tasks with lower page fault rate. Our method is based on knowledge of events obtained during execution, as communication activity and memory size of every task. The performance of our proposal has been analyzed and compared with other coscheduling implementations by means of simulation.

This workw as supported by the CICYT under contract TIC98-0433

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. D.G. Feitelson, L. Rudolph, U. Schwiegelshohn, K.C. Sevcik and P. Wong. “Theory and Practice in Parallel Job Scheduling”. In Job Scheduling Strategies for Parallel Processing, D.G. Feitelson and L. Rudolph (eds), Lecture Notes in Computer Science, Vol. 1291, 1997.

    Google Scholar 

  2. S. Setia, M.S. Squillante and V.K. Naik. “The Impact of Job Memory Requirements on Gang-Scheduling Performance”. In Performance Evaluation Review, March 1999.

    Google Scholar 

  3. D. Burger, R. Hyder, B. Miller and D. Wood. “Paging Tradeo.s in Distributed Shared-Memory Multiprocessors”. Journal of Supercomputing, vol. 10, pp.87–104, 1996.

    Article  Google Scholar 

  4. M. Bach. “The Design of the UNIX Operating System’. Prentice-Hall International Editions, 1986.

    Google Scholar 

  5. T. Anderson, D. Culler, D. Patterson and the Now team.“ A case for NOW (Networks of Workstations)”. IEEE Micro, 1995.

    Google Scholar 

  6. M. Litzkow, M. Livny and M. Mutka.“ Condor-A Hunter of Idle Workstations”. 8th Int’l Conference of Distributed Computing Systems, 1988.

    Google Scholar 

  7. S. Russ, J. Robinson, B. Flachs and B. Heckel. “The Hector Distributed Run-Time Environment”. IEEE trans. on Parallel and Distributed Systems, Vol.9 (11). 1988.

    Google Scholar 

  8. A.C. Dusseau, R.H. Arpaci and D.E. Culler. “Effective Distributed Scheduling of Parallel Workloads”. ACM SIGMETRICS’96, 1996.

    Google Scholar 

  9. M. Crovella et al. “Multiprogramming on Multiprocessors”. 3rd IEEE Symposium on Parallel and Distributed Processing, 1994.

    Google Scholar 

  10. R.H. Arpaci, A.C. Dusseau, A.M. Vahdat, L.T. Liu, T.E. Anderson and D.A. Patterson. “The Interaction of Parallel and Sequential Workloads on a Network of Workstations”.ACM SIGMETRICS’95, 1995.

    Google Scholar 

  11. D.G. Feitelson. “Memory Usage in the LANL CM-5 Workload”. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 1291, pp. 78–84, 1997.

    Google Scholar 

  12. J.K. Ousterhout. “Scheduling Techniques for Concurrent Systems.” In 3rd. Intl. Conf. Distributed Computing Systems, pp.22–30, 1982.

    Google Scholar 

  13. F. Petrini and W. Feng. “Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems”. International Parallel & Distributed Processing Symposium, Cancun, 2000.

    Google Scholar 

  14. P.G. Sobalvarro and W.E. Weihl. “Demand-based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors”. IPPS’95 Workshop on Job Scheduling Strategies for Parallel Processing, 1995.

    Google Scholar 

  15. P.G. Sobalvarro, S. Pakin, W.E. Weihl and A.A. Chien. “Dynamic Coscheduling on Workstation Clusters”. IPPS’98 Workshop on Job Scheduling Strategies for Parallel Processing, 1998.

    Google Scholar 

  16. F. Solsona, F. Giné, P. Hernández and E. Luque. “Implementing Explicit and Implicit Coscheduling in a PVM Environment”. 6th International Euro-Par Conference (Europar’2000), Lecture Notes in Computer Science, vol. 1900, 2000.

    Google Scholar 

  17. F. Solsona, F. Giné, P. Hernández and E. Luque. “Predictive Coscheduling Implementation in a non-dedicated Linux Cluster”. To appear in 7th International Euro-Par Conference (Europar’2001), August 2001.

    Google Scholar 

  18. S. Setia. “The Interaction between Memory Allocation and Adaptive Partitioning in Message Passing Multicomputers”. In IPPS Job Scheduling Workshop, Apr. 1995.

    Google Scholar 

  19. E. Parsons and K. Sevcik. “Coordinated Allocation of Memory and Processors in Multiprocessors”. In Proc. ACM Sigmetrics/Performance’96, pp. 57–67, May 1996.

    Google Scholar 

  20. W. Leinberger, G. Karypis and V. Kumar. “Gang Scheduling for Distributed Memory Systems”. 6th International Euro-Par Conference (Europar’2000), Lecture Notes in Computer Science, vol. 1900, 2000.

    Google Scholar 

  21. A. Batat and D. G. Feitelson. “Gang Scheduling with Memory Considerations”. Intl. Parallel and Distributed Processing Symposium, pp. 109–114, May 2000.

    Google Scholar 

  22. A.C. Arpaci-Dusseau, D.E. Culler and A.M. Mainwaring. “Scheduling with Implicit Information in Distributed Systems”. ACM SIGMETRICS’98, 1998.

    Google Scholar 

  23. F. Solsona, F. Giné, P. Hernández and E. Luque. “CMC: A Coscheduling Model for non-Dedicated Cluster Computing”. IPDPS’2001, April 2001.

    Google Scholar 

  24. P.J. Denning. “Working Sets Past and Present”. IEEE Transactions on Software Engineering, vol. SE-6, No 1, January 1980.

    Google Scholar 

  25. M. Becket al. “LINUX Kernel Internals”. Addison-Wesley, 1996.

    Google Scholar 

  26. L. Kleinrock. “Queuing Systems”. John Wiley and Sons, 1976.

    Google Scholar 

  27. D. Feitelson and B. Nitzberg. “Job Characteristics of a Production Parallel Scientific Workload on the NASA Ames IPSC/860”. In Proceedings of the IPPS’95 Workshop on Job Scheduling Strategies for Parallel Processing, pp. 215–227, April 1997.

    Google Scholar 

  28. K.Y. Wang and D.C. Marinescu. “Correlation of the Paging Activity of Individual Node Programs in the SPMD Execution Model”. In 28th Hawaii Intl. Conf. System Sciences, vol. I, pp. 61–71, Jan 1995.

    Google Scholar 

  29. V.G.J. Peris, M.S. Squillante and V.K. Naik. “Analysis of the Impact of Memory in Distributed Parallel Processing Systems”. In Proceedings of ACM SIGMETRICS Conference, pp. 158–170, May 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática e Ingeniería Industrial, Universitat de Lleida, Spain

    Francesc Giné & Francesc Solsona

  2. Departamento de Informática, Universitat Autónoma de Barcelona, Spain

    Porfidio Hernández & Emilio Luque

Authors
  1. Francesc Giné
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesc Solsona
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Porfidio Hernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Emilio Luque
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Hebrew University School of Computer Science and Engineering, 91904, Jerusalem, Israel

    Dror G. Feitelson

  2. Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Larry Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giné, F., Solsona, F., Hernández, P., Luque, E. (2001). Coscheduling under Memory Constraints in a NOW Environment. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2001. Lecture Notes in Computer Science, vol 2221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45540-X_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45540-X_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42817-6

  • Online ISBN: 978-3-540-45540-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation