✦ LIBER ✦

Strategies for interconnection networks: Some methods from graph theory

✍ Scribed by J.-C. Bermond; C. Delorme; J.-J. Quisquater

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 909 KB
Volume: 3
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(86)90008-0

No coin nor oath required. For personal study only.

✦ Synopsis

Interconnection networks require dense graphs in the sense that many nodes with relatively few links may be connected with relatively short paths. Some recent constructions of such dense graphs with a given maximal degree A and diameter D (known as (A, D) graphs) are reviewed here. The paper also contains an updated table of the best known (A, D) graphs.

📜 SIMILAR VOLUMES

A dual-hamiltonian-path-based multicasti

A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks

✍ Nen-Chung Wang; Chih-Ping Chu; Tzung-Shi Chen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercu