Managing complexity in the parallel sparse grid combination technique
Date
2014
Authors
Larson, J.W.
Strazdins, P.E.
Hegland, M.
Harding, B.
Roberts, S.
Stals, L.
Rendell, A.P.
Ali, M.M.
Southern, J.
Editors
Bader, M.
Bode, A.
Bungartz, H.J.
Gerndt, M.
Joubert, G.R.
Peters, F.
Bode, A.
Bungartz, H.J.
Gerndt, M.
Joubert, G.R.
Peters, F.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Advances in Parallel Computing, 2014 / Bader, M., Bode, A., Bungartz, H.J., Gerndt, M., Joubert, G.R., Peters, F. (ed./s), vol.25, pp.593-602
Statement of Responsibility
J. W. Larson, P. E. Strazdins, M. Hegland, B. Harding, S. Roberts , L. Stals , A. P. Rendell, Md. M. Ali , and J. Southern
Conference Name
International Conference on Parallel Computing (10 Sep 2013 - 13 Sep 2013 : Garching, Germany)
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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2014 The authors and IOS Press. All rights reserved.