학술논문

Revolving hierarchy in a hypercube distributed system
Document Type
Conference
Source
1993 IEEE International Symposium on Circuits and Systems (ISCAS) Circuits and systems Circuits and Systems (ISCAS), 1993 IEEE International Symposium on. :2537-2540 vol.4 May, 1993
Subject
Components, Circuits, Devices and Systems
Communication, Networking and Broadcast Technologies
Engineered Materials, Dielectrics and Plasmas
Hypercubes
Computer science
Concurrent computing
Distributed computing
Tree graphs
Protocols
System recovery
Relays
High performance computing
Tree data structures
Language
Abstract
The centralized computation of a global state in a distributed feedback system creates a performance bottleneck. To overcome this problem for a hypercube distributed system, the authors first develop the concept of the nC-Tree and define a revolving permutation on the nodes of the nC-Tree. They define a mapping of hypercube distributed system on a sequence of 2C-Trees with a logical hiercarhical structure. The logical hierarchical structure in conjunction with the revolving permutation defines the revolving hierarchy of the hypercube system. The repeated centralized computation of a global state is performed with uniform loading thereby removing this performance bottleneck.ETX