Scheduling divisible jobs on hypercubes
Parallel Computing
Circuit-Switched Broadcasting in Torus and Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
LogP: a practical model of parallel computation
Communications of the ACM
Distributed processing of divisible jobs with communication startup costs
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Scheduling divisible loads in a three-dimensional mesh of processors
Parallel Computing
Scheduling a divisible task in a two-dimensional toroidal mesh
Proceedings of the third international conference on Graphs and optimization
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In this paper we propose a novel scheme for scheduling divisible task on parallel processors connected by system interconnection network with arbitrary topology. The divisible task is a computation that can be divided into arbitrary independent subtasks solved in parallel. Our model takes into consideration communication initial time and communication delays between processors. Moreover, by constructing the corresponding Network Spanning Tree (NST) for a network, our scheme can be applied to all kinds of network topologies. We present the concept of Balanced Task Distribution Tree and use it to design the Equation Set Creation Algorithm in which the set of linear equations is created by traversing the NST in post-order. After solving the created equations, we get the optimal task assignment scheme. Experiments confirm the applicability of our scheme in real-life situations.