A new approach to processor allocation and task migration in an N-cube multiprocessor

Authors:
J. E. Jang;S. W. Choi;W. K. Cho
Affiliations:
Oregon Advanced Computing Institute(OACIS)and Department of Computer Science, Oregon State University, Corvallis, OR;Oregon Advanced Computing Institute(OACIS)and Department of Computer Science, Oregon State University, Corvallis, OR;Oregon Advanced Computing Institute(OACIS)and Department of Computer Science, Oregon State University, Corvallis, OR
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 7
Cited 1

Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Incomplete Hypercubes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers

IEEE Transactions on Computers
Task migration in hypercube multiprocessors

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series

An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new strategy to recognize the maximum subcube in an n-cube multiprocessor. This subcube recognition algorithm can be done in both serial and parallel and analyzed. This strategy will enhance the performance drastically so that our algorithm will outperform the buddy system by a factor nCk, the gray strategy by nCk/2 and Al-Dhelaan [8] by nCk/(k(n-k)+1) in cube recognition. We present a very efficient processor allocation strategy which makes larger contiguous spaces for the new coming job than buddy, gray strategy and Al-Dhelaan [8] do. Furthermore, this new strategy is suitable for static as well as dynamic processors allocation and it results in a less fragmentation and higher fault tolerance. Also we describe an efficient procedure for task migration under the new strategy: 1) goal configuration under the new strategy 2) node-mapping between source and destination node 3) the shortest deadlock-free routing algorithm.