By Topic

Augmenting work-greedy assignment schemes with task duplication

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

1 Author(s)
Manoharan, S. ; Dept. of Comput. Sci., Auckland Univ., New Zealand

This paper analyses the effect of task duplication on the assignment of task dependency graphs onto concurrent processor systems. It presents a scheme to augment work-greedy assignment schemes with task duplication. Such augmentation results in a time-complexity increase which is well below that of comparable assignment schemes with task duplication. The paper shows empirical results comparing the augmented assignment schemes

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997