An equivalent network for divisible load scheduling in nonblocking mode of communication

Authors:
S. Suresh;V. Mani;S. N. Omkar;H. J. Kim
Affiliations:
-;-;-;-
Venue:
Computers & Mathematics with Applications
Year:
2005

Citing 16
Cited 0

Reconfigurable mesh algorithms for the Hough transform

Journal of Parallel and Distributed Computing
Distributed computation with communication delays: asymptotic performance analysis

Journal of Parallel and Distributed Computing
Scheduling divisible jobs on hypercubes

Parallel Computing
Distributed processing of divisible jobs with communication startup costs

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communication delays

Journal of Parallel and Distributed Computing
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
On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks

IEEE Transactions on Parallel and Distributed Systems
Parallel Processor Configuration Design with Processing/Transmission Costs

IEEE Transactions on Computers
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays

IEEE Transactions on Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis

IEEE Transactions on Parallel and Distributed Systems
Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees

IEEE Transactions on Parallel and Distributed Systems
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
A Novel Optimal Load Distribution Algorithm for Divisible Loads

Cluster Computing
Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks

Cluster Computing

Quantified Score

Hi-index	0.09

Visualization

Abstract

Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is considered. For this scheduling problem, an equivalent single-level tree network in blocking mode of communication is derived. This equivalent network can be easily obtained by changing the speed parameters of the processors in the network. The advantages of this equivalent network are that we can easily obtain the results on when to distribute the load to processors in the network, optimal sequencing and arrangement of processors and the effect of start-up time in nonblocking mode of communication. Numerical examples are presented for ease of understanding the equivalent network concept.