Theory of linear and integer programming
Theory of linear and integer programming
Parallel image processing applications on a network of workstations
Parallel Computing
Modeling communication pipeline latency
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Mathematics and Computers in Simulation
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Experiments with Scheduling Divisible Tasks in Clusters of Workstations
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Optimal Scheduling Algorithms for Communication Constrained Parallel Processing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
An Optimal Scheduling Scheme for Parallel Video Processing
ICMCS '98 Proceedings of the IEEE International Conference on Multimedia Computing and Systems
Scheduling divisible loads with return messages on heterogeneous master-worker platforms
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
An incentive-based distributed mechanism for scheduling divisible loads in tree networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was considered under the two-port model, where a given processor can simultaneously send and receive a message. Here, we concentrate on the one-port model, where a processor can either send or receive a message at a given time step. The problem of scheduling divisible load on star platforms turns out to be very difficult as soon as return messages are involved. Unfortunately, we have not been able to assess its complexity, but we provide an optimal solution in the special (but important) case of FIFO communication schemes. We also provide an explicit formula for the optimal number of load units that can be processed by a FIFO ordering on a bus network. Finally, we provide a set of MPI experiments to assess the accuracy and usefulness of our results in a real framework.