A novel approach to multiprogrammed multiprocessor synchronization for real-time kernels

Takada, Hiroaki; Satoh, Ken

doi:10.1109/real.1997.641276

Cited by 20 publications

(29 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…FIFO spin locks are used to protected short resources while semaphores are adopted to protect long resources. SPEPP [26] and M-BWI [15], [19] apply the notion of a helping mechanism, where a waiting task can execute on behalf of the preempted resource holder. More recently, a protocol named RNLP [28], [27] has been developed to support nested resource requests by applying a token mechanism and a set of request satisfaction mechanisms that can fit into different system models.…”

Section: B Related Workmentioning

confidence: 99%

New schedulability analysis for MrsP

Zhao

Garrido

Burns

et al. 2017

2017 IEEE 23rd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

Abstract-In this paper we consider a spin-based multiprocessor locking protocol, named the Multiprocessor resource sharing Protocol (MrsP). MrsP adopts a helping-mechanism where the preempted resource holder can migrate. The original schedulability analysis of MrsP carries considerable pessimism as it has been developed assuming limited knowledge of the resource usage for each remote task. In this paper new MrsP schedulability analysis is developed that takes into account such knowledge to provide a less pessimistic analysis than that of the original analysis. Our experiments show that, theoretically, the new analysis offers better (at least identical) schedulability than the FIFO non-preemptive protocol, and can outperform FIFO preemptive spin locks under systems with either intensive resource contention or long critical sections.The paper also develops analysis to include the overhead of MrsP's helping mechanism. Although MrsP's helping mechanism theoretically increases schedulability, our evaluation shows that this increase may be negated when the overheads of migrations are taken into account. To mitigate this, we have modified the MrsP protocol to introduce a short non-preemptive section following migration. Our experiments demonstrate that with migration cost, MrsP may not be favourable for short critical sections but provides a better schedulability than other FIFO spin-based protocols when long critical sections are applied.

show abstract

Section: B Related Workmentioning

confidence: 99%

New schedulability analysis for MrsP

Zhao

Garrido

Burns

et al. 2017

2017 IEEE 23rd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

show abstract

“…Finally, several researchers have suggested operating system mechanisms that provide user applications with a limited degree of control over scheduling, allowing them to avoid [4,5,14,19,25] or recover from [1,2,31,33] inopportune preemption. Commercial support for such mechanisms, however, is neither universal nor consistent.…”

Section: Related Workmentioning

confidence: 99%

Preemption Adaptivity in Time-Published Queue-Based Spin Locks

Scherer

Scott

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The proliferation of multiprocessor servers and multithreaded applications has increased the demand for high-performance synchronization. Traditional scheduler-based locks incur the overhead of a full context switch between threads and are thus unacceptably slow for many applications. Spin locks offer low overhead, but they either scale poorly on large-scale SMPs (test-and-set style locks) or behave poorly in the presence of preemption (queue-based locks).Previous work has shown how to build preemption-tolerant locks using an extended kernel interface, but such locks are neither portable to nor even compatible with most operating systems.In this work, we propose a time-publishing heuristic in which each thread periodically records its current timestamp to a shared memory location. Given the high resolution, roughly synchronized clocks of modern processors, this convention allows threads to guess accurately which peers are active based on the currency of their timestamps. We implement two queuebased locks, MCS-TP and CLH-TP, and evaluate their performance relative to both traditional spin locks and preemption-safe locks on a 32-processor IBM p690 multiprocessor. Experimental results indicate that time-published locks make it feasible, for the first time, to use queue-based spin locks on multiprogrammed systems with a standard kernel interface.

show abstract

“…All work known to us on preemptable queue locks involves list-based locks [21,22]. This is probably due to the advantages listed in the previous paragraph that (nonpreemptable) list-based locks have over array-based ones.…”

Section: Implementing Objectsmentioning

confidence: 99%

“…In our approach, a task performs an operation on an object by first acquiring a lock; if a task is preempted before its operation is completed, then its operation is retried. In comparison to previous preemptable queue-lock algorithms [21,22], ours is quite simple. Its simplicity is mostly due to the fact that it was designed for systems satisfying the Preemption Axiom.…”

mentioning

confidence: 99%

Efficient object sharing in quantum-based real-time systems

Anderson

Jain²,

Jeffay

Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279)

View full text Add to dashboard Cite

We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum-based systems, the size of the quantum is quite large in comparison to the length of an object call. As a result, most object calls can be expected to execute without preemption. A good object-sharing scheme should optimize for this expected case, while achieving low overhead when preemptions do occur. In this paper, we present several new shared-object algorithms for uniprocessors and multiprocessors that were designed based upon this principle. We also present scheduling analysis results that can be used in conjunction with these algorithms.

show abstract

A novel approach to multiprogrammed multiprocessor synchronization for real-time kernels

Cited by 20 publications

References 10 publications

New schedulability analysis for MrsP

New schedulability analysis for MrsP

Preemption Adaptivity in Time-Published Queue-Based Spin Locks

Efficient object sharing in quantum-based real-time systems

Contact Info

Product

Resources

About