Schedulability criteria for fixed priority scheduling of real- time systems /

Abstract: "There are two major approaches to guaranteeing hard real-time deadlines for periodic tasks using scheduling algorithms based on fixed priorities: utilization bound checks, which check the total expected processor utilization, and do not require detailed information about the taskse...

Full description

Bibliographic Details

Main Author:	Park, Dong-Won
Other Authors:	Natarajan, Swaminathan, Kanevsky, Arkady, 1961-
Format:	Book
Language:	English
Published:	College Station, Tex. : Texas A & M University, Computer Science Dept., [1992]
Series:	Technical report (Texas A & M University. Computer Science Department) ; 92-036.
Subjects:	Real-time data processing.