✦ LIBER ✦

Routing Properties of a Recursive Interconnection Network

✍ Scribed by Rocky K.C. Chang; Hong Y. Wang

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 178 KB
Volume: 61
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.2001.1729

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 800 of the routes obtained from this simple algorithm are shortest paths, and this percentage increases further with the network size. Subsequently, we obtain the network diameter and average internodal distance, taking into account the communication locality that is exhibited in many parallel computations. The presence of the communication locality significantly reduces the average internodal distance.

📜 SIMILAR VOLUMES

Fast permutation routing in a class of i

Fast permutation routing in a class of interconnection networks

✍ Ehab S. Elmallah; Chin-Hung Lam 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

Topological properties of incomplete WK-

Topological properties of incomplete WK-recursive networks

✍ Su, Ming-Yang; Chen, Gen-Huey; Duh, Dyi-Rong 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 599 KB

Recently, WK-recursive networks have received much attention due to their many favorable properties. However, they suffered from a rigorous restriction on their sizes. Incomplete WK-recursive networks were proposed to relieve this restriction. In this paper, the topological properties of incomplete

Handbook of Applied Algorithms || Resili

Handbook of Applied Algorithms || Resilient Recursive Routing in Communication Networks

✍ Nayak, Amiya; Stojmenovi, Ivan 📂 Article 📅 2008 🏛 John Wiley & Sons, Inc. 🌐 English ⚖ 333 KB 👁 1 views

discover The Benefits Of Applying Algorithms To Solve Scientific, Engineering, And Practical Problems Providing A Combination Of Theory, Algorithms, And Simulations, Handbook Of Applied Algorithms Presents An All-encompassing Treatment Of Applying Algorithms And Discrete Mathematics To Practi

Dual of a Complete Graph as an Interconn

Dual of a Complete Graph as an Interconnection Network

✍ S.Q. Zheng; Jie Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 284 KB

A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optic

Prediction of Polymer Properties from th

Prediction of Polymer Properties from their Structure by Recursive Neural Networks

✍ Celia Duce; Alessio Micheli; Antonina Starita; Maria Rosaria Tiné; Roberto Solar 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

## Abstract **Summary:** We propose a new approach for predicting polymer properties from structured molecular representations based on recursive neural networks. To this aim, a structured representation is designed for the modeling of polymer structures. This representation can also account for av

Transfinite Recursion in a Theory of Pro

Transfinite Recursion in a Theory of Properties

✍ Stephen Pollard 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB

As SCOTT has shown, the Replacement. scheme of Z F derives a large part, of its strength from the Extensionality axiom. For in the absence of the latter, the supply of demonstrably functional formula matrices is relatively ineagei..l) I n this situation, u-e can restore some of Replacemmt's vigor by