Processor Allocation Using a Reservation Technique in Hypercube Computers
暂无分享,去创建一个
[1] Nian-Feng Tzeng,et al. Dynamic processor allocation in hypercube computers , 1990, ISCA '90.
[2] Phillip Krueger,et al. Processor allocation vs. job scheduling on hypercube computers , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.
[3] J. Kim,et al. A Top-Down Processor Allocation Scheme for Hypercube Computers , 1991, IEEE Trans. Parallel Distributed Syst..
[4] The Performance of Multiprogrammed Multiprocessor Scheduling Policies , 1990, SIGMETRICS.
[5] B. Bose,et al. A new strategy for processors allocation in an N-cube multiprocessor , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.
[6] John P. Hayes,et al. Architecture of a Hypercube Supercomputer , 1986, ICPP.
[7] John P. Hayes,et al. Subcube Allocation in Hypercube Computers , 1991, IEEE Trans. Computers.
[8] Ming-Syan Chen,et al. Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.
[9] Kishor S. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .
[10] Dharma P. Agrawal,et al. Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.
[11] Qing Yang,et al. Prime Cube Graph Approach for Processor Allocation in Hypercube Multiprocessors , 1991, ICPP.