DOE OSTI · 965601
Global Trees: A Framework for Linked Data Structures on Distributed Memory Parallel Systems
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Larkins, D B, Dinan, James S, Krishnamoorthy, Sriram, Parthasarathy, Srinivasan, Rountev, Atanas, Sadayappan, Ponnuswamy. 2008-11-17. Global Trees: A Framework for Linked Data Structures on Distributed Memory Parallel Systems. https://doi.org/10.1109/sc.2008.5218880
Cite the original work for its findings. Save a collection to share your selection of sources.