An Efficient Strategy for Task Duplication in Multiport Message-Passing Systems
暂无分享,去创建一个
Naohiro Ishii | Yuji Iwahori | Tatsuya Hayashi | Dingchao Li | N. Ishii | Y. Iwahori | Tatsuya Hayashi | Dingchao Li
[1] Dharma P. Agrawal,et al. Optimal Scheduling Algorithm for Distributed-Memory Machines , 1998, IEEE Trans. Parallel Distributed Syst..
[2] Edward A. Lee,et al. A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..
[3] 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.
[4] Hesham El-Rewini,et al. Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..
[5] Philippe Chrétienne,et al. C.P.M. Scheduling with Small Communication Delays and Task Duplication , 1991, Oper. Res..
[6] Jing-Chiou Liou,et al. Task Clustering and Scheduling for Distributed Memory Parallel Architectures , 1996, IEEE Trans. Parallel Distributed Syst..
[7] Boontee Kruatrachue,et al. Grain size determination for parallel processing , 1988, IEEE Software.
[8] S. Ranka,et al. Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors , 1992, Proceedings Supercomputing '92.
[9] Jayesh Siddhiwala,et al. Path-Based Task Replication for Scheduling with Communication Costs , 1995, ICPP.