Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

被引:6
|
作者
Andersson, Bjoern [1 ]
Tovar, Eduardo [1 ]
机构
[1] Polytechn Inst Porto, IPP HURRAY Res Grp, Oporto P-4200072, Portugal
来源
13TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS | 2007年
关键词
D O I
10.1109/RTCSA.2007.31
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed S-p. Tasks can be preempted but they cannot migrate between processors. On each processor tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithin is given processors that are root 2/root 2-1 approximate to 3.41 timesfaster No such guarantees ore previously known for partitioned static-priority scheduling on uniform multiprocessors.
引用
收藏
页码:111 / +
页数:2
相关论文
共 50 条
  • [1] Static-priority scheduling on multiprocessors
    Andersson, B
    Baruah, S
    Jonsson, J
    22ND IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2001, : 193 - 202
  • [2] The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%
    Andersson, B
    Jonsson, J
    15TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2003, : 33 - 40
  • [3] Portioned static-priority scheduling on multiprocessors
    Kato, Shinpei
    Yamasaki, Nobuyuki
    2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8, 2008, : 1717 - 1728
  • [4] Static-priority periodic scheduling on multiprocessors
    Ramamurthy, S
    Moir, M
    21ST IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2000, : 69 - 78
  • [5] Static-priority scheduling of multiframe tasks
    Baruah, SK
    Chen, DJ
    Mok, A
    PROCEEDINGS OF THE 11TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, 1999, : 38 - 45
  • [6] Delay analysis for CBR traffic under static-priority scheduling
    Iida, K
    Takine, T
    Sunahara, H
    Oie, Y
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2001, 9 (02) : 177 - 185
  • [7] Static-priority scheduling of sporadic messages on a wireless channel
    Andersson, Bjorn
    Tovar, Eduardo
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2006, 3974 : 322 - +
  • [8] Semi-Partitioned Fixed-Priority Scheduling on Multiprocessors
    Kato, Shinpei
    Yamasaki, Nobuyuki
    15TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATION SYMPOSIUM: RTAS 2009, PROCEEDINGS, 2009, : 23 - 32
  • [9] The partitioned, static-priority scheduling of sporadic real-time tasks with constrained 14 deadlines on multiprocessor platforms"
    Fisher, Nathan
    Baruah, Sanjoy
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2006, 3974 : 291 - +
  • [10] Firmness Analysis of Real-Time Applications Under Static-Priority Preemptive Scheduling
    Behrouzian, Amir R. B.
    Goswami, D.
    Basten, T.
    Geilen, M.
    Ara, H. Alizadeh
    Hendriks, M.
    24TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS 2018), 2018, : 295 - 304