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

Authors:
Veeravalli Bharadwaj;Gerassimos Barlas
Affiliations:
Open Source Software Laboratory (http://opensource.nus.edu.sg), Department of Electrical and Computer Engineering, The National University of Singapore, 10, Kent Ridge Crescent, Singapo ...;Department of Computer Science and Mathematics, College of Arts and Sciences, American University of Sharjah, PO Box 26666, UAE
Venue:
Cluster Computing
Year:
2003

Citing 12
Cited 6

Mapping Computer-Vision-Related Tasks onto Reconfigurable Parallel-Processing Systems

Computer
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
Parallel image processing applications on a network of workstations

Parallel Computing
Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communication delays

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
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
Static Global Scheduling for Optimal Computer Vision and Image Processing Operations on Distributed-Memory Multiprocessor

Static Global Scheduling for Optimal Computer Vision and Image Processing Operations on Distributed-Memory Multiprocessor
Suboptimal solutions using integer approximation techniques for scheduling divisible loads on distributed bus networks

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Design and Analysis of a Dynamic Scheduling Strategy with Resource Estimation for Large-Scale Grid Systems

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems

IEEE Transactions on Parallel and Distributed Systems
Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources

IEEE Transactions on Parallel and Distributed Systems
Mapping data-parallel tasks onto partially reconfigurable hybrid processor architectures

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Cluster-based optimized parallel video transcoding

Parallel Computing
A generalized linear programming based approach to optimal divisible load scheduling

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address the problem of processing a computationally intensive divisible load with high memory requirements on a bus network. Each network node is assumed to have a limited memory capacity (buffer space), while at the same time being available for processing after a specific time (release time). The combined influence of the release times, as well as the limited buffer capacity available, is considered in the problem formulation, with the objective to minimize the overall processing time of the divisible load. In the existing literature, these two issues have been considered independently, although in practice, they are commonly found to coexist. The Multi-Installment Balancing Strategy (MIBS) presented in this paper, manages to address both of these constraints by building on-top of the analytical solutions derived by a buffer capacity-unaware approach. MIBS monitors the available resources and adapts the processing and communication phases according to their availability. Towards this goal both single and/or multi-installment scheduling is utilized. The description of the algorithms accompany simulation experiments that highlight the behavior of MIBS. It should be stressed that the use of MIBS allows the processing of loads that exceed by far the total memory capacity of the available machines, while at the same time exhibiting processing times that match the ones predicted by strategies that ignore the memory constraints.