| | |
Summary: A Flexible Real-Time Locking Protocol for Multiprocessors
Aaron Block, Hennadiy Leontyev, Bjšorn B. Brandenburg, and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
Real-time scheduling algorithms for multiprocessor systems
have been the subject of considerable recent interest. For
such an algorithm to be truly useful in practice, support for
semaphore-based locking must be provided. However, for
many global scheduling algorithms, no such mechanisms have
been proposed. Furthermore, in the partitioned case, most
prior semaphore schemes are either inefficient or restrict crit-
ical sections considerably. In this paper, a new flexible mul-
tiprocessor locking scheme is presented that can be applied
under both partitioning and global scheduling. This scheme
allows unrestricted critical-section nesting, but has been de-
signed to deal with the common case of short non-nested ac-
cesses efficiently.
1. Introduction
The advent of multicore technologies is having a dramatic
impact on the computing landscape. Most major chip manufac-
|
