dc.contributor.author | Mishra, Abhishek | |
dc.date.accessioned | 2024-05-06T08:55:39Z | |
dc.date.available | 2024-05-06T08:55:39Z | |
dc.date.issued | 2010-09 | |
dc.identifier.uri | https://ieeexplore.ieee.org/abstract/document/5640450 | |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14730 | |
dc.description.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 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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Clustering Algorithms | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Program Processors | en_US |
dc.subject | Complexity Theory | en_US |
dc.subject | Scheduling Algorithm | en_US |
dc.title | An extention of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme | en_US |
dc.type | Article | en_US |
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |