Scaling Implicit Parallelism via Dynamic Control Replication
We present dynamic control replication, a run-time program analysis that enables scalable execution of implicitly parallel programs on large machines through a distributed and efficient dynamic dependence analysis. Dynamic control replication distributes dependence analysis by executing multiple copies of an implicitly parallel program while ensuring that they still collectively behave as a single execution. By distributing and parallelizing the dependence analysis, dynamic control replication supports efficient, on-the-fly computation of dependences for programs with arbitrary control flow at scale. We describe an asymptotically scalable algorithm for implementing dynamic control replication that maintains the sequential semantics of implicitly parallel programs.
An implementation of dynamic control replication in the Legion runtime delivers the same programmer productivity as writing in other implicitly parallel programming models, such as Dask or TensorFlow, while providing better performance (11.4X and 14.9X respectively in our experiments), and scalability to hundreds of nodes. We also show that dynamic control replication provides good absolute performance and scaling for HPC applications, competitive in many cases with explicitly parallel programming systems.
Conference DayMon 1 MarDisplayed time zone: Eastern Time (US & Canada) change
11:10 - 12:10
|Synthesizing Optimal Collective Algorithms|
Zixian CaiAustralian National University, Zhengyang LiuUniversity of Utah, Saeed MalekiMicrosoft Research, Madan MusuvathiMicrosoft Research, Todd MytkowiczMicrosoft Research, Jacob NelsonMicrosoft Research, Olli SaarikiviMicrosoft Research, RedmondLink to publication
|Parallel Binary Code Analysis|
Xiaozhu MengRice University, Jonathon AndersonRice University, John Mellor-CrummeyRice University, Mark W. KrentelRice University, Barton P. MillerUniversity of Wisconsin - Madison, Srđan MilakovićRice UniversityLink to publication
|Compiler Support for Near Data Computing|
Mahmut Taylan KandemirPenn State University, USA, Jihyun RyooPenn State University, USA, Xulong TangUniversity of Pittsburgh, USA, Mustafa KarakoyTUBITAK-BILGEM, TurkeyLink to publication
|Scaling Implicit Parallelism via Dynamic Control Replication|
Michael BauerNVIDIA, Wonchan LeeNVIDIA, Elliott SlaughterSLAC National Accelerator Laboratory, Zhihao JiaCarnegie Mellon University, Mario Di RenzoSapienza University of Rome, Manolis PapadakisNVIDIA, Galen ShipmanLos Alamos National Laboratory, Patrick McCormickLos Alamos National Laboratory, Michael GarlandNVIDIA, Alex AikenStanford UniveristyLink to publication