By Topic

DFRN: a new approach for duplication based scheduling for distributed memory multiprocessor systems

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

3 Author(s)
Gyung-Leen Park ; Dept. of Comput. Sci. & Eng., Texas Univ., Arlington, TX, USA ; Shirazi, B. ; Marquis, J.

Duplication based scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target system. We classify DBS algorithms into two categories according to the task duplication method used. We then present our new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. Our simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with equal or less time complexity. We analytically obtain the boundary condition for the worst case behavior of the proposed algorithm and also prove that the algorithm generates an optimal schedule for a tree structured input directed acyclic graph

Published in:

Parallel Processing Symposium, 1997. Proceedings., 11th International

Date of Conference:

1-5 Apr 1997