DocumentCode :
3348730
Title :
On the distributed subcube-allocation strategies in the hypercube multiprocessor systems
Author :
Liu, Jyh-Charn ; Chen, Yilong
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
fYear :
1992
fDate :
1-4 Dec 1992
Firstpage :
360
Lastpage :
364
Abstract :
The authors propose a novel system framework for the design of distributed job-scheduling and subcube-allocation strategies in hypercube multiprocessor/multicomputer systems. A generalized-lattice ordering scheme is proposed for processors. An elegant system information structure, the subcube identification table (SIT), is proposed for efficient distribution, retrieval, and update of free-subcube information. Locations of free subcubes can be determined by any node through direct lookup of its SIT. A novel interprocessor communication mechanism called the sync-broadcast is presented for SIT update/construction, and for resolving contention between subcube-requests for consistent allocation/deallocation of subcubes. Different job scheduling schemes can be easily implemented based on the proposed scheme
Keywords :
distributed processing; hypercube networks; multiprocessing systems; scheduling; direct lookup; distributed subcube-allocation strategies; generalized-lattice ordering scheme; hypercube multiprocessor systems; interprocessor communication mechanism; job scheduling; subcube identification table; sync-broadcast; system information structure; Application software; Computational modeling; Computer architecture; Computer science; Concurrent computing; Hypercubes; Information retrieval; Multiprocessing systems; Processor scheduling; System performance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-3200-3
Type :
conf
DOI :
10.1109/SPDP.1992.242723
Filename :
242723
Link To Document :
بازگشت