By Topic

An extention of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme

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)
Abhishek Mishra ; Department of Computer Engineering, Institute of Technology, Bañaras Hindu University, Varanasi, India ; Anil Kumar Tripathi

Sarkar's edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems can be viewed as a priority based algorithm in which the priority is assigned to edges. In this algorithm, the priority is taken as the edge weight. This can also be viewed as a module dependent priority function that is defined for pairs of modules. We have extended this idea in which the priority is a cluster dependent function of pairs of clusters (of modules). Using this idea we propose an algorithm of complexity O(|V||E|(|V|+|E|)) and compare it with some well known algorithms.

Published in:

Computer and Communication Technology (ICCCT), 2010 International Conference on

Date of Conference:

17-19 Sept. 2010