Skip to main content
SpringerLink
Log in
Book cover

Workshop on Job Scheduling Strategies for Parallel Processing

JSSPP 2004: Job Scheduling Strategies for Parallel Processing pp 288–315Cite as

LOMARC — Lookahead Matchmaking for Multi-resource Coscheduling

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3277)

Abstract

Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latencies though potentially creating a memory conflict. We consider two different cases: standard local CPU scheduling and coscheduling on hyperthreaded CPUs. The latter supports coscheduling without any context switches and provides additional options for CPU-internal resource sharing. We present an approach that includes all possible resources into the schedule optimization and improves utilization by coscheduling two jobs if feasible. Our LOMARC approach partially reorders the queue by lookahead to increase the potential to find good matches. In simulations based on the workload model of [12], we have obtained improvements of about 50% in both response times and relative bounded response times on hyperthreaded CPUs (i.e. cut times by half) and of about 25% on standard CPUs for our LOMARC scheduling approach.

Keywords

  • Good Response Time
  • Gang Schedule
  • Relative Response Time
  • Multiprogramming Level
  • Regard Response Time

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dusseau, A., Arpaci, R., Culler, D.E.: Implicit Scheduling – Efficient Distributed Scheduling for Parallel Workloads on Networks of Workstations. In: Proc. SIGMETRICS Conf. Measurement and Modelling of Computer Systems, Philadelphia/PA, USA (1996)

    Google Scholar 

  2. Batat, A., Feitelson, D.G.: Gang Scheduling with Memory Considerations. In: Proc. IPDPS (2000)

    Google Scholar 

  3. Behr, P., Pletner, S., Sodan, A.C.: The Power MANNA Architecture. In: Proc. IEEE Conf. on High Performance Computer Architecture (HPCA), Toulouse, France, pp. 277–286 (2000)

    Google Scholar 

  4. Chiang, S.-H., Vernon, M.K.: Characteristics of a Large Shared Memory Production Workload. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, p. 159. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  5. Cirne, W., Berman, F.: When the Herd is Smart: Aggregate Behavior in the Selection of Job Request. IEEE Trans. on Parallel and Distributed Systems 14(2) (February 2003)

    Google Scholar 

  6. Feitelson, D.G.: Job Scheduling in Multiprogrammed Parallel Systems, Extended Version. Technical Report, IBM, RC 19790 (87657) (August 1997)

    Google Scholar 

  7. Figueira, S.M., Berman, F.: A Slowdown Model for Applications Executing on Time- Shared Clusters of Workstations. IEEE Transactions on Parallel and Distributed Systems 12(6) (June 2001)

    Google Scholar 

  8. Frachtenberg, E., Feitelson, D., Petrini, F., Fernandez, J.: Flexible CoScheduling – Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources. In: Proc. Int. Parallel and Distributed Processing Symposium (IPDPS), Nice, France (2003)

    Google Scholar 

  9. Gibbons, R.A.: Historical Application Profiler for Use by Parallel Schedulers. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, Springer, Heidelberg (1997)

    Google Scholar 

  10. Leinberger, W., Karypis, G., Kumar, V.: Job Scheduling in the Presence of Multiple Resource Requirements. In: Proc. IEEE/ACM Supercomputing Conf. (SC), Seattle/WA, USA (1999)

    Google Scholar 

  11. Leng, T., Ali, R., Hsieh, J., Mashayekhi, V., Rooholamini, R.: An Empirical Study of Hyper-Threading in High Performance Computing Clusters. Linux HPC Revolution (2002)

    Google Scholar 

  12. Lublin, U., Feitelson, D.G.: The Workload on Parallel Supercomputers – Modeling the Characteristics of Rigid Jobs. Journal of Parallel and Distributed Computing 63(11), 1105–1122 (2003)

    CrossRef  MATH  Google Scholar 

  13. Magro, W., Peterson, P., Shah, S.: Hyper-Threading Technology: Impact on Compute-Intensive Workloads. Intel Technology Journal Q1 6(1) (2002)

    Google Scholar 

  14. Marr, D., Binns, F., Hill, D.L., Hinton, G., Koufaty, D.A., Miller, J.A., Upton, M.: Hyper-Threading Technology Architecture and Microarchitecture. Intel Technology Journal Q1 6(1) (2002)

    Google Scholar 

  15. Miller, B.P., Callaghan, M.D., Cargille, J.M., Hollingsworth, J.K., Irvin, R.B., Karavanic, K.L., Kunchithapadam, K., Newhall, T.: The Paradyn Parallel Performance Measurement Tools. IEEE Computer, Special issue on performance evaluation tools for parallel and distributed computer systems 28(11), 37–46 (1995)

    Google Scholar 

  16. Moreira, J.E., Chan, W., Fong, L.L., Franke, H., Jette, M.A.: An Infrastructure for Efficient Parallel Job Execution in Terascale Computing Environments. In: Supercomputing 1998 (November 1998)

    Google Scholar 

  17. Nagar, S., Banerjee, A., Sivasubramaniam, A., Das, C.R.: A Closer Look at Coscheduling Approaches for a Network of Workstations. In: Proc. ACM SPAA, Saint Malo, France (1999)

    Google Scholar 

  18. Nakajima, J., Pallipadi, V.: Enhancements for Hyper-Threading Technology in the Operating System – Seeking the Optimal Scheduling. In: Proc. USENIX 2nd Workshop on Industrial Experiences with Systems Software, Boston/MA, USA (December 2002)

    Google Scholar 

  19. Nikolopoulos, D.S., Polychronopoulos, C.D.: Adaptive Scheduling under Memory Pressure on Multiprogrammed SMPs. In: Proc. International Parallel and Distributed Processing Symposium (IPDPS), Fort Lauderdale/CA, USA (April 2002)

    Google Scholar 

  20. Ousterhout, J.K.: Scheduling Techniques for Concurrent Systems. In: Proc. 3rd Intl. Conf. Distributed Comp. Systems, pp. 22–30 (1982)

    Google Scholar 

  21. Setia, S., Squillante, M., Naik, V.K.: The Impact of Job Memory Requirements on Gang-Scheduling Performance. Performance Evaluation Review (March 1999)

    Google Scholar 

  22. Shmueli, E., Feitelson, D.G.: Backfilling with Lookahead to Optimize the Performance of Parallel Job Scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 228–251. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  23. da Silva, F.A.B., Scherson, I.D.: Concurrent Gang: Towards a Flexible and Scalable Gang Scheduler. In: Proc. 11th Symp. On Computer Architecture and High Performance Computing, Natal, Brazil (1999)

    Google Scholar 

  24. Sobalvarro, P.G., Pakin, S., Weihl, W.E., Chien, A.A.: Dynamic Coscheduling on Workstation Clusters. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol. 1459, p. 231. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  25. Sodan, A.C., Huang, X.: Adaptive Time/Space Sharing with SCOJO. In: Conf. on High Performance Computing Systems (HPCS), Winnipeg/Manitoba (2004)

    Google Scholar 

  26. Sodan, A.C., Riyadh, M.: Coscheduling of MPI and Adaptive Thread Applications in a Solaris Environment. In: Proc. IASTED PDCS, Cambridge/MA, USA (2002)

    Google Scholar 

  27. Sodan, A.C.: Loosely Coordinated Coscheduling in the Context of Other Dynamic Job Scheduling Approaches – A Survey. Concurrency & Computation: Practice & Experience (to appear)

    Google Scholar 

  28. ClusterTools, S.H.: 4 Performance Guide. SUN Microsystems (August 2001), retrieved from http://www.sun.com/products-n-solutions/hardware/docs/Software/

  29. Talby, D., Feitelson, D.G.: Supporting Priorities and Improving Utilization of the IBM SP2 Scheduler Using Slack-Based Backfilling. In: Proc. IPPS (1999)

    Google Scholar 

  30. Tullsen, D., Eggers, S., Levy, H.: Simultaneous Multithreading – Maximizing On-chip Parallelism. In: Proc. Ann. Int. Symp. on Computer Architecture, ISCA (1995)

    Google Scholar 

  31. Tullsen, D.M., Snavely, A.: Symbiotic Jobscheduling for a Simultaneous Multithreading Processor. In: Int. Conf. on Architectural Support for Programming Languages and Operating Systems, ASPLOS (2000)

    Google Scholar 

  32. Vtune Performance Analyzer. Intel Corporation (April 2004), retrieved from http://www.intel.com

  33. Wiseman, Y., Feitelson, D.G.: Paired Gang Scheduling. IEEE Trans. Parallel & Distributed Systems (2003)

    Google Scholar 

  34. Zhang, Y., Sivasubramaniam, A., Moreira, J., Franke, H.: A Simulation-based Study of Scheduling Mechanisms for a Dynamic Cluster Environment. In: Proc. Int. Conf. on Supercomputing (ICS), Santa Fe / NM, USA (2000)

    Google Scholar 

  35. Zhou, Y., Sodan, A.C.: Survey of Zero-Copy Optimization in User-level Communication and Adaptive Knowledge-Based Solution. In: Conf. on High Performance Computing Systems, HPCS (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, University of Windsor, 401 Sunset Ave., Windsor, ON, N9B 3P4, Canada

    Angela C. Sodan & Lei Lan

Authors
  1. Angela C. Sodan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lei Lan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The Hebrew University of Jerusalem,  

    Dror G. Feitelson

  2. Massachusetts Institute of Technology, 77 Massachusetts Avenue, MA 02139, Cambridge, USA

    Larry Rudolph

  3. No Affiliations,  

    Uwe Schwiegelshohn

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sodan, A.C., Lan, L. (2005). LOMARC — Lookahead Matchmaking for Multi-resource Coscheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2004. Lecture Notes in Computer Science, vol 3277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11407522_16

Download citation

  • DOI: https://doi.org/10.1007/11407522_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25330-3

  • Online ISBN: 978-3-540-31795-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

search

Navigation