A simulator for adaptive parallel applications
Journal of Computer and System Sciences
A simulator for parallel applications with dynamically varying compute node allocation
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Dynamic Parallel Schedules (DPS) is a high-level frameworkfor developing parallel applications on distributed memorycomputers (e.g. clusters of PCs). Its model relies oncompositional customizable split-compute-merge graphs ofoperations (directed acyclic flow graphs). The graphs and themapping of operations to processing nodes are specifieddynamically at runtime. DPS applications are pipelined andmultithreaded by construction, ensuring a maximal overlap ofcomputations and communications. DPS applications can callparallel services exposed by other DPS applications, enabling thecreation of reusable parallel components. The DPS frameworkrelies on a C++ class library. Thanks to its dynamic nature, DPSoffers new perspectives for the creation and deployment ofparallel applications running on server clusters.