Reference249 articles.
1. F. Afrati, E. Bampis, A. Fishkin, K. Jansen, and C. Kenyon. Scheduling to minimize the average completion time of dedicated tasks. In S. Kapoor and S. Prasad, editors, Proceedings of 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’00). LNCS, volume 1974, pages 454–464, 2000.
2. M. Ahuja and Y. Zhu. An O(nlogn) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube. Information Processing Letters, 35(1):7–11, 1990.
3. A. Al-Dhelaan and B. Bose. A new strategy for processors allocation in an n-cube multiprocessor. In Proceedings of 8th Annual International Phoenix Conference on Computers and Communications, pages 114–118, 1989.
4. A.K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis. Scheduling independent multiprocessor tasks. Algorithmica, 32(2):247–261, 2002.
5. A.K. Amoura. A note on scheduling multiprocessor tasks with precedence constraints on parallel processors. Information Processing Letters, 63(3):119–122, 1997.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献