Submitted by scrawford on
Title | Dataflow Programming Paradigms for Computational Chemistry Methods |
Publication Type | Tech Report |
Year of Publication | 2017 |
Authors | Jagode, H. |
Technical Report Series Title | Innovative Computing Laboratory Technical Report |
Number | ICL-UT-17-01 |
Date Published | 2017-05 |
Institution | University of Tennessee |
Type | PhD Dissertation (Computer Science) |
Abstract | The transition to multicore and heterogeneous architectures has shaped the High Performance Computing (HPC) landscape over the past decades. With the increase in scale, complexity, and heterogeneity of modern HPC platforms, one of the grim challenges for traditional programming models is to sustain the expected performance at scale. By contrast, dataflow programming models have been growing in popularity as a means to deliver a good balance between performance and portability in the post-petascale era. This work introduces dataflow programming models for computational chemistry methods, and compares different dataflow executions in terms of programmability, resource utilization, and scalability. This effort is driven by computational chemistry applications, considering that they comprise one of the driving forces of HPC. In particular, many-body methods, such as Coupled Cluster methods (CC), which are the “gold standard” to compute energies in quantum chemistry, are of particular interest for the applied chemistry community. On that account, the latest development for CC methods is used as the primary vehicle for this research, but our effort is not limited to CC and can be applied across other application domains. Two programming paradigms for expressing CC methods into a dataflow form, in order to make them capable of utilizing task scheduling systems, are presented. Explicit dataflow, is the programming model where the dataflow is explicitly specified by the developer, is contrasted with implicit dataflow, where a task scheduling runtime derives the dataflow. An abstract model is derived to explore the limits of the different dataflow programming paradigms. |
URL | http://trace.tennessee.edu/utk_graddiss/4469/ |