Efficient Synchronization under Global EDF Scheduling on Multiprocessors

Devi, UmaMaheswari; Leontyev, Hennadiy; Anderson, James H.

doi:10.1109/ecrts.2006.10

Cited by 52 publications

(52 citation statements)

References 22 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A study performed by [Gai et al 2003] showed that MSRP typically outperforms MPCP when global critical sections are short and access to local resources dominates access to global resources. [Devi et al 2006], considered the problem of accessing mutually exclusive shared resources under global EDF scheduling. They suggested two simple approaches for short non-nested accesses to shared data structures: Spin-based queue locks [Mellor-Crummey and Scott 1991] and lock-free synchronisation.…”

Section: Partitioned Schedulingmentioning

confidence: 99%

A survey of hard real-time scheduling for multiprocessor systems

2011

View full text Add to dashboard Cite

________________________________________________________________________This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960's to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges and likely productive research directions.

show abstract

Section: Partitioned Schedulingmentioning

confidence: 99%

A survey of hard real-time scheduling for multiprocessor systems

2011

View full text Add to dashboard Cite

show abstract

“…For priority-assignment schemes that are known to offer good performance (deadline monotonic (DM) [10], RM-US(x) [I ] and DM-US(x) [12]). the combination of the resource-sharing protocol and the schedulability test should have the property that a large number of task sets can be given pre-run time guarantees ror deadline satisraetion; R9, Performance (as statcd by RS) should be particu larly good for the important special case that the duration for which tasks need shared resources is small; it has been shown that this special case applies to most applications in practice [6].…”

Section: Bjorn Anderssonmentioning

confidence: 99%

“…Let this system be scheduled on 'm processors using a global fixed-priority preemptive scheduler such that task Ti has higher base-priority than task Tj for all i < j. Then RTi is given as: given by Equations (6). (7).…”

Section: Therefore We Set (7)mentioning

confidence: 99%

Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling

Easwaran

Andersson

2009

2009 30th IEEE Real-Time Systems Symposium

View full text Add to dashboard Cite

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments. Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor SchedulingArvind Easwaran CISTER/IPP-HURRAY, Polytechnic Institute of Porto, Portugal aen@isep,ipp,pt Abstract-In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline

show abstract

“…Another shared resource arbitration algorithm is the Multiprocessor Stack Resource Protocol (MSRP) which is compared with MPCP in [12], showing that neither outperforms the other on the complete spectrum of system setups. In [13] Devi et al present a synchronization procedure specifically for multiprocessor scheduling under global EDF.…”

Section: Related Workmentioning

confidence: 99%

Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources

Negrean

Schliecker

Ernst

2009

2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition

View full text Add to dashboard Cite

Abstract-As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most known schedulability tests lack a general applicability. Common constraints are a periodic or sporadic task activation pattern, with deadlines no larger than the period, or no support for shared resource arbitration, which is frequently required for embedded systems. In this paper, we address these constraints and present a general analysis which allows the calculation of response times for fixed priority task sets with arbitrary activations and deadlines in a partitioned multiprocessor system with shared resources. Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP).

show abstract

Efficient Synchronization under Global EDF Scheduling on Multiprocessors

Cited by 52 publications

References 22 publications

A survey of hard real-time scheduling for multiprocessor systems

A survey of hard real-time scheduling for multiprocessor systems

Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling

Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources

Contact Info

Product

Resources

About