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
β¦ LIBER β¦
On scheduling multi-processor systems with algebraic objectives
β Scribed by K. Scholz
- Publisher
- Springer Vienna
- Year
- 1978
- Tongue
- English
- Weight
- 750 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On-line scheduling of multi-core process
β
Deshi Ye; Guochuan Zhang
π
Article
π
2010
π
Elsevier Science
π
English
β 580 KB
Batch Arrival Processor-Sharing with App
β
K. Avrachenkov; U. Ayesta; P. Brown
π
Article
π
2005
π
Springer US
π
English
β 277 KB
Multi-objective scheduling with fuzzy du
β
Tadahiko Murata; Mitsuo Gen; Hisao Ishibuchi
π
Article
π
1998
π
Elsevier Science
π
English
β 268 KB
In this paper, we examine the characteristic features of multi-objective scheduling problems formulated with the concept of fuzzy due-date. By computer simulations, we show that various scheduling criteria can be expressed by modifying the shape of membership functions of fuzzy due-dates. We also sh
A simple linear time approximation algor
β
Jingui Huang; Jianer Chen; Songqiao Chen; Jianxin Wang
π
Article
π
2006
π
Springer US
π
English
β 602 KB
Scheduling independent two processor tas
β
J. BΕazΜewicz; M. Drozdowski; G. Schmidt; D. De Werra
π
Article
π
1990
π
Elsevier Science
π
English
β 606 KB
Scheduling UET task systems with concurr
β
Peter Brucker; Sigrid Knust; Duncan Roper; Yakov Zinder
π
Article
π
2000
π
Springer
π
English
β 174 KB