Skip to main content

Using Clustering to Address Heterogeneity and Dynamism in Parallel Scientific Applications

  • Conference paper
High Performance Computing – HiPC 2005 (HiPC 2005)

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

Included in the following conference series:

Abstract

The dynamism and space-time heterogeneity exhibited by structured adaptive mesh refinement (SAMR) applications makes their scalable parallel implementation a significant challenge. This paper investigates an adaptive hierarchical multi-partitioner (AHMP) framework that dynamically applies multiple partitioners to different regions of the domain, in a hierarchical manner, to match the local requirements of these regions. Key components of the AHMP framework include a segmentation-based clustering algorithm (SBC) for identifying regions in the domain with relatively homogeneous partitioning requirements, mechanisms for characterizing the partitioning requirements, and a runtime system for selecting, configuring and applying the most appropriate partitioner to each region. The AHMP framework has been implemented and experimentally evaluated on up to 1280 processors of the IBM SP4 cluster at San Diego Supercomputer Center.

The research presented in this paper is supported in part by the National Science Foundation via grants numbers ACI 9984357, EIA 0103674, EIA 0120934, ANI 0335244, CNS 0305495, CNS 0426354 and IIS 0430826.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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. Berger, M., Oliger, J.: Adaptive mesh refinement for hyperbolic partial differential equations. Journal of Computational Physics 53, 484–512 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berger, M., Regoutsos, I.: An algorithm for point clustering and grid generation. IEEE Transactions on Systems, Man and Cybernetics 21(5), 1278–1286 (1991)

    Article  Google Scholar 

  3. Cummings, J., Aivazis, M., Samtaney, R., Radovitzky, R., Mauch, S., Meiron, D.: A virtual test facility for the simulation of dynamic response in materials. Journal of Supercomputing 23, 39–50 (2002)

    Article  MATH  Google Scholar 

  4. Devine, K., Boman, E., Heaphy, R., Hendrickson, B., Vaughan, C.: Zoltan data management services for parallel dynamic applications. Computing in Science and Engineering 4(2), 90–97 (2002)

    Article  Google Scholar 

  5. Gonzalez, R.C., Woods, R.E.: Digital Image Processing, 2nd edn. Prentice Hall, Upper Saddle River (2002)

    Google Scholar 

  6. Hornung, R.D., Kohn, S.R.: Managing application complexity in the samrai object-oriented framework. Concurrency and Computation - Practice & Experience 14(5), 347–368 (2002)

    Article  MATH  Google Scholar 

  7. Kale, L.V.: Charm, http://charm.cs.uiuc.edu/research/charm/

  8. Karypis, G., Kumar, V.: Parmetis (2003), http://www-users.cs.umn.edu/~karypis/metis/parmetis/index.html

  9. Lan, Z., Taylor, V., Bryan, G.: Dynamic load balancing of samr applications on distributed systems. Journal of Scientic Programming 10(4), 319–328 (2002)

    Google Scholar 

  10. Li, X., Parashar, M.: Dynamic load partitioning strategies for managing data of space and time heterogeneity in parallel samr applications. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 181–188. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Parashar, M., Browne, J.: On partitioning dynamic adaptive grid hierarchies. In: 29th Annual Hawaii Int. Conference on System Sciences, pp. 604–613 (1996)

    Google Scholar 

  12. Sagan, H.: Space Filling Curves. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  13. Steensland, J.: Efficient Partitioning of Structured Dynamic Grid Hierarchies. PhD thesis, Uppsala University (2002)

    Google Scholar 

  14. Steensland, J., Chandra, S., Parashar, M.: An application-centric characterization of domain-based sfc partitioners for parallel samr. Ieee Transactions on Parallel and Distributed Systems 13(12), 1275–1289 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, X., Parashar, M. (2005). Using Clustering to Address Heterogeneity and Dynamism in Parallel Scientific Applications. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds) High Performance Computing – HiPC 2005. HiPC 2005. Lecture Notes in Computer Science, vol 3769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602569_28

Download citation

  • DOI: https://doi.org/10.1007/11602569_28

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics