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