2014 · 17 citations · 17 references
ComputingComputer EngineeringComputer ScienceParallel ComputingReal-time SystemsSchedulingDeadlock AvoidanceMultiprocessor SystemsReal-time Resource ManagementReal-time SchedulingResource SharingBlockingBlocking Time AnalysisLock ModelMultiprocessor Real-time SchedulingMultiprocessor SchedulingResource Sharing In Real-time SystemsSpinlocks
Various approaches can be utilized upon resource locking for mutually exclusive resource access in multiprocessor platforms. So far two conventional approaches exist for dealing with tasks that are blocked on a global resource in a multi-processor platform. Either the blocked task performs a busy wait, i.e. spins, at the highest priority level until the resource is released, or it is suspended. Although both approaches provide mutually exclusive access to resources, they can introduce long blocking delays to tasks, which may be unacceptable for many industrial applications. In this paper, we propose a general spin-based model for resource sharing in multiprocessor platforms in which the priority of the blocked tasks during spinning can be selected arbitrarily. Moreover, we provide the analysis for two selected spin-lock priorities and we show by means of a general comparison as well as specific examples that these solutions may provide a better performance for higher priority tasks.
17
Stack-based scheduling of realtime processes
T. P. Baker · Real-Time Systems · 1991 · 818 citations
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
Neil Audsley, Alan Burns, Mike Richardson et al. · IFAC Proceedings Volumes · 1991 · 485 citations
Real-time synchronization protocols for multiprocessors
R. Rajkumar, Lui Sha, John P. Lehoczky · 2003 · 400 citations
A Flexible Real-Time Locking Protocol for Multiprocessors
Aaron Block, Hennadiy Leontyev, Björn B. Brandenburg et al. · 2007 · 259 citations