http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
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 taskset; and exact schedulability checks, which use detailed information. In this work, we present a technique for determining period-specific utilization bounds, which use task period information, generally available at design time, but not task computation time information, which is hard to determine accurately. The technique we use for determining the bound is an innovative approach which makes use of linear programming."
Dong-Won Park, Swaminathan Natarajan, Arkady Kanvesky.
"Laboratory for Algorithms Design, LAD 92-07."
Technical report (Texas A & M University. Computer Science Department) ; 92-036