FIXED PRIORITY SCHEDULING WITH LIMITED PRIORITY LEVELS

被引：16

作者：

KATCHER, DI

SATHAYE, SS

STROSNIDER, JK

机构：

[1] Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1995年 / 44卷 / 09期

关键词：

REAL-TIME SYSTEMS; FIXED PRIORITY SCHEDULING; SCHEDULABILITY; DEGREE OF SCHEDULABLE SATURATION;

D O I：

10.1109/12.464392

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited priority levels. we introduce the degree of schedulable saturation (S-max) as an objective function. A multimedia task set is used to demonstrate how S-max can be used to optimize the grouping of tasks to priority levels.

引用

页码：1140 / 1144

页数：5

共 13 条

[1]

LEHOCZKY J, 1986, ACM PERFORMANCE EVAL, V14

[2]

LEHOCZKY JP, 1989, IEEE REAL TIME SYSTE

[3]

LIU C, 1973, J ACM, V30, P46

[4]

SATHAYE S, 1992, CMUCDS927 TECHN REP

[5] PRIORITY INHERITANCE PROTOCOLS - AN APPROACH TO REAL-TIME SYNCHRONIZATION [J].

SHA, L ;

RAJKUMAR, R ;

LEHOCZKY, JP .

IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (09) :1175-1185

[6]

SHA L, 1991, IEEE MICRO JUN

[7]

SHA L, 1992, 13TH IEEE REAL TIM S, P188

[8]

Sprunt B, 1990, THESIS CARNEGIE MELL

[9] THE DEFERRABLE SERVER ALGORITHM FOR ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS [J].

STROSNIDER, JK ;

LEHOCZKY, JP ;

SHA, L .

IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (01) :73-91

[10]

SZABO B, 1991, USENIX SUMMER TECHNI

← 1 2 →