A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Cyclic Data Flows in Computers and Embedded Systems
[chapter]
2019
Studies in Systems, Decision and Control
core with λ = 6 Fig. 1.8: An optimal periodic schedule 1.3.2 Periodic data transfers for a real-time system Let us consider a set of jobs based on the model of Liu and Layland [30] . Each job J i is characterized by a period T i , a processing time C i , a deadline D i , and a release date r i . The nth occurrence of J i can be processed if and only if its execution start date s(t i , n) is superior or equal to its release date r i + (n − 1)T i ≤ s(J i , n). and its execution end date cannot exceed its deadline
doi:10.1007/978-3-030-27652-2_1
fatcat:g35rnt5efjgejmuo676anabqme