Dual priority assignment: A practical method for increasing processor utilisation

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 1993, Pages 48-53

  Burns, A ^a   Wellings, A J ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DEADLINE SCHEDULING; PRACTICAL METHOD; PRIORITY ASSIGNMENT; PRIORITY SCHEMES; RUNTIMES; STATIC PRIORITY;

COMPUTER NETWORKS; ELECTRICAL ENGINEERING;

REAL TIME SYSTEMS;

EID: 84884642160     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMWRT.1993.639052     Document Type: Conference Paper

References (4)

1. C.L. Liu and J.W. Layland, "Scheduling Algorithms for Multiprogramming iin a Hard Real-Time Environment", JACM 20(1), pp. 46-61 (1973).
2. J.P. Lehoczky, L. Sha and V. Ding, "The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior", Tech Report, Department of Statistics, Carnegie-Mellon (1987).
3. N. C. Audsley, A. Burns, M. F. Richardson and A. J. Wellings, "STRESS: A Simulator For Hard Real-Time System", RTRG/91/106, Real-Time Research Group, Department of Computer Science, University of York (October 1991).
4. M.G. Harbour, M.H. Klein and J.P. Lehoczky, Fixed Priority Scheduling of Periodic Tasks with varying Execution Priority, Software Engineering Institute, Carnegie-Mellon University, Pittsburgh, PA, USA (1991).