Sciweavers

Share
JSA
2006
114views more  JSA 2006»
9 years 5 months ago
Distributed computing using Java: A comparison of two server designs
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
Boris Roussev, Jie Wu
CAV
2010
Springer
198views Hardware» more  CAV 2010»
9 years 9 months ago
Automatically Proving Linearizability
Abstract. This paper presents a practical automatic veriļ¬cation procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
Viktor Vafeiadis
WDAG
2009
Springer
130views Algorithms» more  WDAG 2009»
10 years 3 days ago
Contention-Sensitive Data Structures and Algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
Gadi Taubenfeld
books