An Adaptive Space-Sharing Policy for Heterogeneous Parallel Systems

Authors:
Zhengao Zhou;Sivarama P. Dandamudi
Affiliations:
-;-
Venue:
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Year:
2001

Citing 7
Cited 0

Robust partitioning policies of multiprocessor systems

Performance Evaluation - Special issue: performance modeling of parallel processing systems
Processor Saving Scheduling Policies for Multiprocessor Systems

IEEE Transactions on Computers
Performance of adaptive space sharing processor allocation policies for distributed-memory multicomputers

Journal of Parallel and Distributed Computing
On the Benefits and Limitations of Dynamic Partitioning in Parallel Computer Systems

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Parallel Job Scheduling: Issues and Approaches

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the distributed-memory parallel systems become heterogeneous in nature, it is important to devise scheduling policies that take node heterogeneity into account. Previous studies on this topic have focused on homogeneous systems. In this paper, we propose a new two-level space-sharing policy for heterogeneous systems. The proposed policy is an adaptive space-sharing policy that takes system load and user requirements into account. We compare the performance of the new policy with a previous policy. The results presented here show that the proposed policy provides substantial performance improvements.