Going Beyond Deadline-Driven Low-level Scheduling in Distributed Real-Time Computing Systems

In real-time computing systems, timing-requirement specifications coming from the application designer are the obvious primary driver for resource allocation. Deadline-driven scheduling of computation-segments has been studied as an advanced mode of scheduling devised to meet the timing requirement specifications. However, it does not reflect additional concerns of the application designer, the damaging impacts of various timing violations on the application. The notion of risk-incursion function (RIF) as a framework for specification of such damaging impacts has been established by the first co-author. In this paper, a concrete implementation approach of the RIFdriven resource allocation scheme is discussed first. Then two RIF-based scheduling algorithms are discussed. The results of the experiment conducted to compare the performance of RIF-based scheduling algorithms against that of deadline-driven scheduling algorithms are also provided.