DPS - Dynamic Parallel Schedules

Dynamic Parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PC). 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


Published in:
17th International Parallel and Distributed Processing Symposium (IPDPS), 15-24
Presented at:
Proc. of 8th Int'l Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS 2003)
Year:
2003
Publisher:
IEEE Press
Keywords:
Laboratories:




 Record created 2007-01-31, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)