Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/120151
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: Managing complexity in the parallel sparse grid combination technique
Author: Larson, J.
Strazdins, P.
Hegland, M.
Harding, B.
Roberts, S.
Stals, L.
Rendell, A.
Ali, M.
Southern, J.
Citation: Parallel Computing: Accelerating Computational Science and Engineering (CSE), 2014 / vol.25, pp.593-602
Publisher: IOS Press
Publisher Place: Amsterdam
Issue Date: 2014
Series/Report no.: Advances in Parallel Computing; 25
ISBN: 9781614993803
ISSN: 0927-5452
1879-808X
Conference Name: International Conference on Parallel Computing (10 Sep 2013 - 13 Sep 2013 : Garching, Germany)
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
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: High-dimensional Systems; Partial Differential Equations; Parallel Computing; Fault-tolerance; MapReduce
Rights: © 2014 The authors and IOS Press. All rights reserved.
RMID: 0030106420
DOI: 10.3233/978-1-61499-381-0-593
Grant ID: http://purl.org/au-research/grants/arc/LP110200410
Appears in Collections:Mathematical Sciences publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.