✦ LIBER ✦

Distributing and scheduling divisible task on parallel communicating processors

✍ Scribed by Guodong Li; Defu Zhang

Publisher: Springer
Year: 2002
Tongue: English
Weight: 742 KB
Volume: 17
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02960769

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling tasks with communication dela

Scheduling tasks with communication delays on parallel processors

✍ Christian Chenier; Jorge Urrutia; Nejib Zaguia 📂 Article 📅 1995 🏛 Springer Netherlands 🌐 English ⚖ 518 KB

Scheduling of stochastic tasks on two pa

Scheduling of stochastic tasks on two parallel processors

✍ Michael Pinedo; Gideon Weiss 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 457 KB 👁 1 views

Scheduling UET task systems with concurr

Scheduling UET task systems with concurrency on two parallel identical processors

✍ Peter Brucker; Sigrid Knust; Duncan Roper; Yakov Zinder 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 174 KB

A note on scheduling multiprocessor task

A note on scheduling multiprocessor tasks with precedence constraints on parallel processors

✍ A.K. Amoura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Scheduling tasks and communications on a

Scheduling tasks and communications on a virtual distributed system

✍ J.-Y. Colin; P. Colin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 419 KB

An Optimal Algorithm for Scheduling Inte

An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors

✍ H.H. Ali; H. Elrewini 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 506 KB

The problem of scheduling task graphs on multiprocessor systems have received considerable attention in recent years. This problem is known to be NP-hard in its general form as well as many restricted cases. Few polynomial algorithms have been developed for solving special cases of the scheduling pr