Skip to main content
SpringerLink
Log in

Symbiotic Space-Sharing on SDSC’s DataStar System

  • Conference paper
Job Scheduling Strategies for Parallel Processing (JSSPP 2006)

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

Included in the following conference series:

Abstract

Using a large HPC platform, we investigate the effectiveness of “symbiotic space-sharing”, a technique that improves system throughput by executing parallel applications in combinations and configurations that alleviate pressure on shared resources. We demonstrate that relevant benchmarks commonly suffer a 10-60% penalty in runtime efficiency due to memory resource bottlenecks and up to several orders of magnitude for I/O. We show that this penalty can be often mitigated, and sometimes virtually eliminated, by symbiotic space-sharing techniques and deploy a prototype scheduler that leverages these findings to improve system throughput by 20%.

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. http://icl.cs.utk.edu/projectsfiles/hpcc/RandomAccess/

  2. http://www.cs.virginia.edu/stream/

  3. http://www.npaci.edu/DataStar/guide/home.html

  4. http://www.sdsc.edu/pmac/Benchmark/iobench

  5. Antonopoulos, C.D., Nikolopoulos, D.S., Papatheodorou, T.S.: Scheduling Algorithms with Bus Bandwidth Considerations for SMPs. In: ICPP, p. 547 (2003)

    Google Scholar 

  6. Bailey, D.H., et al.: The NAS Parallel Benchmarks. The International Journal of Supercomputer Applications 5(3), 63–73 (1991)

    Article  Google Scholar 

  7. Batat, A., Feitelson, D.G.: Gang Scheduling with Memory Considerations. In: 14th Intl. Parallel Distributed Processing Symp., pp. 109–114 (2000)

    Google Scholar 

  8. Dongarra, J., Luszczek, P.: Introduction to the HPCChallenge Benchmark Suite. Technical Report ICL-UT-05-01, ICL (2005)

    Google Scholar 

  9. Downey, A.B., Feitelson, D.G.: The elusive goal of workload characterization. SIGMETRICS Perform. Eval. Rev. 26(4), 14–29 (1999)

    Article  Google Scholar 

  10. Feitelson, D.G., Nitzberg, B.: Job Characteristics of a Production parallel scientific workload on the NASA Ames iPSC/860. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing. LNCS, vol. 949, pp. 337–360. Springer, Heidelberg (1995)

    Google Scholar 

  11. Gibbons, R.: A Historical Application Profiler for Use by Parallel Schedulers. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing. LNCS, vol. 1291, pp. 58–77. Springer, Heidelberg (1997)

    Google Scholar 

  12. Kannan, S., et al.: Workload Management with LoadLeveler. IBM (November 2001)

    Google Scholar 

  13. Koukis, E., Koziris, N.: Memory Bandwidth Aware Scheduling for SMP Cluster Nodes. In: PDP ’05: Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP’05), Washington, DC, USA, pp. 187–196. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  14. Leinberger, W., Karypis, G., Kumar, V.: Job scheduling in the presence of multiple resource requirements (CDROM). In: Supercomputing ’99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing, USA, ACM Press, New York (1999)

    Google Scholar 

  15. Liedtke, J., Volp, M., Elphinstone, K.: Preliminary thoughts on memory-bus scheduling. In: EW 9: Proceedings of the 9th workshop on ACM SIGOPS European workshop, pp. 207–210. ACM Press, New York (2000)

    Google Scholar 

  16. Lifka, D.A.: The ANL/IBM SP Scheduling System. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing. LNCS, vol. 949, pp. 295–303. Springer, Heidelberg (1995)

    Google Scholar 

  17. Mache, J., Lo, V., Garg, S.: Job Scheduling that Minimizes Network Contention due to both Communication and I/O. In: 14th International Parallel and Distributed Processing Symposium, Washington, DC, USA, p. 457. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  18. Mache, J., et al.: The impact of spatial layout of jobs on parallel I/O performance. In: IOPADS ’99: Proceedings of the sixth workshop on I/O in parallel and distributed systems, pp. 45–56. ACM Press, New York (1999)

    Chapter  Google Scholar 

  19. McGregor, R.L., Antonopoulos, C., Nikolopoulos, D.: Scheduling Algorithms for Effective Thread Pairing on Hybrid Multiprocessors. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, Denver, CO, April 2005, IEEE Computer Society Press, Denver (2005)

    Google Scholar 

  20. Parsons, E.W., Sevcik, K.C.: Coordinated allocation of memory and processors in multiprocessors. In: SIGMETRICS ’96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 57–67. ACM Press, New York (1996)

    Chapter  Google Scholar 

  21. Peris, V.G.J., Squillante, M.S., Naik, V.K.: Analysis of the impact of memory in distributed parallel processing systems. In: SIGMETRICS ’94: Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems, pp. 5–18. ACM Press, New York (1994)

    Chapter  Google Scholar 

  22. Smith, W., Foster, I.T., Taylor, V.E.: Predicting Application Run Times Using Historical Information. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing. LNCS, vol. 1459, pp. 122–142. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  23. Snavely, A., Tullsen, D.: Symbiotic Job Scheduling for a Simultaneous Multithreading Processor. In: Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, November 2000, pp. 234–244 (2000)

    Google Scholar 

  24. Snavely, A., Tullsen, D., Voelker, G.: Symbiotic Jobscheduling for a Simultaneous Multithreading Processor. In: Proceedings of the ACM 2002 Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2002), Marina Del Rey, June 2002, pp. 66–76. ACM Press, New York (2002)

    Chapter  Google Scholar 

  25. Squillante, M., Lazowska, E.: Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling. IEEE Transactions on Parallel and Distributed Systemse 4(2), 131–143 (1993)

    Article  Google Scholar 

  26. Suh, G.E., Rudolph, L., Devadas, S.: Effects of Memory Performance on Parallel Job Scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 116–132. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Sundaramoorthy, K., Purser, Z., Rotenberg, E.: Slipstream Processors: Improving both Performance and Fault Tolerance. In: Architectural Support for Programming Languages and Operating Systems, pp. 257–268 (2000)

    Google Scholar 

  28. Torrellas, J., Tucker, A., Gupta, A.: Evaluating the Performance of Cache-Affinity Scheduling in Shared-Memory Multiprocessors. Journal of Parallel and Distributed Computing 24(2), 139 (1995)

    Article  Google Scholar 

  29. Vaswani, R., Zahorjan, J.: The Implications of Cache Affinity on Processor Scheduling for Multiprogrammed Shared Memory Multiprocessors. In: Proceedings of the 13th ACM Symposium on Operating System Principles, Pacific Grove, CA, October 1991, pp. 26–40. ACM Press, New York (1991)

    Google Scholar 

  30. Wiseman, Y., Feitelson, D.: Paired Gang Scheduling. IEEE Transactions on Parallel and Distributed Systems 14, 581–592 (2003)

    Article  Google Scholar 

  31. Wong, P., der Wijngaart, R.V.: NAS Parallel Benchmarks I/O Version 2.4. Technical report, NASA Ames Research Center, Moffett Field, CA, NAS Technical Report NAS-03-002 (January 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. San Diego Supercomputer Center, University of California, San Diego, La Jolla, CA 92093-0505, USA

    Jonathan Weinberg & Allan Snavely

Authors
  1. Jonathan Weinberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Allan Snavely
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eitan Frachtenberg Uwe Schwiegelshohn

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Weinberg, J., Snavely, A. (2007). Symbiotic Space-Sharing on SDSC’s DataStar System. In: Frachtenberg, E., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2006. Lecture Notes in Computer Science, vol 4376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71035-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71035-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71034-9

  • Online ISBN: 978-3-540-71035-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation