Communications of the ACM - Special section on computer architecture
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Communications of the ACM - Special issue on parallelism
Statistical Properties of the Buddy System
Journal of the ACM (JACM)
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
Communications of the ACM
Communications of the ACM
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A graph-oriented mapping strategy for a hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Message routing in an injured hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Hypercube management in the presence of node failures
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
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
Task migration in hypercube multiprocessors
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
A new approach to processor allocation and task migration in an N-cube multiprocessor
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Subcube Allocation and Task Migration in Hypercube Multiprocessors
IEEE Transactions on Computers
On subcube dependability in a hypercube
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Routing and processor allocation on a Hypercycle-based multiprocessor
ICS '91 Proceedings of the 5th international conference on Supercomputing
Subcube Allocation in Hypercube Computers
IEEE Transactions on Computers
A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers
IEEE Transactions on Computers
Constructing Parallel Paths Between Two Subcubes
IEEE Transactions on Computers
Processor allocation for a class of hypercube-like supercomputers
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Processor allocation policies for message-passing parallel computers
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Task Allocation in the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts
IEEE Transactions on Parallel and Distributed Systems
Processor Allocation in Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Allocation and Mapping Based Reliability Analysis of Multistage Interconnection Networks
IEEE Transactions on Computers
Augmented Binary Hypercube: A New Architecture for Processor Management
IEEE Transactions on Computers
On trading task reallocation for thread management in partitionable multiprocessors
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes
IEEE Transactions on Computers
Dynamic processor allocation in hypercube computers
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Cycle embedding in faulty hierarchical cubic networks
Proceedings of the 2002 ACM symposium on Applied computing
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
IEEE Transactions on Computers
A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers
IEEE Transactions on Computers
Contention-Free 2D-Mesh Cluster Allocation in Hypercubes
IEEE Transactions on Computers
Subcube Fault Tolerance in Hypercube Multiprocessors
IEEE Transactions on Computers
A Distributed Management Scheme for Partitionable Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
A Unified Task-Based Dependability Model for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
On Job Scheduling on a Hypercube
IEEE Transactions on Parallel and Distributed Systems
A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Job Scheduling is More Important than Processor Allocation for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Distributed Subcube Management Scheme for Hypercube Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On Embedding Various Networks into the Hypercube Using Matrix Transformations
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
An Efficient Processor Allocation Algorithm Using Two-dimensional Packing
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
The multicast address allocation problem: theory and practice
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on The global Internet
Path bipancyclicity of hypercubes
Information Processing Letters
A comparative study of job allocation and migration in the pancake network
Information Sciences: an International Journal
Changing representations during search: A comparative study of delta coding
Evolutionary Computation
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Information Processing Letters
Node-disjoint paths in hierarchical hypercube networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Embedding of cycles in the faulty hypercube
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Hi-index | 15.02 |
The processor allocation problem in an n-dimensional hypercube (or an n-cube) multiprocessor is similar to the conventional memory allocation problem. The main objective in both problems is to maximize the utilization of available resources as well as minimize the inherent system fragmentation. A processor allocation strategy using the buddy system, called the buddy strategy, is discussed first and then a new allocation strategy using a Gray code (GC), called the GC strategy, is proposed. When processor relinquishment is not considered (i.e., static allocation), both of these strategies are proved to be optimal in the sense that each incoming request sequence is always assigned to a minimal subcube. It is also shown that the GC strategy outperforms the buddy strategy in detecting the availability of subcubes. Our results are extended further to implement an allocation strategy using more than one GC and derive the relationship between the GC's used and the corresponding ability of detecting the availability of various subcubes. The minimal number of GC's required for complete subcube recognition in a Qn is proved to be less than or equal to C[n/2]n. Several processor allocation strategies in a Q5 are implemented on the NCUBE/six multiprocessor at the University of Michigan, and their performance is experimentally measured.