Structure Slicing: Extending Logical Regions with Fields

Citations Over TimeTop 10% of 2014 papers

Abstract

Applications on modern supercomputers are increasingly limited by the cost of data movement, but mainstream programming systems have few abstractions for describing the structure of a program's data. Consequently, the burden of managing data movement, placement, and layout currently falls primarily upon the programmer. To address this problem we previously proposed a data model based on logical regions and described Legion, a programming system incorporating logical regions. In this paper, we present structure slicing, which incorporates fields into the logical region data model. We show that structure slicing enables Legion to automatically infer task parallelism from field non-interference, decouple the specification of data usage from layout, and reduce the overall amount of data moved. We demonstrate that structure slicing enables both strong and weak scaling of three Legion applications including S3D, a production combustion simulation that uses logical regions with thousands of fields, with speedups of up to 3.68X over a vectorized CPU-only Fortran implementation and 1.88X over an independently hand-tuned OpenACC code.

Related Papers

• → Program slicing in understanding of large programs(2002)52 cited
• → Abstract Program Slicing: From Theory towards an Implementation(2010)15 cited
• → Scenario oriented program slicing(2008)6 cited
• → Dependence analysis based on dynamic slicing for debugging(2001)3 cited
• → Program Slicing Techniques over Software Version Histories(2019)