Reducing Queue Lock Pessimism in Multiprocessor Schedulability Analysis - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

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.
Fichier principal
Vignette du fichier
rtns2010_chang.pdf (317.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00546915 , version 1 (15-12-2010)

Identifiers

  • HAL Id : hal-00546915 , version 1

Cite

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⟩
82 View
34 Download

Share

Gmail Facebook X LinkedIn More