Skip to main content
SpringerLink
Log in

Communication-Aware Processor Allocation for Supercomputers

  • Conference paper
Algorithms and Data Structures (WADS 2005)

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

Included in the following conference series:

Abstract

We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average number of communication hops.

The associated clustering problem is as follows: Given n points in \(\mathcal{R}^d\), find a size-k subset with minimum average pairwise L 1 distance. We present a natural approximation algorithm and show that it is a \(\frac{7}{4}\)-approximation for 2D grids. In d dimensions, the approximation guarantee is 2 - \(\frac{1}{2d}\), which is tight. We also give a polynomial-time approximation scheme (PTAS) for constant dimension d and report on experimental results.

Extended Abstract. A full version is available as [5].

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. Ahmadinia, A., Bobda, C., Fekete, S., Teich, J., der Veen, J.: Optimal routing-conscious dynamic placement for reconfigurable computing. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 847–851. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Bartal, Y., Charikar, M., Raz, D.: Approximating min-sum k-clustering in metric spaces. In: Proc. 33rd Symp. on Theory of Computation, pp. 11–20 (2001)

    Google Scholar 

  3. Baylor, S., Benveniste, C., Hsu, Y.: Performance evaluation of a massively paralel I/O subsystem. In: Jain, R., Werth, J., Browne, J. (eds.) Synthesizing Synchronous Systems by Static Scheduling in Space-Time. The Kluwer International Series in Engineering and Computer Science, ch. 13, vol. 362, pp. 293–311. Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  4. Bender, C.M., Bender, M.A., Demaine, E.D., Fekete, S.P.: What is the optimal shape of a city? J. Physics A: Mathematical and General 37, 147–159 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bender, M.A., Bunde, D.P., Demaine, E.D., Fekete, S.P., Leung, V.J., Meijer, H., Phillips, C.A.: Communication-aware processor allocation for supercomputers. Technical Report cs.DS/0407058, Computing Research Repository (2004), http://arxiv.org/abs/cs.DS/0407058

  6. Bhattacharya, S., Tsai, W.-T.: Lookahead processor allocation in mesh connected massively parallel computers. In: Proc. 8th International Parallel Processing Symposium, pp. 868–875 (1994)

    Google Scholar 

  7. Brightwell, R., Fisk, L.A., Greenberg, D.S., Hudson, T., Levenhagen, M., Maccabe, A.B., Riesen, R.: Massively parallel computing using commodity components. Parallel Computing 26(2-3), 243–266 (2000)

    Article  MATH  Google Scholar 

  8. Chang, C., Mohapatra, P.: Improving performance of mesh connected multicomputers by reducing fragmentation. Journal of Parallel and Distributed Computing 52(1), 40–68 (1998)

    Article  MATH  Google Scholar 

  9. Chuang, P.-J., Tzeng, N.-F.: An efficient submesh allocation strategy for mesh computer systems. In: Proc. Int. Conf. Dist. Comp. Systems, pp. 256–263 (1991)

    Google Scholar 

  10. Feitelson, D.: The parallel workloads archive, http://www.cs.huji.ac.il/labs/parallel/workload/index.html

  11. Fekete, S.P., Meijer, H.: Maximum dispersion and geometric maximum weight cliques. Algorithmica 38, 501–511 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Guttmann-Beck, N., Hassin, R.: Approximation algorithms for minimum sum p-clustering. Disc. Appl. Math. 89, 125–142 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Indyk, P.: A sublinear time approximation scheme for clustering in metric spaces. In: Proc. 40th Ann. IEEE Symp. Found. Comp. Sci (FOCS), pp. 154–159 (1999)

    Google Scholar 

  14. Karp, R.M., McKellar, A.C., Wong, C.K.: Near-optimal solutions to a 2-dimensional placement problem. SIAM Journal on Computing 4, 271–286 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  15. Krueger, P., Lai, T.-H., Dixit-Radiya, V.: Job scheduling is more important than processor allocation for hypercube computers. IEEE Trans. on Parallel and Distributed Systems 5(5), 488–497 (1994)

    Article  Google Scholar 

  16. Krumke, S., Marathe, M., Noltemeier, H., Radhakrishnan, V., Ravi, S., Rosenkrantz, D.: Compact location problems. Th. Comp. Sci. 181, 379–404 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Leung, V., Arkin, E., Bender, M., Bunde, D., Johnston, J., Lal, A., Mitchell, J., Phillips, C., Seiden, S.: Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies. In: Proc. 4th IEEE International Conference on Cluster Computing, pp. 296–304 (2002)

    Google Scholar 

  18. Li, K., Cheng, K.-H.: A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Journal of Parallel and Distributed Computing 12, 79–83 (1991)

    Article  Google Scholar 

  19. Lo, V., Windisch, K., Liu, W., Nitzberg, B.: Non-contiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Transactions on Parallel and Distributed Computing 8(7) (1997)

    Google Scholar 

  20. Mache, J., Lo, V.: Dispersal metrics for non-contiguous processor allocation. Technical Report CIS-TR-96-13, University of Oregon (1996)

    Google Scholar 

  21. Mache, J., Lo, V.: The effects of dispersal on message-passing contention in processor allocation strategies. In: Proc. Third Joint Conf. on Information Sciences, Sessions on Parallel and Distributed Processing, vol. 3, pp. 223–226 (1997)

    Google Scholar 

  22. Mache, J., Lo, V., Windisch, K.: Minimizing message-passing contention in fragmentation-free processor allocation. In: Proc. 10th Intern. Conf. Parallel and Distributed Computing Systems, pp. 120–124 (1997)

    Google Scholar 

  23. Moore, S., Ni, L.: The effects of network contention on processor allocation strategies. In: Proc. 10th Int. Par. Proc. Symp., pp. 268–274 (1996)

    Google Scholar 

  24. Sahni, S., Gonzalez, T.: p-complete approximation problems. JACM 23(3), 555–565 (1976)

    Google Scholar 

  25. Sandia National Laboratories. The Computational Plant Project, http://www.cs.sandia.gov/cplant

  26. Subramani, V., Kettimuthu, R., Srinivasan, S., Johnson, J., Sadayappan, P.: Selective buddy allocation for scheduling parallel jobs on clusters. In: Proc. 4th IEEE International Conference on Cluster Computing (2002)

    Google Scholar 

  27. University of Oregon Resource Allocation Group. Procsimity. http://www.cs.uoregon.edu/research/DistributedComputing/ProcSimity.html

  28. Windisch, K., Miller, J., Lo, V.: Procsimity: An experimental tool for processor allocation and scheduling in highly parallel systems. In: Proc. Fifth Symp. on the Frontiers of Massively Parallel Computation, pp. 414–421 (1995)

    Google Scholar 

  29. Zhu, Y.: Efficient processor allocation strategies for mesh-connected parallel computers. J. Parallel and Distributed Computing 16, 328–337 (1992)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY Stony Brook, Stony Brook, NY, 11794-4400, USA

    Michael A. Bender

  2. Department of Computer Science, University of Illinois, Urbana, IL, 61801, USA

    David P. Bunde

  3. MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, 02139, USA

    Erik D. Demaine

  4. Dept. of Mathematical Optimization, Braunschweig University of Technology, 38106, Braunschweig, Germany

    Sándor P. Fekete

  5. Discrete Algorithms & Math Department, Sandia National Laboratories, Albuquerque, NM, 87185-1110, USA

    Vitus J. Leung & Cynthia A. Phillips

  6. Dept. of Computing and Information Science, Queen’s University, Kingston, Ontario, K7L 3N6, Canada

    Henk Meijer

Authors
  1. Michael A. Bender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David P. Bunde
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sándor P. Fekete
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Vitus J. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Henk Meijer
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Cynthia A. Phillips
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. Cheriton School of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada

    Alejandro López-Ortiz

  3. School of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bender, M.A. et al. (2005). Communication-Aware Processor Allocation for Supercomputers. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_16

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation