Global trees: a framework for linked data structures on distributed memory parallel systems

  • Authors:

  • D. Brian Larkins;James Dinan;Sriram Krishnamoorthy;Srinivasan Parthasarathy;Atanas Rountev;P. Sadayappan

  • Affiliations:

  • The Ohio State University, Columbus, OH;The Ohio State University, Columbus, OH;Pacific Northwest National Laboratory, Richland, WA;The Ohio State University, Columbus, OH;The Ohio State University, Columbus, OH;The Ohio State University, Columbus, OH

  • Venue:
  • Proceedings of the 2008 ACM/IEEE conference on Supercomputing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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 shared-memory 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.