A framework for implementing objects and scheduling tasks in lock-free real-time systems

Anderson, James H.; Ramamurthy, Srikanth

doi:10.1109/real.1996.563704

Cited by 20 publications

(49 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since scheduling begins simultaneously on all processors, slot i spans the time interval [i, i+1) across processors. For instance, in Figure 2.1(b), task B is scheduled in slot 3, which corresponds to the time interval [3,4). (The rest of this figure is considered in detail below.)…”

Section: The Pfairness Constraintmentioning

confidence: 99%

“…Global scheduling of independent periodic and sporadic tasks is considered next in Section 3. 3. Finally, we discuss the use of server tasks in Section 3.…”

Section: System Overviewmentioning

confidence: 99%

“…We let t + q denote the requested time of the quantum event, as shown in Figure 3. 3. To ensure that the scheduler completes before this event, q must be selected so that t + q −  − ≥ t +  + + ξ max holds.…”

Section: Bounding Slot and Quantum Fluctuationsmentioning

confidence: 99%

“…Later in this chapter, we discuss the use of servers in more detail. Since any scheduling policy can be applied to non-real-time tasks, 3 we do not consider this set beyond this section. Instead, we make the simplifying assumption that the execution of non-real-time tasks does not impact the execution of tasks in the other sets.…”

Section: Supported Tasksmentioning

confidence: 99%

“…The next result bounds the number of slots crossed by a sequence of n consecutive windows, which we refer to as an n-span of a task. For instance, the interval [3,13) in Figure 3.4(a) is a 3-span since r(T 2 ) = 3 and d(T 4 ) = 14. In general, each n-span corresponds to an interval [r(T i+1 ) , d(T i+n )) for some integer i.…”

Section: Lemma 32mentioning

confidence: 99%

See 4 more Smart Citations

Locking in pfair-scheduled multiprocessor systems

Holman

Anderson

23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002.

Self Cite

View full text Add to dashboard Cite

The goal of this dissertation is to extend the Pfair scheduling approach in order to enable its efficient implementation on a real-time multiprocessor. At present, Pfair scheduling is the only known means for optimally scheduling recurrent real-time tasks on multiprocessors. In addition, there has been growing practical interest in such approaches due to their fairness guarantees. Unfortunately, prior work in this area has considered only the scheduling of independent tasks, which do not communicate with each other or share resources. The work presented herein focuses both on adding support for these actions and also on developing techniques for reducing various forms of implementation overhead, including that produced by task migrations and context switches. The thesis of this dissertation is: tasks can be efficiently synchronized in Pfair-scheduled systems and overhead due to common system events, such as context switches and migrations, can be reduced.This thesis is established through research in three areas. First, the pre-existing Pfair scheduling theory is extended to support the scheduling of groups of tasks as a single entity. Second, mechanisms for supporting both lock-based and lock-free synchronization are presented. Lockbased synchronization coordinates access to shared resources through the use of semaphores.On the other hand, lock-free operations are optimistically attempted and then retried if the operation fails. Last, the deployment of Pfair scheduling on a symmetric multiprocessor is considered.

show abstract

Section: The Pfairness Constraintmentioning

confidence: 99%

“…Global scheduling of independent periodic and sporadic tasks is considered next in Section 3. 3. Finally, we discuss the use of server tasks in Section 3.…”

Section: System Overviewmentioning

confidence: 99%

Section: Bounding Slot and Quantum Fluctuationsmentioning

confidence: 99%

Section: Supported Tasksmentioning

confidence: 99%

Section: Lemma 32mentioning

confidence: 99%

See 3 more Smart Citations

Locking in pfair-scheduled multiprocessor systems

Holman

Anderson

23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002.

Self Cite

View full text Add to dashboard Cite

show abstract

Lock-Free Transactions for Real-Time Systems

Anderson¹,

Ramamurthy²,

Moir³

et al. 1997

Real-Time Database Systems

View full text Add to dashboard Cite

On Scalable Synchronization for Distributed Embedded Real-Time Systems

Fahmy

Ravindran

Jensen

2008

Software Technologies for Embedded and Ubiquitous Systems

View full text Add to dashboard Cite

Abstract. We consider the problem of programming distributed embedded real-time systems with distributed dependencies. We show that the de facto standard of using locks and condition variables in conjunction with threads can have significant overhead and semantic difficulty and suggest alternative programming abstractions to alleviate these problems. We also discuss several alternatives for implementing these programming abstractions and discuss the algorithms and protocols needed.

show abstract

A framework for implementing objects and scheduling tasks in lock-free real-time systems

Cited by 20 publications

References 19 publications

Locking in pfair-scheduled multiprocessor systems

Locking in pfair-scheduled multiprocessor systems

Lock-Free Transactions for Real-Time Systems

On Scalable Synchronization for Distributed Embedded Real-Time Systems

Contact Info

Product

Resources

About