By Topic

Parallelization of scheduling algorithms

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)
Min-You Wu ; Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA ; Wei Shu

Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP algorithm. The proposed algorithm has been implemented on an Intel Paragon machine. It produces high-quality scheduling and is much faster than existing sequential and parallel algorithms

Published in:

Parallel Architectures, Algorithms, and Networks, 1996. Proceedings., Second International Symposium on

Date of Conference:

12-14 Jun 1996