DocumentCode :
2710441
Title :
Subcube Level Time-Sharing in Hypercube Multicomputers
Author :
Sharma, Debendra Das ; Holland, Gavin D. ; Pradhan, Dhiraj K.
Volume :
2
fYear :
1994
fDate :
15-19 Aug. 1994
Firstpage :
134
Lastpage :
142
Abstract :
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.
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing, 1994. ICPP 1994 Volume 2. International Conference on
Conference_Location :
North Carolina, USA
Print_ISBN :
0-8493-2493-9
Type :
conf
DOI :
10.1109/ICPP.1994.189
Filename :
5727775
Link To Document :
بازگشت