By Topic

Simultaneous compression of makespan and number of processors using CRP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yiqun Ge ; Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA ; Yun, D.Y.Y.

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

Published in:

Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

Date of Conference:

15-19 Apr 1996