Author:
Hori Atsushi,Ishikawa Yutaka,Nolte Jörg,Konaka Hiroki,Maeda Munenori,Tomokiyo Takashi
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. P.-J. Chuang and N.-F. Tzeng. A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers. IEEE Transactions on Computers, 41(4):467–479, 1992.
2. D. G. Feitelson and L. Rudolph. Distributed Hierarchical Control for Parallel Processing. COMPUTER, pages 65–77, May 1990.
3. A. Hori, Y. Ishikawa, H. Konaka, M. Maeda, and T. Tomokiyo. A Scalable Time-Sharing Scheduling for Partitionable, Distributed Memory Parallel Machines. In Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, volume II, pages 173–182. IEEE Computer Society Press, January 1995.
4. A. Hori, T. Yokota, Y. Ishikawa, S. Sakai, H. Konaka, M. Maeda, T. Tomokiyo, J. Nolte, H. Matsuoka, K. Okamoto, and H. Hirono. Time Space Sharing Scheduling and Architectural Support. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Computer Science. Springer-Verlag, April 1995.
5. P. Krueger, T.-H. Lai, and V. A. Dixit-Radiya. Job Scheduling Is More Important than Processor Allocation for Hypercube Computers. IEEE Transactions on Parallel and Distributed Systems, 5(5):488–497, 1994.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Overhead analysis of preemptive gang scheduling;Job Scheduling Strategies for Parallel Processing;1998