透過您的圖書館登入
IP:18.191.108.168
  • 期刊
  • OpenAccess

An Efficient Clustering-Based Task Scheduling Algorithm for Parallel Programs with Task Duplication

並列摘要


This paper presents an efficient task scheduling algorithm for multiprocessor systems based on clustering with task duplication. This algorithm has a relatively small time complexity of O(|E| log |V|) for a task graph of |V| nodes and |E| edges. Results from an extensive simulation run on randomly generated graphs as well as several application graphs demonstrate a significant improvement in using the proposed technique over several well-known fast techniques. Schedule lengths produced by the proposed algorithm are in general comparable to the ones generated by techniques with a much larger computation time requirement. Actual processing time required by this technique is among the smallest in all advanced techniques, while the number of processors needed is also among the least in all techniques.

延伸閱讀