SCHEDULING CUSTOMERS IN A NON-REMOVAL REAL-TIME SYSTEM WITH AN APPLICATION TO DISK SCHEDULING

被引：10

作者：

CHEN, SZ ^{[1
]}

TOWSLEY, D ^{[1
]}

机构：

[1] UNIV MASSACHUSETTS,DEPT COMP SCI,AMHERST,MA 01003

来源：

REAL-TIME SYSTEMS | 1994年 / 6卷 / 01期

关键词：

D O I：

10.1007/BF01245299

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 [计算机软件与理论];

摘要：

In this article, we consider the problem of scheduling customers in a real-time system in which all customers are required to be serviced. Such a non-removal system can be distinguished from a removal real-time system in which customers can be removed prior to completing service. We describe and evaluate a simple paradigm for mapping policies for removal systems to policies for non-removal systems. We show that several policies known to be optimal for removal systems map into policies which are also optimal for non-removal systems. The article concludes with an application of this paradigm to scheduling requests with real-time constraints on disk subsystems.

引用

页码：55 / 72

页数：18

共 22 条

[1]

ABBOTT RK, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P113, DOI 10.1109/REAL.1990.128736

[2]

[Anonymous], 1996, STOCHASTIC PROCESSES

[3]

SINGLE-SERVER QUEUES WITH IMPATIENT CUSTOMERS [J].