✦ LIBER ✦

On complexity of subset interconnection designs

✍ Scribed by Ding -Zhu Du; Dean F. Kelley

Book ID: 105070052
Publisher: Springer US
Year: 1995
Tongue: English
Weight: 701 KB
Volume: 6
Category: Article
ISSN: 0925-5001
DOI: 10.1007/bf01096768

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximations for subset interconnectio

Approximations for subset interconnection designs

✍ Xiufeng Du; Weili Wu; Dean F. Kelley 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 543 KB

A special case for subset interconnectio

A special case for subset interconnection designs

✍ Du Ding-Zhu; Gao Biao; Wu Weili 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Given a set X and subsets Xl.. .X,,,, me consider the problem of finding a graph G with vertex set X and the minimum number of edges such that for i = 1.. ,m, the subgraph G, induced by X, is connected. WC show that in the special cast that every point in X appears in at most three X,'s, the problem

Two algorithms for the subset interconne

Two algorithms for the subset interconnection design problem

✍ Erich Prisner 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 516 KB

A fractal analysis of interconnection co

A fractal analysis of interconnection complexity

✍ Christie, P. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 777 KB

On the design of multi-wavelength copy i

On the design of multi-wavelength copy interconnects with reduced complexity

✍ Haitham S. Hamza 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 978 KB

Analysis of interconnection networks wit

Analysis of interconnection networks with different arbiter designs

✍ Laxmi N. Bhuyan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 995 KB

In performance evaluation of interconnection networks, it is usually assumed that in the event of conflicts a request is accepted with equal probability. This paper ilhrstrates that this arbitration policy discriminates against remote or less frequent requests because it rejects them most of the tim