FleCSI 2.0: The Flexible Computational Science Infrastructure Project

  • Conference paper
  • First Online:
Euro-Par 2021: Parallel Processing Workshops (Euro-Par 2021)

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

Included in the following conference series:

  • 818 Accesses

Abstract

The FleCSI 2.0 programming system supports multiphysics application development through a runtime abstraction layer, and by providing core topology types that can be customized for specific numerical methods. The abstraction layer provides a single-source programming interface for distributed and shared-memory data parallelism through task and kernel execution, and has been demonstrated to introduce virtually no runtime overhead. FleCSIā€™s core topology types represent a rich set of basic data structures that can be specialized to create application-facing interfaces for a variety of different physics packages. Using the FleCSI control and data models, it is straightforward to compose multiple packages to create full multiphysics applications. When used with a task-based backend, FleCSI offers extended runtime analysis that can increase task concurrency, facilitate load balancing, and allow for portability across heterogeneous computing architectures.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (Canada)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bader, M.: Space-Filling Curves: An Introduction with Applications in Scientific Computing. Springer, Cham (2012)

    MATHĀ  Google ScholarĀ 

  2. Barnes, J.E., Hut, P.: A hierarchical O(n-log-n) force calculation algorithm. Nature 324, 446 (1986)

    ArticleĀ  Google ScholarĀ 

  3. Bauer, M., Treichler, S., Slaughter, E., Aiken, A.: Legion: expressing locality and independence with logical regions. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, Washington, DC, USA. IEEE Computer Society Press (2012)

    Google ScholarĀ 

  4. Bentley, M.: The high complexity jump-counting pattern (2019). https://www.plflib.org. Accessed 10 June 2021

  5. Bentley, M.: The low complexity jump-counting pattern (2019). https://www.plflib.org. Accessed 10 June 2021

  6. Boehme, D., et al.: Caliper: performance introspection for HPC software stacks. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2016, pp. 550ā€“560 (2016). https://doi.org/10.1109/SC.2016.46

  7. Technical Committee in-progress C++23 (2021). https://isocpp.org/std/the-standard. Accessed 14 June 2021

  8. Dagum, L., Menon, R.: OpenMP: an industry-standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46ā€“55 (1998). https://doi.org/10.1109/99.660313

    ArticleĀ  Google ScholarĀ 

  9. Edwards, H.C., Trott, C.R., Sunderland, D.: Kokkos: enabling manycore performance portability through polymorphic memory access patterns. J. Parallel Distrib. Comput. 74(12), 3202ā€“3216 (2014). https://doi.org/10.1016/j.jpdc.2014.07.003. Domain-Specific Languages and High-Level Frameworks for High-Performance Computing

    ArticleĀ  Google ScholarĀ 

  10. The Alliance for Computing at Extreme Scale (ACES): Crossroads: a critical element for improved predictive capability (2021). https://www.lanl.gov/projects/crossroads. Accessed 14 June 2021

  11. Message Passing Interface Forum: MPI: a message-passing interface standard. Technical report, USA (1994)

    Google ScholarĀ 

  12. Holmen, J.K., Sahasrabudhe, D., Berzins, M.: A heterogeneous MPI+ PPL task scheduling approach for asynchronous many-task runtime systems. In: Proceedings of the Practice and Experience in Advanced Research Computing 2021 on Sustainability, Success and Impact (PEARC21). ACM (2021)

    Google ScholarĀ 

  13. Ju, L., Ringler, T., Gunzburger, M.: Voronoi tessellations and their application to climate and global modeling. In: Lauritzen, P., Jablonowski, C., Taylor, M., Nair, R. (eds.) Numerical Techniques for Global Atmospheric Models. LNCSE, vol. 80, pp. 313ā€“342. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-11640-7_10

    ChapterĀ  Google ScholarĀ 

  14. Kaiser, H., Brodowicz, M., Sterling, T.: Parallex an advanced parallel execution model for scaling-impaired applications. In: 2009 International Conference on Parallel Processing Workshops, pp. 394ā€“401 (2009). https://doi.org/10.1109/ICPPW.2009.14

  15. Loiseau, J., et al.: FleCSPH: the next generation fleCSIble parallel computational infrastructure for smoothed particle hydrodynamics. SoftwareX 12, 100602 (2020)

    Google ScholarĀ 

  16. McCalpin, J.D.: Memory bandwidth and machine balance in current high performance computers. In: IEEE Computer Society Technical Committee on Computer Architecture (TCCA) Newsletter, pp. 19ā€“25, December 1995

    Google ScholarĀ 

  17. PĆ©rache, M., Carribault, P., Jourdren, H.: MPC-MPI: an MPI implementation reducing the overall memory consumption. In: Ropo, M., Westerholm, J., Dongarra, J. (eds.) EuroPVM/MPI 2009. LNCS, vol. 5759, pp. 94ā€“103. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03770-2_16

    ChapterĀ  Google ScholarĀ 

  18. Plimpton, S.J., Hendrickson, B., Stewart, J.R.: A parallel rendezvous algorithm for interpolation between multiple grids. J. Parallel Distrib. Comput. 64(2), 266ā€“276 (2004). https://doi.org/10.1016/j.jpdc.2003.11.006

    ArticleĀ  MATHĀ  Google ScholarĀ 

  19. Ringler, T., Petersen, M., Higdon, R.L., Jacobsen, D., Jones, P.W., Maltrud, M.: A multi-resolution approach to global ocean modeling. Ocean Model. 69, 211ā€“232 (2013)

    ArticleĀ  Google ScholarĀ 

  20. Ringler, T.D., Thuburn, J., Klemp, J.B., Skamarock, W.C.: A unified approach to energy conservation and potential vorticity dynamics for arbitrarily-structured c-grids. J. Comput. Phys. 229(9), 3065ā€“3090 (2010)

    ArticleĀ  MathSciNetĀ  Google ScholarĀ 

  21. Thomas, J.: LINI and HPE to partner with AMD on El Capitan, projected as worldā€™s fastest supercomputer (2021). https://www.llnl.gov/news/llnl-and-hpe-partner-amd-el-capitan-projected-worlds-fastest-supercomputer. Accessed 06 June 2021

  22. Warren, M.S., Salmon, J.K.: A parallel hashed oct-tree n-body algorithm. In: Proceedings of the 1993 ACM/IEEE Conference on Supercomputing, Supercomputing 1993, pp. 12ā€“21. ACM, New York (1993). https://doi.org/10.1145/169627.169640

  23. Williamson, D.L., Drake, J.B., Hack, J.J., Jakob, R., Swarztrauber, P.N.: A standard test set for numerical approximations to the shallow water equations in spherical geometry. J. Comput. Phys. 102(1), 211ā€“224 (1992)

    ArticleĀ  MathSciNetĀ  Google ScholarĀ 

