Simultaneous Compression of Makespan and Number of Processors Using CRP

Authors:
Yiqun Ge;David Y. Y. Yun
Affiliations:
-;-
Venue:
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Year:
1996

Citing 10
Cited 2

Partitioning and scheduling parallel programs for execution on multiprocessors

Partitioning and scheduling parallel programs for execution on multiprocessors
Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
A fast static scheduling algorithm for DAGs on an unbounded number of processors

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
A Static Scheduling Algorithm Using Dynamic Critical Path for Assigning Parallel Algorithms onto Multiprocessors

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
A Comparison of Multiprocessor Scheduling Heuristics

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
A planning/scheduling methodology for the constrained resource problem

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Task Scheduling with Conflicting Objectives

ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
Genetic-algorithm-based real-time task scheduling with multiple goals

Journal of Systems and Software - Special issue: Computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new 2D Compression (2DC) method for solving the multiprocessor scheduling (MS) problems to simultaneously achieve both objectives of minimizing the makespan and the number of processors used. Most existing approaches tend to focus on a very specific range of the MS problems, while risking the loss of the solution quality elsewhere. 2DC synthesizes two main classes of compression approaches in both the time and resource dimensions by utilizing the Constrained Resource Planning (CRP) paradigm to balance the resource utilization and conservation. Experimental results show that 2DC extends the range of the solution effectiveness when measured separately in terms of the time and resource dimensions. More significantly, the 2DC method exhibits a remarkable solution quality and stability when measured in terms of a 2D cost function.