Load and performance balancing scheme for heterogeneous parallel processing

Authors:
Tae-Hyung Kim
Affiliations:
Dept. of Computer Sci. & Eng., Hanyang University, Kyunggi-Do, Korea
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 5
Cited 0

Allocating Independent Subtasks on Parallel Processors

IEEE Transactions on Software Engineering
Guided self-scheduling: A practical scheduling scheme for parallel supercomputers

IEEE Transactions on Computers
The Legion vision of a worldwide virtual computer

Communications of the ACM
Adaptive Location Policies for Global Scheduling

IEEE Transactions on Software Engineering
Loop scheduling for heterogeneity

HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic loop scheduling methods are suitable for balancing parallel loops on shared-memory multiprocessor machines. However, their centralized nature causes a bottleneck for relatively small number of processors in internet-wise parallel processing using computational grids because of the order-of-magnitude differences in communications overheads. Moreover, improvements of basic loop scheduling methods have not dealt effectively with irregularly distributed workloads in parallel loops, which commonly occur in large applications. In this paper, we present a decentralized balancing method, which tries to balance load and performance simultaneously, for parallel loops on computational grids.