Skip to main content
SpringerLink
Log in

Multi-objective Processor-Set Selection for Computational Cluster-Systems

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

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

Included in the following conference series:

  • 934 Accesses

Abstract

A formalization of the processor-set selection problem for parallel job-schedulers is presented and proven to be NP-hard in the strong sense. Nonetheless, a simple and straightforward algorithm for the problem is presented, and is seen to perform well in practice when used in combination with more realistic, less uniform, cost-structures.

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 49.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. Adiga, N.R., et al.: Blue Gene/ L torus interconnection network. IBM J. Res. Develop. 49(2/3), 265–276 (2005)

    Article  Google Scholar 

  2. Aridor, Y., et al.: Resource allocation and utilization in the Blue Gene/ L supercomputer. IBM J. Res. Develop. 49(2/3), 425–436 (2005)

    Article  Google Scholar 

  3. Berman, F., Snyder, L.: On mapping parallel algorithms onto parallel architectures. J. Parall. Distr. Comput. 4(5), 439–458 (1987)

    Article  Google Scholar 

  4. Bhanot, G., et al.: Optimizing task layout on the Blue Gene/L supercomputer. IBM J. Res. Develop. 49(2/3), 489–500 (2005)

    Article  Google Scholar 

  5. Bhatelé, A., Bohm, E., Kalé, L.V.: Optimizing communication for Charm++ applications by reducing network contention. Concur. Pract. Exp. 23(2), 211–222 (2011)

    Article  Google Scholar 

  6. Bokhari, S.H.: Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, Norwell (1987)

    Book  Google Scholar 

  7. Bollinger, S.W., Midkiff, S.F.: Heuristic technique for processor and link assignment in multicomputers. IEEE Trans. Comput. C-40(3), 325–333 (1991)

    Article  Google Scholar 

  8. Chokalingam, T., Arunkumar, S.: Genetic algorithm based heuristics for the mapping problem. Comput. Oper. Res. 22(1), 55–64 (1995)

    Article  Google Scholar 

  9. Clos, C.: A study of non-blocking switching networks. Bell Sys. Tech. J. 32(2), 406–424 (1953)

    Google Scholar 

  10. Cray Inc., Seattle, WA 98104, U.S.A.: Cray XT System Overview (2009), publication No. S–2423–22

    Google Scholar 

  11. Darte, A., Robert, Y.: Mapping uniform loop nests onto distributed memory architectures. Parallel Computing 20(5), 679–710 (1994)

    Article  MATH  Google Scholar 

  12. Denardo, E.V.: Dynamic Programming: models and applications. Dover Publications, Mineola (2003)

    MATH  Google Scholar 

  13. Ercal, F., Ramanujam, J., Saddayappan, P.: Task allocation onto a hypercube by recursive mincut bipartitioning. J. Parallel Distrib. Comput. 10(1), 35–44 (1990)

    Article  Google Scholar 

  14. Feitelson, D.G., Rudolph, L.: Parallel Job Scheduling: Issues and Approaches. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 1–18. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  15. Goldschmidt, O., Nehme, D., Yu, G.: Note: On the set-union knapsack problem. Nav. Res. Logist. 41(6), 833–842 (1994)

    Article  MATH  Google Scholar 

  16. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  17. IBM Blue Gene Team: Overview of the IBM Blue Gene/ P project. IBM J. Res. Develop. 52(1/2), 199–220 (January/March 2008)

    Google Scholar 

  18. Jones, J.P., Nitzberg, B.: Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999. LNCS, vol. 1659, pp. 1–16. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Kermani, P., Kleinrock, L.: Virtual cut-through: A new computer communication switching technique. Computer Networks 3(4), 267–286 (1979)

    MathSciNet  MATH  Google Scholar 

  20. Kernighan, B.W., Richie, D.M.: The C Programming Language, 2nd edn. Prentice-Hall, Englewood Cliffs (1988)

    Google Scholar 

  21. Lee, S.Y., Aggarwal, J.K.: A mapping strategy for parallel processing. IEEE Trans. Comput. C 36(4), 433–442 (1987)

    Article  Google Scholar 

  22. Leiserson, C.E.: Fat-Trees: Universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. C-34(10), 892–901 (1985)

    Article  Google Scholar 

  23. Lifka, D.: The ANL/IBM SP Scheduling System. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 295–303. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  24. MacLachlan, R.A.: CMUCL User’s Manual. Carnegie-Mellon University (November 2006), release 19d

    Google Scholar 

  25. Mu’alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans. Parall. Distr. Sys. 12(6), 529–543 (2001)

    Article  Google Scholar 

  26. Navaridas, J., et al.: Effects of job and task placement on parallel scientific applications performance. In: Proc. 17th Euromicro Int’l Conf. on Parallel, Distributed and Network-based Processing, pp. 55–61 (February 2009)

    Google Scholar 

  27. Ni, L.M., McKinley, P.K.: A survey of wormhole routing techniques in direct networks. Computer 26(2), 62–76 (1993)

    Article  Google Scholar 

  28. Pascual, J.A., Navaridas, J., Miguel-Alonso, J.: Effects of Topology-Aware Allocation Policies on Scheduling Performance. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2009. LNCS, vol. 5798, pp. 138–156. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  29. Quinton, P., van Dongen, V.: The mapping of linear recurrence relations on regular arrays. J. VLSI Signal Process. 1(2), 95–113 (1989)

    Article  MATH  Google Scholar 

  30. Skovira, J., Chan, W., Zhou, H.: The EASY – LoadLeveler API Project. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol. 1162, pp. 41–47. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  31. Steele, J. G.L.: Common Lisp: the Language, 2nd edn. Digital Press, Burlington (1990)

    MATH  Google Scholar 

  32. Voltaire Ltd., Herzliya, Israel: Voltaire GridVision Integrated Grid Directors User Manual (May 2007), part Number: 399Z00038

    Google Scholar 

  33. Wan, M., Moore, R., Kremenek, G., Steube, K.: A Batch Scheduler for the Intel Paragon MPP System with a Non-Contiguous Node Allocation Algorithm. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol. 1162, pp. 48–64. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  34. Weisser, D., et al.: Optimizing job placement on the Cray XT3. In: Proceedings of Cray User Group 2006, Lugano, Switzerland (2006)

    Google Scholar 

  35. Yoo, A.B., Jette, M.A., Grondona, M.: SLURM: Simple Linux Utility for Resource Management. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 44–60. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  36. Yu, H., Chung, I.H., Moreira, J.: Topology mapping for Blue Gene/L supercomputer. In: Proc. of 2006 ACM/IEEE Conf. on Supercomputing, SC 2006. ACM, New York (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Deutsches Klimarechenzentrum GmbH, Bundesstraße 45a, 20146, Hamburg, Germany

    N. Peter Drakenberg

Authors
  1. N. Peter Drakenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Google, 1600 Amphitheater Parkway, 94043, Mountain View, CA, USA

    Walfredo Cirne

  2. Mathematics and Computer Science Division, Argonne National Laboratory, Bldg 240, 60439, Argonne, IL, USA

    Narayan Desai

  3. Facebook Inc., 1601 Willow Road, 94025, Menlo Park, CA, USA

    Eitan Frachtenberg

  4. Robotics Research Institute, TU Dortmund, Otto-Hahn-Str. 8, 44227, Dortmund, Germany

    Uwe Schwiegelshohn

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drakenberg, N.P. (2013). Multi-objective Processor-Set Selection for Computational Cluster-Systems. In: Cirne, W., Desai, N., Frachtenberg, E., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2012. Lecture Notes in Computer Science, vol 7698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35867-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35867-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35866-1

  • Online ISBN: 978-3-642-35867-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation