Dynamic parallelization of modifications to directed acyclic graphs

Abstract

W e describe a higher-order interprocedural technique, called dynamic resolution, for the automatic parallelization of procedures that destructively manipulate dynamic DAGs. Dynamic resolution detects shared data and correctly coordinates access to thzs data at run time. I n pointer-unsafe languages such as C, dynamic resolution requires programmer identification of acyclic data structures and use of dynamic resolution's macros for pointer manipulations. I n pointer-safe languages such as ML, cyclicity can often be inferred by the compiler and parallelization via dynamic resolution can be completely automatic.This paper empirically studies the performance of dynamic resolution. Our study reveals that dynamic resolution applied to statically unparallelizable programs can outperform the optimized sequential versions on fast shared-memory multiprocessors. I n particular, dynamic-resolution implementations of two problems ( D A G rewrite and in-place list quicksort) using three processors already outperform their sequential counterparts. For both problems, the absolute performance of dynamic resolution steadily improves as processors are added. W e also observe that dynamic resolution can offset its runtime overheads in the presence of some shared structure. Dynamic resolution is the first technique that can automatically and eflectively parallelize D A G rewrite and destructive list quicksort.

Automatic resource management using an adaptive parallelism environment

“…The second flavor of dynamic parallelism is called Dynamic Resolution [7][8] [6]. Under dynamic resolution, the compiler inserts tags to detect conflicts in shared data, and these tags are examined and updated during runtime.…”