Guaranteeing synchronous message deadlines with the timed token protocol

Agrawal, G.; Chen, B.; Zhao, Wei; Davari, Sadegh

doi:10.1109/icdcs.1992.235007

Cited by 78 publications

(40 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in [30], [31], we showed that all the bound results of static priority scheduling algorithms obtained in [2], [3], [4], [5], [6], [7], [8] can be unified into our framework and expressed by one parameterized formula. Similarly, in [32], [33], [34], we showed that all existing bound results of weighted round robin schedulers obtained in [9], [10], [11] can be derived using our proposed framework.…”

Section: Introductionmentioning

confidence: 64%

“…The authors proved that this method yields more accurate test results than the utilization-based schedulability test made on the original task set, at a cost of higher computing complexity. Utilization bounds for the time token protocol (scheduler) in FDDI networks were derived in [9], [10], [11]. Utilization bounds for static priority schedulers in a network environment have been studied in [21].…”

Section: Related Workmentioning

confidence: 99%

“…Various utilization bounds have been derived in the literature, and some have been applied to the implementation of mission critical applications. The most notable results are for periodic tasks, including 69 percent (and extensions) for the Rate/Deadline Monotonic scheduler (RMS/DMS) [2], [3], [4], [5], [6], [7], [8]; 100 percent for Earliest Deadline First scheduler (EDF) [5]; 33 percent for the Timed Token Protocol (TTP) [9], [10], [11]; etc. Utilization bounds of RMS/DMS in multiprocessor systems have also been derived in [12], [13], [14], [15], [16], [17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Liu

Zhao

2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 64%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Liu

Zhao

2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…where Ut gives the overall number of unused tokens during a busy period in master k: , min (14) As expected, this equation embodies a mutual dependence, since R k appears in both sides of the equation. In fact, all the previous analysis underlay this mutual dependence, since in order to evaluate R k , Ut must be found, and vice-versa.…”

Section: Note That Ns Y +∑ I=1ns Yt/t I Ymentioning

confidence: 62%

“…By considering the actual token utilisation (14) we improve the results obtained by (6). Nonetheless, a priority inversion with the length:…”

Section: Note That Ns Y +∑ I=1ns Yt/t I Ymentioning

confidence: 77%

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

Tovar

Vasques²,

Burns³

Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99

View full text Add to dashboard Cite

show abstract

Proposal and evaluation of time critical communication protocol with two‐level data queues

Kusunoki

Nakakawaji

Katsuyama

et al. 1996

Systems & Computers in Japan

View full text Add to dashboard Cite

SUMMARYFor some distributed control applications, a highly reliable, high-speed time-critical communication network is required. Time-critical communication ensures completion of data transmission for an application, or that of transaction within a time specified by the application. A protocol has been presented for time critical communication that achieves highly effective traffic ratio of time critical data using two-level data queues. Estimates of effective traffic ratio are derived for the authors' protocol. Estimation parameters are input traffic load, ratio of time critical data in offered load, and time width for completion of data transmission.

show abstract

Guaranteeing synchronous message deadlines with the timed token protocol

Cited by 78 publications

References 38 publications

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

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

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

Proposal and evaluation of time critical communication protocol with two‐level data queues

Contact Info

Product

Resources

About