𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orderedh-Level Graphs on the BSP Model

✍ Scribed by Alexandros V. Gerbessiotis; Constantinos J. Siniolakis

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
138 KB
Volume
49
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Villain model on thin graphs
The Villain model on thin graphs
✍ C.F. Baillie; N. Dorey; W. Janke; D.A. Johnston πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 650 KB
On scheduling send-graphs and receive-gr
On scheduling send-graphs and receive-graphs under the LogP-model
✍ W. Zimmermann; W. LΓΆwe; D. Trystram πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 154 KB

In this paper we consider scheduling of send-graphs (i.e., a root sends a message to all its leaves) and receive-graphs (i.e., a root receives messages from all its leaves) under the LogP-model. It turns out that even for these simple task-graphs it is NP-complete to decide whether there is a schedu