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

Abstract

Sarkar's edge zeroing heuristic [22] 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… (More)

Topics

4 Figures and Tables

Cite this paper

@article{Mishra2010AnEO, title={An extention of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme}, author={Abhishek Mishra and Anil Kumar Tripathi}, journal={2010 International Conference on Computer and Communication Technology (ICCCT)}, year={2010}, pages={647-651} }