Learn More
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(More)
We present a real-time, Linux-based testbed called LITMUS RT , which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present the results from such an evaluation, in which partitioned earliest-deadline-first (EDF) scheduling, pre-emptive and nonpreemptive global EDF scheduling, and two variants of the(More)
Multicore platforms are predicted to become significantly larger in the coming years. Given that real-time workloads will inevitably be deployed on such platforms, the scalabil-ity of the scheduling algorithms used to support such work-loads warrants investigation. In this paper, this issue is considered and an empirical evaluation of several global and(More)
In the classic \one-time" renaming problem, processes are required to choose new names in order to reduce the size of their name space. We introduce a new, more general version of the renaming problem called \long-lived" renaming, in which processes may repeatedly acquire and release names. We also present several wait-free algorithms for both one-time and(More)
This paper is concerned with synchronization under read/write atomicity in shared memory multi-processors. We present a new algorithm for N-process mutual exclusion that requires only read and write operations and that has O(log N) time complexity, where \time" is measured by counting remote memory references. The time complexity of this algorithm is better(More)
We present a v ariant of Pfair scheduling, which w e call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial time. However, ERfair scheduling diiers from Pfair scheduling in that it is work conserving. As a(More)
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiproces-sor systems. In hard real-time systems, a significant disparity exists between EDF-based schemes and Pfair scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on multiprocessors): on M processors, all known EDF(More)