On the distributed subcube-allocation strategies in the hypercube multiprocessor systems

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