Author:
Boeres Cristina,Chochia George,Thanisch Peter
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. J-J. Hwang, Y-C. Chow, F.D. Anger, and C-Y. Lee. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput., 18(2):244–257, 1989.
2. A.A. Khan, C.L. McCreary, and M.S. Jones A comparison of multiprocessor scheduling heuristics. Technical Report comparison-ICPP-94, Dept. of Computer Science and Engineering, Auburn University, 1994. Published in the Proceeding of the 8th Int. Parallel Processing Sym. — April, 1994.
3. S. Manoharan and P. Thanisch. Assigning dependency graphs onto processor networks. Parallel Computing, 17(1):63–73, 1991.
4. S. Manoharan and N.P. Topham. An assessment of assignment schemes for dependency graphs. Parallel Computing, 21(1):85–107, 1995.
5. M.G. Norman, G. Chochia, P. Thanisch, and E. Issman. Predicting the performance of the diamond dag computation. Technical Report EPCC-TR-92-07, Edinburgh Parallel Computing Centre, 1992.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献