Sciweavers

5 search results - page 1 / 1
» Scalable Flat-Combining Based Synchronous Queues
Sort
View
WDAG
2010
Springer
182views Algorithms» more  WDAG 2010»
13 years 3 months ago
Scalable Flat-Combining Based Synchronous Queues
In a synchronous queue, producers and consumers handshake to exchange data. Recently, new scalable unfair synchronous queues were added to the Java JDK 6.0 to support high performa...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
SPAA
2010
ACM
13 years 9 months ago
Flat combining and the synchronization-parallelism tradeoff
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 5 months ago
Window-Based Greedy Contention Management for Transactional Memory
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
Gokarna Sharma, Brett Estrade, Costas Busch
PODC
2011
ACM
12 years 7 months ago
Scalability versus semantics of concurrent FIFO queues
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
Hannes Payer, Harald Röck, Christoph M. Kirsc...
MICRO
2010
IEEE
156views Hardware» more  MICRO 2010»
13 years 3 months ago
Explicit Communication and Synchronization in SARC
SARC merges cache controller and network interface functions by relying on a single hardware primitive: each access checks the tag and the state of the addressed line for possible...
Manolis Katevenis, Vassilis Papaefstathiou, Stamat...