[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/645449.653057guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

A Generic C++ Framework for Parallel Mesh-Based Scientific Applications

Published: 23 April 2001 Publication History

Abstract

The objects that occur in scientific applications can be classified into spatial structures, e.g. meshes, grids, or graphs, and (numerical) data that are associated with these structures, e.g. grid functions and (sparse) matrices. Our C++ template library Janus rests on the observation that the spatial structures are conceptually more stable than the associated data. Janus provides a conceptual framework and generic components for mesh-based scientific applications. An outstanding feature of Janus is its unified treatment of regular and irregular structures. Our library has been developed using the paradigm of generic programming and is portably implemented on top of the Standard Template Library. It runs on top of MPI, but it can also be put onto other parallel platforms.

References

[1]
S. Balay, W. D. Gropp, L. C. McInnes, and B. F. Smith. Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries Programming. In A. M. Bruaset E. Arge, and H. P. Langtangen, editors, Modern Software Tools in Scientific Computing, pages 163- 202. Birkhauser Press, 1997.
[2]
M. Besch and H.W. Pohl. Topographic Data Mapping by Balanced Hypersphere Tesselation. In Proceedings of Euro-Par Conference, LNCS, Lyon, France, August 1996. Springer-Verlag.
[3]
Scott Cohn. Home Page of SAMRAI: Structured Adaptive Mesh Refinement Applications Infrastructure. Lawrence Livermore National Laboratory. http://www.llnl.gov/CASC/SAMRAI/team.html.
[4]
Peter Deuflhard. Cascadic conjugate gradient methods for elliptic partial differential equations. algorithm and numerical results. In D. Keyes and J. Xu, editors, Proc. of the 7th Int. Conf. on Domain Decomposition Methods 1993, pages 29-42, Providence, 1994. AMS.
[5]
J. Gerlach and P. Gottschling. Finite Elements with Janus. Technical Report in preparation, Real World Computing Partnership, Japan, 2000.
[6]
J. Gerlach, P. Gottschling, and H.W. Pohl. Core Components of Janus, Release 2.0. Technical Report TR D-00-028, Real World Computing Partnership, Japan, 2000.
[7]
S. Karmesin, J. Crotinger, J. Cummings, S. Haney, W. Humphrey, J. Reynders, S. Smith, and T.J. Williams. Array Design and Expression Evaluation in POOMA II. In Proceedings of ISCOPE 98, volume 1505 of LNCS, pages 231-238, Santa Fe, New Mexico, USA, December 1998. Springer-Verlag.
[8]
G. Karypis. Metis a Family of Multilevel Partitioning Algorithms. http://www-users.cs.umn.edu/~karypis/metis/main.shtml.
[9]
L.-Q. Lee, J. Siek, and A. Lumsdaine. Generic Graph Algorithms for Sparse Matrix Ordering. In Proc. of ISCOPE 99, LNCS, San Francisco, December 1999. Springer-Verlag.
[10]
D.R. Musser and A.A. Stepanov. Generic Programming. In First Int. Joint Conf. of ISSAC-88 and AAECC-6, volume 358 of LNCS, pages 13-25. Springer, June 1988.
[11]
J. R. Shewchuk. A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator. http://www.cs.cmu.edu/~quake/triangle.html.
[12]
J. G. Siek and A. Lumsdaine. The Matrix Template Library: A Generic Programming Approach to High Performance Numerical Algebra. In Proceedings of ISCOPE 98, volume 1505 of LNCS, pages 59-70, Santa Fe, New Mexico, USA, December 1998. Springer-Verlag.
[13]
M. Snir, S. Otto, S. Huss-Ledermann, D. Walker, and J. Dongarra. MPI--The Complete Reference, Volume 1, The MPI Core. The MIT Press, 1998.
[14]
Alex Stepanov. Standard Template Library Programmer's Guide. http://www.sgi.com/Technology/STL.
[15]
Hiroshi Tezuka, Atsushi Hori, Yutaka Ishikawa, and Mitsuhisa Sato. PM: An Operating System Coordinated High Performance Communication Library. In Bob Hertzberger Peter Sloot, editor, High-Performance Computing and Networking, volume 1225 of Lecture Notes in Computer Science, pages 708-717. Springer, April 1997.

Cited By

View all
  • (2017)An empirical study of data decomposition for software parallelizationJournal of Systems and Software10.1016/j.jss.2016.02.002125:C(401-416)Online publication date: 1-Mar-2017
  • (2010)PASTHAProceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming10.1145/1708046.1708052(5-14)Online publication date: 19-Jan-2010
  • (2009)Generic compressed sparse matrix insertionProceedings of the 8th workshop on Parallel/High-Performance Object-Oriented Scientific Computing10.1145/1595655.1595657(1-8)Online publication date: 7-Jul-2009

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
HIPS '01: Proceedings of the 6th International Workshop on High-Level Parallel Programming Models and Supportive Environments
April 2001
138 pages
ISBN:3540419446

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 April 2001

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2017)An empirical study of data decomposition for software parallelizationJournal of Systems and Software10.1016/j.jss.2016.02.002125:C(401-416)Online publication date: 1-Mar-2017
  • (2010)PASTHAProceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming10.1145/1708046.1708052(5-14)Online publication date: 19-Jan-2010
  • (2009)Generic compressed sparse matrix insertionProceedings of the 8th workshop on Parallel/High-Performance Object-Oriented Scientific Computing10.1145/1595655.1595657(1-8)Online publication date: 7-Jul-2009

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media