A Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules
暂无分享,去创建一个
[1] Kuldip Singh,et al. An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems , 2003, IEEE Trans. Parallel Distributed Syst..
[2] Hironori Kasahara,et al. Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.
[3] Atakan Dogan,et al. Optimal and suboptimal reliable scheduling of precedence-constrained tasks in heterogeneous distributed computing , 2000, Proceedings 2000. International Workshop on Parallel Processing.
[4] Y.-K. Kwok,et al. Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.
[5] Erol Gelenbe,et al. Task Assignment and Transaction Clustering Heuristics for Distributed Systems , 1997, Inf. Sci..
[6] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .
[7] Arjan J. C. van Gemund,et al. Low-Cost Task Scheduling for Distributed-Memory Machines , 2002, IEEE Trans. Parallel Distributed Syst..
[8] ZhuGuangxi,et al. An optimal scheduling algorithm based on task duplication , 2005 .
[9] Tae-Young Choe,et al. An Optimal Scheduling Algorithm Based on Task Duplication , 2002, IEEE Trans. Computers.
[10] Ishfaq Ahmad,et al. Optimal task assignment in heterogeneous distributed computing systems , 1998, IEEE Concurr..