Legion: Expressing locality and independence with logical regions

Citations Over TimeTop 10% of 2012 papers

Abstract

Modern parallel architectures have both heterogeneous processors and deep, complex memory hierarchies. We present Legion, a programming model and runtime system for achieving high performance on these machines. Legion is organized around logical regions, which express both locality and independence of program data, and tasks, functions that perform computations on regions. We describe a runtime system that dynamically extracts parallelism from Legion programs, using a distributed, parallel scheduling algorithm that identifies both independent tasks and nested parallelism. Legion also enables explicit, programmer controlled movement of data through the memory hierarchy and placement of tasks based on locality information via a novel mapping interface. We evaluate our Legion implementation on three applications: fluid-flow on a regular grid, a three-level AMR code solving a heat diffusion equation, and a circuit simulation.

Related Papers

• → CUDA-Lite: Reducing GPU Programming Complexity(2008)242 cited
• → Survey on Parallel Programming Model(2008)68 cited
• → Models of parallel computation: a survey and classification(2007)26 cited
• → Impact of the Memory Hierarchy on Shared Memory Architectures in Multicore Programming Models(2009)6 cited
• → Northup: Divide-and-Conquer Programming in Systems with Heterogeneous Memories and Processors(2019)2 cited