Graph theoretic characterization and reliability of the generalized Boolean n-cube network

Tsung Chuan Huang; Jhing Fa Wang; Chu Sing Yang; Jau Yien Lee

doi:10.1016/0167-8191(89)90095-1

Graph theoretic characterization and reliability of the generalized Boolean n-cube network

Tsung Chuan Huang
, Jhing Fa Wang
, Chu Sing Yang
, Jau Yien Lee

Institute of Communications Engineering

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

In this paper, a general class of Boolean n-cube structures is investigated. The interconnection is based on a mixed radix number system which results in a variety of generalized Boolean n-cube structures for a given number of processors N = x·2^y, where x and y are positive integers. A number of interesting properties of the network are revealed. By a constructive method, the node connectivity of this network is found. Finally, we show that the graph is super-λ and is an optimal reliable structure for interconnection networks.

Original language	English
Pages (from-to)	375-385
Number of pages	11
Journal	Parallel Computing
Volume	12
Issue number	3
DOIs	https://doi.org/10.1016/0167-8191(89)90095-1
Publication status	Published - 1989 Dec

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Computer Graphics and Computer-Aided Design
Artificial Intelligence

Access to Document

10.1016/0167-8191(89)90095-1

Cite this

@article{97c01155ec7046348e59156557ce206c,

title = "Graph theoretic characterization and reliability of the generalized Boolean n-cube network",

abstract = "In this paper, a general class of Boolean n-cube structures is investigated. The interconnection is based on a mixed radix number system which results in a variety of generalized Boolean n-cube structures for a given number of processors N = x·2y, where x and y are positive integers. A number of interesting properties of the network are revealed. By a constructive method, the node connectivity of this network is found. Finally, we show that the graph is super-λ and is an optimal reliable structure for interconnection networks.",

author = "Huang, \{Tsung Chuan\} and Wang, \{Jhing Fa\} and Yang, \{Chu Sing\} and Lee, \{Jau Yien\}",

year = "1989",

month = dec,

doi = "10.1016/0167-8191(89)90095-1",

language = "English",

volume = "12",

pages = "375--385",

journal = "Parallel Computing",

issn = "0167-8191",

publisher = "Elsevier BV",

number = "3",

}

TY - JOUR

T1 - Graph theoretic characterization and reliability of the generalized Boolean n-cube network

AU - Huang, Tsung Chuan

AU - Wang, Jhing Fa

AU - Yang, Chu Sing

AU - Lee, Jau Yien

PY - 1989/12

Y1 - 1989/12

N2 - In this paper, a general class of Boolean n-cube structures is investigated. The interconnection is based on a mixed radix number system which results in a variety of generalized Boolean n-cube structures for a given number of processors N = x·2y, where x and y are positive integers. A number of interesting properties of the network are revealed. By a constructive method, the node connectivity of this network is found. Finally, we show that the graph is super-λ and is an optimal reliable structure for interconnection networks.

AB - In this paper, a general class of Boolean n-cube structures is investigated. The interconnection is based on a mixed radix number system which results in a variety of generalized Boolean n-cube structures for a given number of processors N = x·2y, where x and y are positive integers. A number of interesting properties of the network are revealed. By a constructive method, the node connectivity of this network is found. Finally, we show that the graph is super-λ and is an optimal reliable structure for interconnection networks.

UR - https://www.scopus.com/pages/publications/0024945485

UR - https://www.scopus.com/pages/publications/0024945485#tab=citedBy

U2 - 10.1016/0167-8191(89)90095-1

DO - 10.1016/0167-8191(89)90095-1

M3 - Article

AN - SCOPUS:0024945485

SN - 0167-8191

VL - 12

SP - 375

EP - 385

JO - Parallel Computing

JF - Parallel Computing

IS - 3

ER -

Graph theoretic characterization and reliability of the generalized Boolean n-cube network

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this