This paper describes the Global Trees (GT) system that provides a multi-layered interface to a global address space view of distributed tree data structures, while providing scalable performance on distributed memory systems. The Global Trees system utilizes coarse-grained data movement to enhance locality and communication efficiency. We describe the design and implementation of GT, illustrate its use in the context of a gravitational simulation application, and provide experimental results that demonstrate the effectiveness of the approach. The key benefits of using this system include efficient sharedmemory style programming of distributed trees, tree-specific optimizations for data access and computation, and the ability to customize many aspects of GT to optimize application performance.
Revised: October 1, 2009 |
Published: November 17, 2008
Citation
Larkins D.B., J.S. Dinan, S. Krishnamoorthy, S. Parthasarathy, A. Rountev, and P. Sadayappan. 2008.Global Trees: A Framework for Linked Data Structures on Distributed Memory Parallel Systems. In The International Conference for High Performance Computing, Networking, Storage, and Analysis. 2008. SC 2008.. Piscataway, New Jersey:Institute of Electrical and Electronics Engineers (IEEE).PNNL-SA-60967.doi:10.1109/SC.2008.5218880