Download references

Acknowledgments

FleCSI 2.0 is the culmination of several years of research and development, with many important contributors. We would like to acknowledge the following individuals for direct code contributions:

figure g

The initial design and development of FleCSI was funded under the Advanced Technology Development and Mitigation (ATDM) subprogram of LANLā€™s ASC program (NNSA/DOE). This work would not have been possible without close collaborations with the Legion and HPX teams, and the Ristra Project (part of ATDM). We would also like to acknowledge the leadership of the Ristra project: Aimee Hungerford, and David Daniel. The FleCSI project and the Darwin compute cluster are both funded by the Computational Systems and Software Environments (CSSE) subprogram of LANLā€™s ASC program (NNSA/DOE).

FleCSI website: https://flecsi.org .

Source code and issue tracking: https://github.com/flecsi/flecsi .

This work is approved for unlimited release: LA-UR-21-25604

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Ben Bergen , Irina Demeshko or Davis Herring .

Editor information

Editors and Affiliations

Appendices

ATopology Applications

As mentioned in Sect.Ā 3, this table gives some suggestions for the particular numerical methods that can be implemented with the various FleCSI core topology types. This list is meant only as an example, and is by no means exhaustive.

figure h

BSample Figures

Fig. 5.
figure 5

Example of MPAS mesh used to setup a standard shallow water test case fromĀ [23].

Fig. 6.
figure 6

Simulation of a neutron star merger disk outflow using FleCSPH.

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bergen, B. et al. (2022). FleCSI 2.0: The Flexible Computational Science Infrastructure Project. In: Chaves, R., et al. Euro-Par 2021: Parallel Processing Workshops. Euro-Par 2021. Lecture Notes in Computer Science, vol 13098. Springer, Cham. https://doi.org/10.1007/978-3-031-06156-1_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-06156-1_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-06155-4

  • Online ISBN: 978-3-031-06156-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation