Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Multi-protocol active messages on a cluster of SMP's
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
The Spice Book
On Construction of a Visualization Toolkit for MPI Parallel Programs in Cluster Environments
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
Hi-index | 0.00 |
The low cost and wide availability of PC-based clusters have made them excellent alternatives to supercomputing. However, while Network of Workstations are readily available, there is an increasing need for performance tools that support these computing platforms in order to achieve even higher performance. Strategies that may be considered toward such performance achievement we may list are: performance data analysis, algorithm design, parallel program restructuring, among others. Introduced in this paper is a toolkit that generates performance data and graphical charts of pure MPI, pure OpenMP, as well as hybrid MPI/OpenMP parallel applications, reflecting to its sequence of execution over time and cache behavior, with the use of DP*Graph representation, a parallel version of timing graph. That is, parallel applications have their execution sequence in a cluster system platform shown through graphical charts composed by sequential codes, parallel threads, dependencies and communication structures, symbols defined in DP*Graph. It is discussed the implementation of this toolkit, as also some of its features, together with experimental use of the toolkit on parallel applications such as matrix multiplication (parallel implementation using MPI) and SPICE3 (parallel implementation using OpenMP).