LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Optimal broadcast and summation in the LogP model
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Scheduling balanced task-graphs to LogP-machines
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Optimization of Parallel Programs on Machines with Expensive Communication
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Parallelization of Non-Simultaneous Iterative Methods for Systems of Linear Equations
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
Hi-index | 0.00 |
Efficient scheduling of task graphs for parallel machines is a major issue in parallel computing. Such algorithms are often hard to understand and hard to evaluate. We present a framework for the visualization of scheduling algorithms. Using the LogP cost model for parallel machines, we simulate the effects of scheduling algorithms for specific target machines and task graphs before performing time and resource consumptive measurements in practice.