Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays

Authors:
V. Bharadwaj;D. Ghose;V. Mani
Affiliations:
-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 1
Cited 21

Distributed computation with communication delays: asymptotic performance analysis

Journal of Parallel and Distributed Computing

On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks

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
Distributing and scheduling divisible task on parallel communicating processors

Journal of Computer Science and Technology
Optimal sharing of bags of tasks in heterogeneous clusters

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?"

ANSS '03 Proceedings of the 36th annual symposium on Simulation
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
An Equivalent Tree Network Methodology for Efficient Utilization of Front-Ends in Linear Network

Cluster Computing
Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks

Cluster Computing
Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors

Journal of Parallel and Distributed Computing
Multiround Algorithms for Scheduling Divisible Loads

IEEE Transactions on Parallel and Distributed Systems
Design and performance evaluation of load distribution strategies for multiple divisible loads on heterogeneous linear daisy chain networks

Journal of Parallel and Distributed Computing
A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments

IEEE Transactions on Parallel and Distributed Systems
A new load distribution strategy for linear network with communication delays

Mathematics and Computers in Simulation
An equivalent network for divisible load scheduling in nonblocking mode of communication

Computers & Mathematics with Applications
Fully polynomial time approximation schemes for scheduling divisible loads

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Greedy "exploitation" is close to optimal on node-heterogeneous clusters

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks

Mathematical and Computer Modelling: An International Journal
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm

Mathematical and Computer Modelling: An International Journal
Requirement-aware strategies for scheduling real-time divisible loads on clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of obtaining optimal processing time in a distributed computing systemconsisting of (N+1) processors and N communication links, arranged in a single-level tree architecture, is considered. It is shown that optimality can be achieved through ahierarchy of steps involving optimal load distribution, load sequencing, and processor-link arrangement. Closed-form expressions for optimal processing time is derived for a general case of networks with different processor speeds and different communication link speeds. Using these closed-form expressions, the paper analytically proves a number of significant results that in earlier studies were only conjectured from computationalresults. In addition, it also extends these results to a more general framework. The aboveanalysis is carried out for the cases in which the root processor may or may not beequipped with a front-end processor. Illustrative examples are given for all casesconsidered.