Constructing Parallel Paths Between Two Subcubes

Authors:
Guan-Ing Chen;Ten-Hwang Lai
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 5
Cited 5

A microprocessor-based hypercube supercomputer

IEEE Micro
Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
The iPSC/2 direct-connect communications technology

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
Subcube Allocation and Task Migration in Hypercube Multiprocessors

IEEE Transactions on Computers

A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels

IEEE Transactions on Parallel and Distributed Systems
On-Line Task Migration in Hypercubes Through Double Disjoint Paths

IEEE Transactions on Computers - Special issue on mobile computing
Fast Compaction in Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Achieving Fault-Tolerant Multicast in Injured Wormhole-Routed Tori and Meshes Based on Euler Path Construction

IEEE Transactions on Computers
Task migration in all-port wormhole-routed 2D mesh multicomputers

Information Sciences: an International Journal

Quantified Score

Hi-index	14.98

Visualization

Abstract

The authors consider a hypercube system that runs more than one job at a time, with each job allocated a subcube. They discuss the problem of migrating (relocating) a job from one subcube to another, assuming a circuit-switching hypercube network. An algorithm is presented for constructing parallel circuits between two subcubes so that the tasks of a job can be migrated simultaneously. It is shown that no matter how fragmented the hypercube is, one can always construct parallel paths between two given subcubes. Furthermore, one can always minimize the maximum length of the constructed circuits. A solution that minimizes the maximum length of the circuits will also minimize the total length. The circuits are mutually edge-disjoint and do not use any edge that has been used by other jobs. The time complexity of the algorithm is O(n/sup 2/m), where n is the dimension of the hypercube system and m is the number of jobs already in the system.