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

doi:10.3233/978-1-61499-381-0-593

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

National Computational Infrastructure

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 language	English
Title of host publication	Parallel Computing
Subtitle of host publication	Accelerating Computational Science and Engineering (CSE)
Publisher	IOS Press BV
Pages	593-602
Number of pages	10
ISBN (Print)	9781614993803
DOIs	https://doi.org/10.3233/978-1-61499-381-0-593
Publication status	Published - 2014

Publication series

Name	Advances in Parallel Computing
Volume	25
ISSN (Print)	0927-5452

Access to Document

10.3233/978-1-61499-381-0-593

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. In Parallel Computing: Accelerating Computational Science and Engineering (CSE) (pp. 593-602). (Advances in Parallel Computing; Vol. 25). IOS Press BV. https://doi.org/10.3233/978-1-61499-381-0-593

@inproceedings{81c3dba8cc774cfc9d881b917f561815,

title = "Managing complexity in the parallel sparse grid combination technique",

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.",

keywords = "Fault-tolerance, High-dimensional Systems, MapReduce, Parallel Computing, Partial Differential Equations",

author = "Larson, {J. W.} and Strazdins, {P. E.} and M. Hegland and B. Harding and S. Roberts and L. Stals and Rendell, {A. P.} and Ali, {Md M.} and J. Southern",

year = "2014",

doi = "10.3233/978-1-61499-381-0-593",

language = "English",

isbn = "9781614993803",

series = "Advances in Parallel Computing",

publisher = "IOS Press BV",

pages = "593--602",

booktitle = "Parallel Computing",

address = "Netherlands",

}

Larson, JW, Strazdins, PE, Hegland, M, Harding, B, Roberts, S , Stals, L, Rendell, AP, Ali, MM & Southern, J 2014, Managing complexity in the parallel sparse grid combination technique. in Parallel Computing: Accelerating Computational Science and Engineering (CSE). Advances in Parallel Computing, vol. 25, IOS Press BV, pp. 593-602. https://doi.org/10.3233/978-1-61499-381-0-593

Managing complexity in the parallel sparse grid combination technique. / Larson, J. W.; Strazdins, P. E.; Hegland, M. et al.
Parallel Computing: Accelerating Computational Science and Engineering (CSE). IOS Press BV, 2014. p. 593-602 (Advances in Parallel Computing; Vol. 25).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Managing complexity in the parallel sparse grid combination technique

AU - Larson, J. W.

AU - Strazdins, P. E.

AU - Hegland, M.

AU - Harding, B.

AU - Roberts, S.

AU - Stals, L.

AU - Rendell, A. P.

AU - Ali, Md M.

AU - Southern, J.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Fault-tolerance

KW - High-dimensional Systems

KW - MapReduce

KW - Parallel Computing

KW - Partial Differential Equations

UR - http://www.scopus.com/inward/record.url?scp=84902255098&partnerID=8YFLogxK

U2 - 10.3233/978-1-61499-381-0-593

DO - 10.3233/978-1-61499-381-0-593

M3 - Conference contribution

AN - SCOPUS:84902255098

SN - 9781614993803

T3 - Advances in Parallel Computing

SP - 593

EP - 602

BT - Parallel Computing

PB - IOS Press BV

ER -

Managing complexity in the parallel sparse grid combination technique

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this