Title

Revolving Hierarchy In A Hypercube Distributed System

Abstract

The centralized computation of a global state in a distributed system creates a performance bottleneck. In order to overcome this problem for a hypercube distributed system, we first develop the concept of nC-Tree and define a revolving permutation on the nodes of the nC-Tree. We define a mapping of hypercube distributed system on a sequence of 2C-Tree with a logical hierarchical 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.

Publication Date

1-1-1993

Publication Title

Proceedings - IEEE International Symposium on Circuits and Systems

Volume

4

Number of Pages

2537-2540

Document Type

Article; Proceedings Paper

Identifier

scopus

Personal Identifier

scopus

Socpus ID

0027149341 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0027149341

This document is currently not available here.

Share

COinS