Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System

Sprunt, Brinkley; Sha, Lui; Lehoczky, John P.

doi:10.21236/ada211344

Cited by 56 publications

(34 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, B 2 = (10 + 20) msec = 30 msec. 9 At this point, we can directly apply Theorem 4. However, we can also reduce the number of steps in the analysis by noting that period 50 and 100 are harmonics and we can treat the emergency server as if it has a period of 100 msec and a service time of 10 msec, instead of a period of 50 msec and a service time of 5 msec.…”

Section: Cmu/sei-88-tr-33mentioning

confidence: 99%

Real-Time Scheduling Theory and Ada

Sha¹,

Goodenough²

1988

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Cmu/sei-88-tr-33mentioning

confidence: 99%

Real-Time Scheduling Theory and Ada

Sha¹,

Goodenough²

1988

Self Cite

View full text Add to dashboard Cite

show abstract

“…• At time r 13 , J 0 locks semaphore S 2 since there is no other locked semaphore in the system. • At time f 14 , J 0 releases S 2 .…”

Section: ={--P(simentioning

confidence: 99%

“…MEAN INTERARRIVAL TIME Figure 4-1: Scheduling Both Aperiodic and Periodic Tasks A variation to the deferrable server algorithm is known as the sporadic server algorithm [13]. As with the deferrable server algorithm, we allocate C a units of computation time within a period of T a units of time.…”

Section: Scheduling Both Periodic and Aperiodic Tasksmentioning

confidence: 99%

See 1 more Smart Citation

Mode Change Protocol for Priority-Driven Preemptive Scheduling

Sha¹,

Rajkumar²,

Lehoczky³

et al. 1988

Self Cite

View full text Add to dashboard Cite

“…Note that since most of the monitoring functions to be performed in CPS are well defined, the set of application transactions to be supported in the system can be pre-defined according to the monitoring functions. If the system also needs to support sporadic application transactions, various real-time scheduling techniques can be applied to converte the sporadic transactions to periodic transactions [5,22,30].…”

Section: Introductionmentioning

confidence: 99%

An effective fixed priority co-scheduling algorithm for periodic update and application transactions

et al. 2012

View full text Add to dashboard Cite

An important function of many Cyber-Physical Systems (CPS) is to provide a close monitoring of the operation environment to be able to adapt to changing situations effectively. One of the commonly applied techniques for that is to invoke time-constrained periodic application transactions to check the status of the operation environment. The status of the environment is represented by the values of the physical entities in the operation environment which are maintained as real-time data objects in a real-time database. Unfortunately, meeting the deadlines of application transactions and maintaining the quality of real-time data objects are conflicting with each other, because they compete for the same computation resources. To address this problem of update and application transactions co-scheduling problem, in this paper, we propose a fixed priority co-scheduling algorithm called Periodic Co-Scheduling ( PCS). PCS uses periodic update transactions to maintain the temporal validity of real-time data objects. It judiciously decides the priority orders among all the update and application transactions so that the constructed schedule can satisfy the deadline constraints of all the application transactions and at the same time maximize the qualities of the real-time data objects to ensure the correct execution of application transactions. The effectiveness of the algorithm is validated through extensive simulation experiments.

show abstract

Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System

Cited by 56 publications

References 5 publications

Real-Time Scheduling Theory and Ada

Real-Time Scheduling Theory and Ada

Mode Change Protocol for Priority-Driven Preemptive Scheduling

An effective fixed priority co-scheduling algorithm for periodic update and application transactions

Contact Info

Product

Resources

About