Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Supporting Nested Locking in Multiprocessor Real-Time Systems Bryan C. Ward and James H. Anderson
 

Summary: Supporting Nested Locking in Multiprocessor Real-Time Systems
Bryan C. Ward and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
This paper presents the first real-time multiprocessor lock-
ing protocol that supports fine-grained nested resource re-
quests. This locking protocol relies on a novel technique for
ordering the satisfaction of resource requests to ensure a
bounded duration of priority inversions for nested requests.
This technique can be applied on partitioned, clustered, and
globally scheduled systems in which waiting is realized by
either spinning or suspending. Furthermore, this technique
can be used to construct fine-grained nested locking proto-
cols that are efficient under spin-based, suspension-oblivious
or suspension-aware analysis of priority inversions. Lock-
ing protocols built upon this technique perform no worse
than coarse-grained locking mechanisms, while allowing for
increased parallelism in the average case (and, depending
upon the task set, better worst-case performance).
1 Introduction

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences