We investigate the power of migration in real-time multi-processor scheduling with preemption. We show that every collection of jobs that can be completed by some schedule S on m processors can also be completed by a nonmigratory schedule S on 6m -5 processors. We can conclude from this result that,
โฆ LIBER โฆ
Multi-processor scheduling and expanders
โ Scribed by Nikolai N. Kuzjurin
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 404 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Eliminating Migration in Multi-processor
โ
Bala Kalyanasundaram; Kirk R Pruhs
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 186 KB
On-line scheduling of multi-core process
โ
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
Multi-vane expanders: Geometry and vane
โ
O. Badr; P.W. O'Callaghan; S.D. Probert
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 959 KB
Video signal processor scheduling
โ
E. A. de Kock; E. H. L. Aarts; A. J. E. Verstraten
๐
Article
๐
2001
๐
Springer US
๐
English
โ 108 KB
Probabilistic single processor schedulin
โ
Janelie J. Harms; Charles J. Colbourn
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 821 KB
Comms processor range expands
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 123 KB