Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
On allocating subcubes in a hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
Communications of the ACM
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
| Hi-index | 0.00 |
The problem of allocation and release of subcubes from a hypercube with node failures is addressed. Two algorithms are presented, both based on the Buddy allocation scheme for memory management which is also used by the AXIS operating system of the NCUBE hypercube computer. The first algorithm is a simple variation of the Buddy algorithm which permits the efficient allocation of subcubes in the presence of a single faulty node. The second algorithm, which effectively subsumes the first, tries to reduce the fragmentation caused by multiple failed nodes. It uses a relabeling scheme to group the failed nodes so that large non-faulty subcubes can be detected using the Buddy allocation scheme. The relative performance of these algorithms is studied using simulation and the proposed algorithms are shown to have a consistently better performance. Issues relating to the detection of faulty nodes on the NCUBE computer and the consequences of the relabeling on message passing are also discussed.