Monitoring network QoS in a dynamic real-time system

Chen, Hong; Tjaden, Brett; Welch, Lonnie R.; Bruggeman, Carl; Lu, Tong; Pfarr, B.

doi:10.1109/ipdps.2002.1016474

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a new task is created in a dynamic real-time system, an online admission control mechanisms that uses a schedulability test guarantees predictability if the new task is admitted. Examples of these kind of systems are those with quality-of-service (QoS) requirements, such as multimedia systems [1] [2], communication services [3] [4], and automated flight control [5]. Other examples are found on the scheduling of real-time traffic over networks [6] [7], or in open systems environments [8] [9].…”

Section: Introductionmentioning

confidence: 99%

Comprehensive Comparison of Schedulability Tests for Uniprocessor Rate-Monotonic Scheduling

Díaz-Ramírez¹,

Mejía-Álvarez²,

Leyva-del-Foyo³

2013

Journal of Applied Research and Technology

View full text Add to dashboard Cite

Schedulability conditions are used in real-time systems to verify the fulfillment of the temporal constraints of task sets. In this paper, a performance analysis is conducted for the best-known real-time schedulability conditions that can be used in online admission control on uni-processor systems executing under the Rate-Monotonic scheduling policy. Since Liu and Layland introduced the Rate-Monotonic scheduling algorithm, many research studies have been conducted on the schedulability analysis of real-time periodic task sets. However, in most cases, the performance of the proposed schedulability conditions were compared only against the Liu and Layland test and not against the remaining schedulability tests. The goal of this paper is to provide guidelines for system designers in order to decide which schedulability condition provides better performance under different task characteristics. Extensive simulation experiments were conducted to evaluate the inexact schedulability conditions and compare their performance and computational complexity.

show abstract