A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems

Abstract

Abstract-In real-time systems, utilization-based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The test is extremely simple, since it only needs to compare the utilization of the tasks with a predetermined bound. As such, utilization-based schedulability tests are suitable for online use. The challenge is how to derive a reasonable utilization bound for a given system. Most existing results are obtained on a case-by-case basis because of their analytical complexity. In this paper, we develop a flexible and unified representation framework of real-time systems (i.e., tasks and schedulers) based on network calculus techniques. Our representation framework, together with the proposed bound derivation method, leads to a general bound result, which is applicable to a large family of real-time systems.

Webit&NEU: An Embedded Device for the Internet of Things

“…As one of the important advantages for AVR assembly language is that it can easily and flexibly operate a certain storage location in memory, even its certain bit of the storage location, so system can handle task, message, interruption, timing, and so on effectively. So the Webit&NEU OS system can well be used to effectively manage data collection, wireless communication in the IoT [9,10], and it has successfully been developed by our China Liaoning Province Embedded Technique Key Laboratory [11].…”

“…So the Webit&NEU OS system can well be used to effectively manage data collection, wireless communication in the IoT [9, 10], and it has successfully been developed by our China Liaoning Province Embedded Technique Key Laboratory [11].…”

Delay Bound: Fractal Traffic Passes through Network Servers

“…Mathematically, ( ) has the same properties of ( ) as described in Remarks 8-10. Thus, a function ( ) ≥ ( ) may be a candidate of service curve (Yin and Poo [244], Pyun et al [245], Khanjari et al [246], Chu et al [247], Fulton and Li [248], Li and Hwang [249], Lau and Li [250], Li and Pruneski [251], Jamin et al [252], Wu et al [253], Chen et al [254], Agrawal et al [255], Feng et al [256], Raha et al [257], and Zhao and Chen [258]). Skills behind the idea of service curves appear simple, but it is significant in the development of linearizing nonlinear systems in general (Houssin et al [259], Okumura et al [260], and Shinzawa [261]) and queuing theory in particular [124].…”

Timing analysis of process graphs with finite communication buffers

“…RTC allows for the modeling of several task activation patterns, such as sporadic events (with a minimum and maximum inter-arrival time), periodic models with jitter, and transactions in which tasks (messages) are activated by the completion of their predecessors or new message arrivals. RTC can also be used to analyze the system utilization [17] and the timing behavior of tasks with dependencies, including systems with feedback controls [4] and loops [13].…”