40 search results - page 5 / 8 » Locking in Pfair-Scheduled Multiprocessor Systems |
ISCA
1993
IEEE
13 years 11 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
RTAS
2008
IEEE
14 years 2 months ago
2008
IEEE
In the domain of multiprocessor real-time systems, there has been a wealth of recent work on scheduling, but relatively little work on the equally-important topic of synchronizati...
FPL
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we present a rapid prototyping platform on a single Field Programmable Gate Array (FPGA) with support for software transactional memory. The system is composed only b...
HIPC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
PODC
1994
ACM
13 years 11 months ago
1994
ACM
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...