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

Nearly on-line scheduling of multiprocessor systems with memories

โœ Scribed by Ten-Hwang Lai; Sartaj Sahni

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
563 KB
Volume
4
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Adaptive Scheduling of Computations and
Adaptive Scheduling of Computations and Communications on Distributed-Memory Systems
โœ Mayez Al-Mouhamed; Homam Najjari ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 303 KB

Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priority-based scheduling algorithms is computation dependent. Scheduling based on the concept of earliest-startable-task produ

On-line scheduling of multi-core process
On-line scheduling of multi-core processor tasks with virtualization
โœ Deshi Ye; Guochuan Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 580 KB

We consider an on-line list scheduling problem of multi-core processor tasks with virtualization to minimize makespan. The competitive ratio of an on-line algorithm is shown for every specific m, where m is the number of processors. Better on-line algorithms are presented for a small number of proce