Implementation of a hierarchical N-body simulator using the Ompss programming model
Pages 23 - 30
Abstract
Many HPC algorithms are highly irregular. They have input-dependent control flow and operate on pointer-based data structures such as trees, graphs, or linked lists. This irregularity makes it challenging to parallelize such algorithms in order to efficiently run them on modern HPC systems. In this paper we study the architectural and programming bottlenecks of the OmpSs task-based programming model when implementing irregular applications. We select a sequential N-body simulation code and describe its parallelization using OmpSs. We then analyze the code, focusing on scalability and load balancing. We conclude that, in general, task-based programming models are well suited to the exploitation of irregular parallelism. Nevertheless, in order to avoid the overheads associated with manually managing the load balancing, the hardware and runtime will need to collectively support much finer-grained tasks.
References
[1]
J. Barnes and P. Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, 324:446--449, 1986.
[2]
J. E. Barnes. A modified tree code: don't laugh; it runs. J. Comput. Phys., 87:161--170, March 1990.
[3]
D. Blackston and T. Suel. Highly Portable and Efficient Implementations of Parallel Adaptive N-Body Methods. In Proceedings of the ACM/IEEE 1997 Conference on Supercomputing, 1997.
[4]
J. Coole, J. Wernsing, and G. Stitt. A Traversal Cache Framework for FPGA Acceleration of Pointer Data Structures: A Case Study on Barnes-Hut N-body Simulation. In Proceedings of the 2009 International Conference on Reconfigurable Computing and FPGAs, pages 143--148, 2009.
[5]
A. Duran, E. Ayguade, R. M. Badia, J. Labarta, L. Martinell, X. Martorell, and J. Planas. OmpSs: A Proposal for Programming Heterogeneous Multi-Core Architectures. Parallel Processing Letters, 21(2):173--193, 2011.
[6]
F. Cabarcas, A. Rico, A. Ramirez, R. M. Badia, E. Ayguade, J. Labarta, and M. Valero. Task Superscalar: An Out-of-Order Task Pipeline. In Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture, MICRO'43, pages 89--100, 2010.
[7]
M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. In Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, PLDI'98, pages 212--223, New York, NY, USA, 1998. ACM.
[8]
T. Hamada, T. Narumi, R. Yokota, K. Yasuoka, K. Nitadori, and M. Taiji. 42 TFlops hierarchical N-body simulations on GPUs with applications in both astrophysics and turbulence. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pages 62:1--62:12, 2009.
[9]
M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, and C. Casçaval. How much parallelism is there in irregular applications? In Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, PPoPP'09, pages 3--14, 2009.
[10]
H. C. Plummer. On the problem of distribution in globular star clusters. Monthly Notices of the Royal Astronomical Society, 71:460--470.
[11]
M. Warren and J. Salmon. Astrophysical N-body simulations using hierarchical tree data structures. In Proceedings of the 1992 Conference on High Performance Computing, Networking, Storage and Analysis, pages 570--576, 1992.
Index Terms
- Implementation of a hierarchical N-body simulator using the Ompss programming model
Recommendations
Leveraging OmpSs to Exploit Hardware Accelerators
SBAC-PAD '14: Proceedings of the 2014 IEEE 26th International Symposium on Computer Architecture and High Performance ComputingCUDA and OpenCL are the most widely used programming models to exploit hardware accelerators. Both programming models provide a C-based programming language to write accelerator kernels and a host API used to glue the host and kernel parts. Although ...
Exploring the interoperability of remote GPGPU virtualization using rCUDA and directive-based programming models
Directive-based programming models, such as OpenMP, OpenACC, and OmpSs, enable users to accelerate applications by using coprocessors with little effort. These devices offer significant computing power, but their use can introduce two problems: an ...
Exploiting Task-Parallelism on GPU Clusters via OmpSs and rCUDA Virtualization
TRUSTCOM-BIGDATASE-ISPA '15: Proceedings of the 2015 IEEE Trustcom/BigDataSE/ISPA - Volume 03OmpSs is a task-parallel programming model consisting of a reduced collection of OpenMP-like directives, a front-end compiler, and a runtime system. This directive-based programming interface helps developers accelerate their application's execution, ...
Comments
Information & Contributors
Information
Published In
November 2011
52 pages
ISBN:9781450311212
DOI:10.1145/2089142
- Program Chairs:
- John Feo,
- Oreste Villa,
- Antonino Tumeo,
- Simone Secchi
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 November 2011
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SC '11
Sponsor:
SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis
November 13, 2011
Washington, Seattle, USA
Acceptance Rates
Overall Acceptance Rate 18 of 67 submissions, 27%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 157Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in