Improving the scalability of parallel N-body applications with an event-driven constraint-based execution model-Reference-Cited by-同舟云学术

Improving the scalability of parallel N-body applications with an event-driven constraint-based execution model

Published:2012-04-11 Issue:3 Volume:26 Page:319-332
ISSN:1094-3420
Container-title:The International Journal of High Performance Computing Applications
language:en
Short-container-title:The International Journal of High Performance Computing Applications

Author:

Dekate Chirag¹²,Anderson Matthew³,Brodowicz Maciej²,Kaiser Hartmut¹²,Adelstein-Lelbach Bryce²,Sterling Thomas¹

Affiliation:

1. Department of Computer Science, Louisiana State University, Baton Rouge, LA, USA

2. Center for Computation and Technology, Louisiana State University, Baton Rouge, LA, USA

3. Center for Research in Extreme Scale Technologies, Indiana University, Bloomington, IN, 47408, USA

Abstract

The scalability and efficiency of graph applications are significantly constrained by conventional systems and their supporting programming models. Technology trends such as multicore, manycore, and heterogeneous system architectures are introducing further challenges and possibilities for emerging application domains such as graph applications. This paper explores the parallel execution of graphs that are generated using the Barnes–Hut algorithm to exemplify dynamic workloads. The workloads are expressed using the semantics of an exascale computing execution model called ParalleX. For comparison, results using conventional execution model semantics are also presented. We find improved load balancing during runtime and automatic parallelism discovery by using the advanced semantics for exascale computing.

Publisher

SAGE Publications

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://journals.sagepub.com/doi/pdf/10.1177/1094342012440585

Reference38 articles.

1. Continuation-passing, closure-passing style

2. The incremental garbage collection of processes

3. A hierarchical O(N log N) force-calculation algorithm

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Adaptive tiling for parallel N-body simulations on many core;Astronomy and Computing;2021-07

2. Harnessing billions of tasks for a scalable portable hydrodynamic simulation of the merger of two stars;The International Journal of High Performance Computing Applications;2019-02-14

3. Asymptotic Computing - Undoing the Damage;ADV PARALLEL COMPUT;2017

4. Enhancing the Performance of Parallel N-Body Simulation;IEEE INT ADV COMPUT;2017

5. Fractional Permissions for Race-Free Mutable References in a Dataflow Intermediate Language;First Workshop on Programming Models and Languages for Distributed Computing;2016-07-17