DaStGen—A Data Structure Generator for Parallel C++ HPC Software

Bungartz, Hans‐Joachim; Eckhardt, Wolfgang; Mehl, Miriam; Weinzierl, Tobias

doi:10.1007/978-3-540-69389-5_25

Cited by 7 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Peano supports native C user data natively. If users want to model more complex data structures per cell or vertex, respectively, Peano relies on DaStGen [16,20]. DaStGen is a C++ augmentation which automatically equips C++ classes with MPI data types, data compression, different class variants distinguishing temporary from persistent object attributes, and so forth.…”

Section: A Software Basementioning

confidence: 99%

The Peano Software—Parallel, Automaton-based, Dynamically Adaptive Grid Traversals

Weinzierl

2019

ACM Trans. Math. Softw.

Self Cite

View full text Add to dashboard Cite

We discuss the design decisions, design alternatives and rationale behind the third generation of Peano, a framework for dynamically adaptive Cartesian meshes derived from spacetrees. Peano ties the mesh traversal to the mesh storage and supports only one element-wise traversal order resulting from space-filling curves. The user is not free to choose a traversal order herself. The traversal can exploit regular grid subregions and shared memory as well as distributed memory systems with almost no modifications to a serial application code. We formalize the software design by means of two interacting automata-one automaton for the multiscale grid traversal and one for the applicationspecific algorithmic steps. This yields a callback-based programming paradigm. We further sketch the supported application types and the two data storage schemes realized, before we detail high-performance computing aspects and lessons learned. Special emphasis is put on observations regarding the used programming idioms and algorithmic concepts. This transforms our report from a "one way to implement things" code description into a generic discussion and summary of some alternatives, rationale and design decisions to be made for any tree-based adaptive mesh refinement software.

show abstract

Section: A Software Basementioning

confidence: 99%

The Peano Software—Parallel, Automaton-based, Dynamically Adaptive Grid Traversals

Weinzierl

2019

ACM Trans. Math. Softw.

Self Cite

View full text Add to dashboard Cite

show abstract

“…This technique has been widely explored and used in different computer science and engineering fields as is proven by the literature found on the topic [60][61][62][63][64][65]. It is also used to a limited extent in the XML data binding tool JiBX 10 .…”

Section: Inheritance Flatteningmentioning

confidence: 99%

Personalised code generation from large schema sets for geospatial mobile applications

et al. 2013

View full text Add to dashboard Cite

Revista:Computing Versión / Versió: Post-print Cita bibliográfica / Cita bibliogràfica (ISO 690):TAMAYO, Alain, et al. Personalised code generation from large schema sets for geospatial mobile applications. Computing, 2014, vol. 96, no 5, p. 355-379. Abstract XML and XML Schema are used in the geospatial domain for the definition of standards that enhance the interoperability between producers and consumers of spatial data. The size and complexity of these geospatial standards and their associated schemas have been growing with time reaching levels of complexity that make it difficult to build systems based on them in a timely and cost-effective manner. The problem of producing XML processing code based on large schemas has been traditionally solved by using XML data binding generators. Unfortunately, this solution is not always effective when code is generated for resource-constrained devices, such as mobile phones. Large and complex schemas often result in the production of code with a large size and a complicated structure that might not fit the device limitations. In this article we present Instance-based XML data binding, an approach to produce more compact application-specific XML processing code for geospatial applications targeted to mobile devices. The approach tries to reduce the size and complexity of the generated code by using information about how schemas are used by individual applications. Our experimental results suggest a significant simplification of XML Schema sets to the real needs of client applications accompanied by a substantial reduction of size of the generated code.

show abstract

“…Besides the floating point techniques and the features from [4], this paper also places special emphasis on the execution speed of the generated code-one expects the packing operations to introduce a runtime penalty, but this assumption does not prove true-and establishes objects with multiple memory storage layouts.…”

Section: Introductionmentioning

confidence: 98%

“…The previous publication [4] does not discuss the treatment of floating point numbers. However, records in scientific codes typically contain lots of floating point attributes.…”

Section: Introductionmentioning

confidence: 98%

“…Finally, writing MPI data types for C++ records is a cumbersome and errorprone task, if there are multiple variants of a class due to compile guards. In [4], we discuss techniques to master the memory drawbacks, we augment C++ with some new keywords acting as directives for attributes, and we introduce the tool DaStGen (Data Structure Generator) that acts as a preprocessor, maps the modified language to optimised plain C++ and, similar to [5,6], for example, simplifies the handling of MPI data structures.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation