Managing complexity in the parallel sparse grid combination technique

J. W. Larson, P. E. Strazdins, M. Hegland, B. Harding, S. Roberts, L. Stals, A. P. Rendell, Md M. Ali, J. Southern

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Parallel implementation of the sparse grid combination technique in high dimensions presents many complexity challenges. We enumerate these challenges, classifying them respectively as computational, algorithmic, and software complexity. We discuss strategies for overcoming the individual complexity barriers. We describe our architecture for a software framework that will allow its users to build complex multiple grid solver applications.

Original languageEnglish
Pages (from-to)593-602
Number of pages10
JournalAdvances in Parallel Computing
Volume25
DOIs
Publication statusPublished - 2014
Externally publishedYes

Keywords

  • Fault-tolerance
  • High-dimensional Systems
  • MapReduce
  • Parallel Computing
  • Partial Differential Equations

Fingerprint Dive into the research topics of 'Managing complexity in the parallel sparse grid combination technique'. Together they form a unique fingerprint.

  • Cite this

    Larson, J. W., Strazdins, P. E., Hegland, M., Harding, B., Roberts, S., Stals, L., Rendell, A. P., Ali, M. M., & Southern, J. (2014). Managing complexity in the parallel sparse grid combination technique. Advances in Parallel Computing, 25, 593-602. https://doi.org/10.3233/978-1-61499-381-0-593