𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal and near-optimal broadcast in random graphs

✍ Scribed by Edward R. Scheinerman; John C. Wierman

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
537 KB
Volume
25
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal and Near-Optimal Algorithms fork
Optimal and Near-Optimal Algorithms fork-Item Broadcast
✍ Eunice E. Santos πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 330 KB

Since many distributed-memory machines rely only on point-to-point communication between processors, various broadcast operations must be created using this type of primitive. In this paper we consider the fundamental problem of broadcasting k-items from one processor to all the remaining processors

Broadcasting in random graphs
Broadcasting in random graphs
✍ Alan Frieze; Michael Molloy πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 163 KB
Optimal parallel processing of random ta
Optimal parallel processing of random task graphs
✍ Zhen Liu; Rhonda Righter πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 180 KB

We consider scheduling of tasks of parallel programs on multiprocessor systems where tasks have precedence relations and synchronization points. The task graph structures are random variables in the sense that successors to a task do not become known until the task is executed. Thus, as is often the

Optimal hierarchical structure of broadc
Optimal hierarchical structure of broadcast network
✍ Takumi Miyoshi; Yoshiaki Tanaka πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 151 KB

With the realization of broadband integrated service digital networks (B-ISDN), broadcast services will occupy a large part of the network traffic. In these services, the same information is distributed to many subscribers through the point-to-multipoint connection paths. This connection form is qui

Optimal Broadcasting in Faulty Trees
Optimal Broadcasting in Faulty Trees
✍ Petrişor Panaite; Andrzej Pelc πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 291 KB

We consider broadcasting a message from one node of a tree to all other nodes. In the presence of up to k link failures the tree becomes disconnected, and only nodes in the connected component C containing the source can be informed. The maximum ratio between the time used by a broadcasting scheme B