Static-priority scheduling on multiprocessors

被引：123

作者：

Andersson, B ^{[1
]}

Baruah, S ^{[1
]}

Jonsson, J ^{[1
]}

机构：

[1] Chalmers, Dept Comp Engn, SE-41296 Gothenburg, Sweden

来源：

22ND IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/REAL.2001.990610

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A scheduling algorithm is proposed for static-priority scheduling of such systems; this algorithm is a Simple extension of the uniprocessor rate-monotonic scheduling algorithm. It is proven that this algorithm successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocessor platform. It is also shown that no static-priority multiprocessor scheduling algorithm (partitioned or global) can guarantee schedulability for a periodic task set with a utilization higher than one half the capacity of the multiprocessor platform.

引用

页码：193 / 202

页数：10

共 20 条

[1] Fixed-priority preemptive multiprocessor scheduling: To partition or not to partition [J].

Andersson, B ;

Jonsson, J .

SEVENTH INTERNATIONAL CONFERENCE ON REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2000, :337-346

[2]

ANDERSSON B, 2001, TR01016 UNCCS DEP CO

[3]

Andersson B., 2000, IEEE REAL TIM SYST S, P53

[4] ON THE COMPETITIVENESS OF ONLINE REAL-TIME TASK-SCHEDULING [J].

BARUAH, S ;

KOREN, G ;

MAO, D ;

MISHRA, B ;

RAGHUNATHAN, A ;

ROSIER, L ;

SHASHA, D ;

WANG, F .

REAL-TIME SYSTEMS, 1992, 4 (02) :125-144

[5]

BARUAH S, 1991, PROCEEDINGS - 32ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, P100, DOI 10.1109/EMWRT.1991.144089

[6]

BARUAH SK, 1994, REAL TIM SYST SYMP P, P228, DOI 10.1109/REAL.1994.342713

[7]

Baruah SK, 1996, ALGORITHMICA, V15, P600, DOI 10.1007/BF01940883

[8]

Davari S., 1986, Proceedings of the Real-Time Systems Symposium (Cat. No.86CH2351-5), P194

[9]

DAVARI S, 1985, P 19 HAW INT C SYST, P8

[10] REAL-TIME SCHEDULING PROBLEM [J].

DHALL, SK ;

LIU, CL .

OPERATIONS RESEARCH, 1978, 26 (01) :127-140

← 1 2 →