Sporadic multiprocessor scheduling with few preemptions

被引：37
|
作者：
Andersson, Bjoern [1 ]
Bletsas, Konstantinos [1 ]
机构：
[1] IPP, ISEP, IPP HURRAY Res Grp, P-4200072 Oporto, Portugal
来源：
ECRTS 2008: PROCEEDINGS OF THE 20TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS | 2008年
关键词：
D O I：
10.1109/ECRTS.2008.9
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).
引用
收藏
页码：243 / 252
页数：10
相关论文
共 50 条
  • [1] Multiprocessor scheduling with few preemptions
    Andersson, Bjorn
    Tovar, Eduardo
    [J]. 12TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2006, : 322 - +
  • [2] On the geometry, preemptions and complexity of multiprocessor and shop scheduling
    Shchepin, Evgeny V.
    Vakhania, Nodari
    [J]. ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) : 183 - 213
  • [3] Multiprocessor Fixed Priority Scheduling with Limited Preemptions
    Thekkilakattil, Abhilash
    Davis, Robert I.
    Dobrin, Radu
    Punnekkat, Sasikumar
    Bertogna, Marko
    [J]. PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON REAL-TIME AND NETWORKS SYSTEMS (RTNS) 2015, 2015, : 13 - 22
  • [4] On the geometry, preemptions and complexity of multiprocessor and shop scheduling
    Evgeny V. Shchepin
    Nodari Vakhania
    [J]. Annals of Operations Research, 2008, 159 : 183 - 213
  • [5] The maximum gain of increasing the number of preemptions in multiprocessor scheduling
    Klonowska, Kamilla
    Lundberg, Lars
    Lennerstad, Hakan
    [J]. ACTA INFORMATICA, 2009, 46 (04) : 285 - 295
  • [6] The maximum gain of increasing the number of preemptions in multiprocessor scheduling
    Kamilla Klonowska
    Lars Lundberg
    Håkan Lennerstad
    [J]. Acta Informatica, 2009, 46 : 285 - 295
  • [7] Sustainable multiprocessor scheduling of sporadic task systems
    Baker, Theodore P.
    Baruah, Sanjoy K.
    [J]. PROCEEDINGS OF THE 21ST EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, 2009, : 141 - +
  • [8] The partitioned multiprocessor scheduling of sporadic task systems*
    Baruah, S
    Fisher, N
    [J]. RTSS 2005: 26TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2005, : 321 - 329
  • [9] Reducing Preemptions and Migrations in Real-Time Multiprocessor Scheduling Algorithms by Releasing the Fairness
    Nelissen, Geoffrey
    Berten, Vandy
    Goossens, Joel
    Milojevic, Dragomir
    [J]. 2011 IEEE 17TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA 2011), VOL 1, 2011, : 15 - 24
  • [10] K_multiprocessor Group (KMG) Optimal scheduling algorithm for Reducing Preemptions and Migrations inRTS
    Reddy, Y. Sudarshan
    Basha, Syed S.
    [J]. PROCEEDINGS OF 2015 IEEE 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL (ISCO), 2015,
12345