Title :
On processor allocation in hypercube multiprocessors
Author :
Huang, Chih-Hao ; Huang, Ting-Lu ; Juang, Jie-Yong
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA
Abstract :
The processor allocation problem in a hypercube system is to find a free subcube for a given request. The subcube recognition capability of existing allocation strategies, e.g. the buddy strategy and the Gray code strategy, is far below the theoretical upper bound due to their incomplete representation of the hypercube interconnection structure. A complete strategy that outperforms the existing ones in subcube recognition capability and average waiting time but incurs a higher overhead is proposed. Efficient implementation of the complete strategy is also studied
Keywords :
parallel processing; Gray code strategy; average waiting time; buddy strategy; hypercube multiprocessors; processor allocation; subcube recognition capability; Application software; Computer science; Hamming distance; Hypercubes; Multiprocessing systems; Operating systems; Reflective binary codes; Telecommunication computing; Topology; Upper bound;
Conference_Titel :
Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-1964-3
DOI :
10.1109/CMPSAC.1989.65049
