Drawing ideas from previous authors, we present a new non-blocking concurrent queue
algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can …

The work in this paper analyses the applicability of carbon nanotube (CNT) bundles as
interconnects for VLSI circuits, while taking into account the practical limitations in this …

A multiprocessor virtual machine benefits its guest operating system in supporting scalable
job throughput and request latency—useful properties in server consolidation where servers …

Fast userlevel locking is an alternative locking mechanism to the typically heavy weight
kernel approaches such as fcntl locking and System V semaphores. Here, multiple …

Shared-memory mutual exclusion: major research trends since 1986 Page 1 Digital Object
Identifier (DOI) 10.1007/s00446-003-0088-6 Distrib. Comput. (2003) 16: 75–110 c Springer-Verlag …

We present a distributed algorithm for time-sharing parallel workloads that is competitive
with coscheduling. Implicit scheduling allows each local scheduler in the system to make …

Since a static work distribution does not allow for satisfactory speed‐ups of parallel irregular
algorithms, there is a need for a dynamic distribution of work and data that can be adapted to …

Existing real-time locking protocols require accurate worst-case execution time (WCET)
estimates for both tasks and critical sections (CSs) in order to function correctly. On multicore …

Casual message logging protocols[3] have several attractive properties: they introduce no
blocking, send no additional messages over those sent by the application, and can never …

We consider the problem of implementing shared objects in uniprocessor and
multiprocessor real-time systems in which tasks are executed using a scheduling quantum …