@Article{JICS-6-2,
author = {},
title = {An Extension of Edge Zeroing Heuristic for Scheduling Precedence Constrained Task Graphs},
journal = {Journal of Information and Computing Science},
year = {2011},
volume = {6},
number = {2},
pages = {83--96},
abstract = { 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  task  dependent  priority 
function  that  is  defined  for  pairs  of  tasks.  We  have  extended  this  idea  in  which  the  priority  is  a  cluster 
dependent  function  of  pairs  of  clusters  (of  tasks).  Using  this  idea  we  propose  an  algorithm  of  complexity 
O(|V||E|(|V|+|E|)) and compare it with some well known algorithms. 
},
issn = {1746-7659},
doi = {https://doi.org/2024-JICS-22681},
url = {https://global-sci.com/article/87413/an-extension-of-edge-zeroing-heuristic-for-scheduling-precedence-constrained-task-graphs}
}