| Abstract |
|
Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PCs). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic flow graphs). The graphs and the mapping of operations to processing nodes are specified dynamically at runtime. DPS applications are pipelined and multithreaded by construction, ensuring a maximal overlap of computations and communications. DPS applications can call parallel services exposed by other DPS applications, enabling the creation of reusable parallel components. The DPS framework relies on a C++ class library. Thanks to its dynamic nature, DPS offers new perspectives for the creation and deployment of parallel applications running on server clusters.
|
 Additional Information
|
Index Terms- Parallel computation, parallel schedules, flow
graphs, split-merge constructs, overlapping of computations and
communications
Citation:
Sebastian Gerlach, Roger D. Hersch,
"DPS - Dynamic Parallel Schedules,"
hips,
p. 15,
Eighth International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'03),
2003
|
