✦ LIBER ✦

Optimal Communication Algorithms in Distributed Loop Networks

✍ Scribed by R.K. Das; B.P. Sinha

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 500 KB
Volume: 30
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1995.1128

No coin nor oath required. For personal study only.

✦ Synopsis

Time optimal algorithms for multiple node broadcast and single node scatter in distributed loop networks have been proposed in this paper. These algorithms involve the minimum number of packet transmissions to effect both multiple node broadcast and single node scatter. O 1995 Academic Press, Inc.

📜 SIMILAR VOLUMES

Handbook of Applied Algorithms || Secure

Handbook of Applied Algorithms || Secure Communication in Distributed Sensor Networks (DSN)

✍ Nayak, Amiya; Stojmenovi, Ivan 📂 Article 📅 2008 🏛 John Wiley & Sons, Inc. 🌐 English ⚖ 273 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

Optimal Communication Algorithms for Het

Optimal Communication Algorithms for Heterogeneous Computing over ATM Networks

✍ Xiaodong Wang; Vwani P. Roychowdhury 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We present efficient algorithms for designing optimal collective communication primitives for cluster-based heterogeneous computing across Asynchronous Transfer Mode (ATM) networks. The virtual path (VP) concept is known to be a powerful transport mechanism for ATM networks. In many parallel process

Optimal Distributed Algorithms in Unlabe

Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings

✍ Bernard Mans 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We study the message complexity of distributed algorithms in tori and chordal Rings when the communication links are unlabeled, which implies that the processors do not have "sense of direction." We introduce the paradigm of handrail which allows messages to travel with a consistent direction. We gi

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

A fuzzy-tuned genetic algorithm for opti

A fuzzy-tuned genetic algorithm for optimal reconfigurations of radial distribution network

✍ N. C. Sahoo; R. Ranjan; K. Prasad; A. Chaturvedi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

Optimal routings in communication networ

Optimal routings in communication networks with linearly bounded forwarding index

✍ Manoussakis, Yannis; Tuza, Zsolt 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB 👁 1 views

In a given graph with n vertices, a routing is defined as a set of n(n -1) routes, one route connecting each ordered pair of vertices. The load of a vertex is the number of routes going through it. The forwarding index of the graph is the minimum of the largest load taken over all routings. We const