Abstract
The paper presents a closed form solution for an optimum scheduling of a divisible job on an optimum number of processor arranged in an optimum sequence in a multilevel tree networks. The solution has been derived for a single divisible job where there is no dependency among subtasks and the root processor can either perform communication and computation at the same time. The solution is carried out through three basic theorems. One of the theorems selects the optimum number of available processors that must participate in executing a divisible job. The other solves the sequencing problem in load distribution by which we are able to find the optimum sequence for load distribution in a generalized form. Having the optimum number of processors and their sequencing for load distribution, we have developed a closed form solution that determines the optimum share of each processor in the sequence such that the finish time is minimized. Any alteration of the number of processors, their sequences, or their shares that are determined by the three theorems will increase the finish time.
| Original language | English |
|---|---|
| Pages (from-to) | 31-51 |
| Number of pages | 21 |
| Journal | Journal of Interconnection Networks |
| Volume | 9 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - 2008 |
| Externally published | Yes |
Keywords
- Communication overhead
- Divisible jobs
- Multicomputer systems
- Network of workstations
- Scheduling
- Task assignment
ASJC Scopus subject areas
- Computer Networks and Communications