Task Scheduling Algorithm to Reduce the Number of Processors using Merge Conditions
暂无分享,去创建一个
[1] Dharma P. Agrawal,et al. Optimal Scheduling Algorithm for Distributed-Memory Machines , 1998, IEEE Trans. Parallel Distributed Syst..
[2] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[3] Ümit V. Çatalyürek,et al. Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling , 2009, IEEE Transactions on Parallel and Distributed Systems.
[4] Xueyan Tang,et al. Optimizing static job scheduling in a network of heterogeneous computers , 2000, Proceedings 2000 International Conference on Parallel Processing.
[5] Yong Zhao,et al. A New Task Duplication Based Multitask Scheduling Method , 2006, 2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06).
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Tao Yang,et al. A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors , 1992, J. Parallel Distributed Comput..
[8] Mihalis Yannakakis,et al. Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.
[9] Linshan Shen,et al. Posterior Task Scheduling Algorithms for Heterogeneous Computing Systems , 2006, VECPAR.
[10] Ishfaq Ahmad,et al. Exploiting duplication to minimize the execution times of parallel programs on message-passing systems , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.
[11] Tae-Young Choe,et al. An optimal scheduling algorithm based on task duplication , 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001.