Subcube Level Time-Sharing in Hypercube Multicomputers

A novel approach for subcube level time-sharing in hypercube multicomputers is proposed. Using this approach, multiple tasks may execute on the same processors. The tasks may be completely or partially overlapped with synchronous or asynchronous context switching. A dynamic binary tree is used for subcube allocation and deallocation. An incoming task is allocated to a subcube within which it will encounter minimum interference from other tasks. The allocation and deallocation time complexities are shown to be 0(n2). The proposed strategy has been implemented on an nCUBE 2. Measurement results indicate that the proposed strategy outperforms the FCFS-based batch-scheduling policy and an existing time-sharing policy by significantly reducing the average turn-around times.

[1]  Phillip Krueger,et al.  Processor allocation vs. job scheduling on hypercube computers , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[2]  Dhiraj K. Pradhan,et al.  Fast and Efficient Strategies for Cubic and Non-Cubic Allocation in Hypercube Multiprocessors , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[3]  Kenneth C. Knowlton,et al.  A fast storage allocator , 1965, CACM.

[4]  Dhiraj K. Pradhan,et al.  A novel approach for subcube allocation in hypercube multiprocessors , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[5]  G. Zorpette,et al.  Supercomputers-the power of parallelism , 1992 .

[6]  Valmir Carneiro Barbosa,et al.  Time sharing in hypercube multiprocessors , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[7]  Chita R. Das,et al.  A Lazy Scheduling Scheme for Improving Hypercube Performance , 1993, 1993 International Conference on Parallel Processing - ICPP'93.