Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
List scheduling with and without communication delays
Parallel Computing
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A versatile cost modelling approach for multicomputer task scheduling
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
Scheduling Fork Graphs under LogP with an Unbounded Number of Processors
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
On Optimal k-linear Scheduling of Tree-Like Graphs for LogP-Machines
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Static Scheduling Using Task Replication for LogP and BSP Models
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
A New Approach to Scheduling Parallel Programs Using Task Duplication
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
On Minimising the Processor Requirements of LogP Schedules
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
| Hi-index | 0.01 |
While the problem of scheduling weighted arbitrary DAGs under the delay model has been studied extensively, comparatively little work exists for this problem under a more realistic model such as LogP. This paper investigates the similarities and differences between task clustering algorithms for the delay and LogP models. The principles behind three new algorithms for tackling the scheduling problem under the LogP model are described. The quality of the schedules produced by the algorithms are compared with good delay model-based algorithms and a previously existing LogP strategy.