๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Multiround algorithms for scheduling divisible loads

โœ Scribed by Yang, Y.; van der Raadt, K.; Casanova, H.

Book ID
118231394
Publisher
IEEE
Year
2005
Tongue
English
Weight
754 KB
Volume
16
Category
Article
ISSN
1045-9219

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Scheduling Strategies for Proc
Efficient Scheduling Strategies for Processing Multiple Divisible Loads on Bus Networks
โœ Bharadwaj Veeravalli; Gerassimos Barlas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 551 KB

The problem of scheduling multiple divisible loads on bus networks is addressed in this paper. The objective is to minimize the total processing time of all the divisible loads submitted to the system for processing. A heterogeneous system of processors in the network is considered, and strategies t

Scheduling divisible loads in a three-di
Scheduling divisible loads in a three-dimensional mesh of processors
โœ Maciej Drozdowski; Wล‚odzimierz Gล‚azek ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 411 KB

We study distributed processing of a divisible load in a three-dimensional mesh of communicating processors. The objective is to ยฎnd distribution of the load among processors which guarantees minimal processing time. We describe a family of load distribution algorithms and obtain closed-form formula