Skip to Main content Skip to Navigation
Conference papers

Reducing Queue Lock Pessimism in Multiprocessor Schedulability Analysis

Abstract : Although many multiprocessor resource sharing protocols have been proposed, their impacts on the schedulability of real-time tasks are largely ignored in most of the existing literature. Recently, work has been done to integrate queue locks (FIFO-queue-based non-preemptive spin locks) with multiprocessor schedulability analysis but the techniques used introduce a substantial amount of pessimism. For global fixed task priority preemptive multiprocessor systems, this pessimism impacts low priority tasks, greatly reducing the number of tasksets that can be recognised as schedulable. We develop a new schedulability analysis lp-CDW to target this issue specifically. By combing lp-CDW with existing techniques, we significantly increase the number of tasksets that can be recognised as schedulable.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00546915
Contributor : Christine Rochange Connect in order to contact the contributor
Submitted on : Wednesday, December 15, 2010 - 10:16:06 AM
Last modification on : Saturday, November 11, 2017 - 7:04:02 PM
Long-term archiving on: : Thursday, June 30, 2011 - 1:42:56 PM

File

rtns2010_chang.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00546915, version 1

Collections

Citation

Yang Chang, Robert Davis, Andy Wellings. Reducing Queue Lock Pessimism in Multiprocessor Schedulability Analysis. 18th International Conference on Real-Time and Network Systems, Nov 2010, Toulouse, France. pp.99-108. ⟨hal-00546915⟩

Share

Metrics

Record views

139

Files downloads

76