Skip to main content

Parallel run-time system for adaptive mesh refinement

  • Minisymposium Talks
  • Conference paper
  • First Online:
Book cover Solving Irregularly Structured Problems in Parallel (IRREGULAR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1457))

Abstract

In this paper we present a parallel run-time system for the efficient implementation of adaptive applications on distributed memory machines. Our approach is application driven; the target applications are characterized by very large variations in time and length scales. Preliminary performance data from parallel unstructured adaptive mesh refinement on an SP machine suggest that the flexibility of our approach does not cause undue overhead.

This work was supported by NSF grant #9726388 and JPL award #961097.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Portable Run-Time Systems Consortium, http://www.cs.uoregon.edu/research/paracomp/ports

    Google Scholar 

  2. I. Foster, C. Kesselamn, S. Tuecke. The Nexus Task-parallel Runtime System, Proc. 1st Intl Workshop on Parallel Processing, 1994.

    Google Scholar 

  3. Pete Beckman and Dennis Gannon, Tulip: Parallel Run-time Support System for pC++, Computer Science, Indiana University, http://www.extreme.indiana.edu, 1996.

    Google Scholar 

  4. J.S. Chase, F.G. Amador, E.D. Lazowska, H.M. Levy and R.J. Littlefield. The Amber System: Parallel Programming on a Network of Multiprocessors SOSP12, pp 147–158, December, 1989.

    Google Scholar 

  5. R. Chandra, A. Gupta, J.L. Hennessy, COOL Parallel Programming Using C++ (eds. Wilson, G. and Lu, P.), The MIT Press, 1998.

    Google Scholar 

  6. L. Kale, S. Krishnan, Charm++, Parallel Programming Using C++ (eds. Wilson, G. and Lu, P.), The MIT Press, 1998.

    Google Scholar 

  7. C. Chang, G. Czajkowski, C. Hawblitzel, and T. von Eicken, Low-latency communication on the IBM RISC/6000 SP system, In Proceedings of Supercomputing'96.

    Google Scholar 

  8. Chris Hawblitzel and Nikos Chrisochoides Mobile Object Layer: A data migration framework for Active Messages Paradigm University of Notre Dame Department of Computer Science and Engineering TR 98-07, 1998.

    Google Scholar 

  9. D. Culler, J. Singh, A. Gupta Parallel Computer Architecture: A Hardware/Software Approach Morgan Kaufmann, 1998.

    Google Scholar 

  10. Warren, M. S. and Salmon J. K., A Parallel Hashed Oct-tree N-body Algorithm Proceedings, Supercomputing '93

    Google Scholar 

  11. Manish Parashar and James C. Browne. Distributed dynamic data-structures for parallel adaptive mesh refinement. In HiPC, 1995.

    Google Scholar 

  12. N. Chrisochoides, K. Pingali, I. Kodukula Data Movement and Control Substrate for Parallel Scientific Computing Lecture Notes in Computer Science, SpringerVerlag, Vol. 1199 pp 256–268, 1997

    Google Scholar 

  13. Thomas Sterling HTMT Tech Note: Notes from Notre Dame Architecture Workshop Technical Report, Serial No 016, Jet Propulsion Laboratory, 1998.

    Google Scholar 

  14. D. E. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumeta, T. von Eicken, and K. Yelick, Parallel Programming in Split-C, In Proceedings of Supercomputing, 1993.

    Google Scholar 

  15. M. Chandy and C. Kesselman, CC++: A Declarative Concurrent Object-Oriented Programming Notation, In Research Directions in Concurrent Object-Oriented Programming, MIT Press, 1993.

    Google Scholar 

  16. E. Arjomandi, W. O'Farrell, I. Kalas, G. Koblents, F. Ch. Eigler, and G. G. Gao, ABC++: Concurrency by Inheritance in C++, IBM Systems Journal, Vol. 34, No. 1, pp. 120–137, 1995.

    Google Scholar 

  17. R. Fowler, The complexity of using forwarding addresses for decentralized object finding In Proceedings of the 5th annual ACM symposium on principles of distributed computing, 1986.

    Google Scholar 

  18. R. Faginn, Extendible Hasing-A Fast Access Method for Dynamic Files, ACM TODS, Vol 4, pp 315, 1979.

    Google Scholar 

  19. Fox, G., R. Williams and P. Messina Parallel Computing Works! Morgan Kaufmann Publishers, Inc. San Francisco, California, 1994.

    Google Scholar 

  20. N. Chrisochoides, Multithreaded Model for Load Balancing Parallel Adaptive Computations On Multicomputers, Journal of Applied Numerical Mathematics 6 pp 1–17, 1996.

    Google Scholar 

  21. P. Chew, N. Chrisochoides, and F. Sukup Parallel Constrained Delaunay Meshing In the proceedings of 1997 Joint ASME/ASCE/SES Summer Meeting, Special Symposium on Trends in Unstructured Mesh Generation, 1997.

    Google Scholar 

  22. P. Chew, N. Chrisochoides, G. Gao, T. Ingrafea, K. Pingali, S. Vavasis, Crack Propagation on Teraflop Computers CISE Challenge Proposal Report (unpublished), Computer Science, Cornell University, 1997.

    Google Scholar 

  23. H-C. Chang, N. Chrisochoides, S. Hammes-Schiffer, and E. Maginn Multi-scale Molecular and Quantum Dynamics Simulations of Zeolite Transport and Chemistry KDI Proposal Report (unpublished), University of Notre Dame, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alfonso Ferreira José Rolim Horst Simon Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chrisochoides, N. (1998). Parallel run-time system for adaptive mesh refinement. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018556

Download citation

  • DOI: https://doi.org/10.1007/BFb0018556

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68533-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics