By Topic

Optimal algorithms for scheduling large-scale divisible load on heterogeneous systems in non-blocking mode of communication

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
$33 $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)
Shang Mingsheng ; Sch. of Comput. Sci. & Eng., China Univ. of Electron. Sci. & Technol., Chengdu, China ; Sun Shixin

This paper considers scheduling large-scale divisible load on heterogeneous single-level tree networks to minimize the whole processing time. A more realistic and general model, i.e., both processors and links may have different speeds and arbitrary start-up costs, and with nonblocking mode of communication, is introduced. Under such environment, results are obtained including: (1) closed-form expressions both for the processing time and the fraction of load for each processor are derived; (2) the influence of start-up costs on the optimal processing time is analyzed; and (3) for bounded number of processors with large-scale workload, optimal sequence and algorithms for distributing divisible load are proposed. Numerical examples are presented to illustrate the analysis

Published in:

Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)

Date of Conference:

1-1 July 2005