Title | Addressing Global Data Dependencies in Heterogeneous Asynchronous Runtime Systems on GPUs |
Publication Type | Conference Paper |
Year of Publication | 2017 |
Authors | Peterson, Brad, Humphrey, Alan, Schmidt, John, Berzins, Martin |
Conference Name | Proceedings of the Third International Workshop on Extreme Scale Programming Models and Middleware |
Publisher | ACM |
Conference Location | New York, NY, USA |
ISBN Number | 978-1-4503-5133-1 |
Keywords | Asynchronous Many-Task, Coal Boiler, Collaboration, composability, Data dependencies, GPU, middleware security, policy, policy-based governance, Programming Models, pubcrawl, Radiative Heat Transfer, resilience, Resiliency, Runtime Systems, Scalability, Uintah |
Abstract | Large-scale parallel applications with complex global data dependencies beyond those of reductions pose significant scalability challenges in an asynchronous runtime system. Internodal challenges include identifying the all-to-all communication of data dependencies among the nodes. Intranodal challenges include gathering together these data dependencies into usable data objects while avoiding data duplication. This paper addresses these challenges within the context of a large-scale, industrial coal boiler simulation using the Uintah asynchronous many-task runtime system on GPU architectures. We show significant reduction in time spent analyzing data dependencies through refinements in our dependency search algorithm. Multiple task graphs are used to eliminate subsequent analysis when task graphs change in predictable and repeatable ways. Using a combined data store and task scheduler redesign reduces data dependency duplication ensuring that problems fit within host and GPU memory. These modifications did not require any changes to application code or sweeping changes to the Uintah runtime system. We report results running on the DOE Titan system on 119K CPU cores and 7.5K GPUs simultaneously. Our solutions can be generalized to other task dependency problems with global dependencies among thousands of nodes which must be processed efficiently at large scale. |
URL | http://doi.acm.org/10.1145/3152041.3152082 |
DOI | 10.1145/3152041.3152082 |
Citation Key | peterson_addressing_2017 |