Sciweavers

36 search results - page 7 / 8
» Composite Abortable Locks
Sort
View
PLDI
2012
ACM
11 years 8 months ago
JANUS: exploiting parallelism via hindsight
This paper addresses the problem of reducing unnecessary conflicts in optimistic synchronization. Optimistic synchronization must ensure that any two concurrently executing trans...
Omer Tripp, Roman Manevich, John Field, Mooly Sagi...
VLDB
2005
ACM
397views Database» more  VLDB 2005»
14 years 6 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
ISCA
2007
IEEE
142views Hardware» more  ISCA 2007»
14 years 2 days ago
MetaTM//TxLinux: transactional memory for an operating system
This paper quantifies the effect of architectural design decisions on the performance of TxLinux. TxLinux is a Linux kernel modified to use transactions in place of locking prim...
Hany E. Ramadan, Christopher J. Rossbach, Donald E...
MICRO
2008
IEEE
162views Hardware» more  MICRO 2008»
13 years 5 months ago
MetaTM/TxLinux: Transactional Memory for an Operating System
This paper quantifies the effect of architectural design decisions on the performance of TxLinux. TxLinux is a Linux kernel modified to use transactions in place of locking primit...
Hany E. Ramadan, Christopher J. Rossbach, Donald E...
ICST
2008
IEEE
14 years 6 days ago
Scheduling Timed Modules for Correct Resource Sharing
Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized pa...
Cristina Cerschi Seceleanu, Paul Pettersson, Hans ...