Sciweavers

164 search results - page 14 / 33
» Primitives for Contract-based Synchronization
Sort
View
EMSOFT
2010
Springer
14 years 8 months ago
From high-level component-based models to distributed implementations
Constructing correct distributed systems from their high-level models has always been a challenge and often subject to serious errors because of their non-deterministic and non-at...
Borzoo Bonakdarpour, Marius Bozga, Mohamad Jaber, ...
IPPS
2010
IEEE
14 years 7 months ago
Clustering JVMs with software transactional memory support
Affordable transparent clustering solutions to scale non-HPC applications on commodity clusters (such as Terracotta) are emerging for Java Virtual Machines (JVMs). Working in this ...
Christos Kotselidis, Mikel Luján, Mohammad ...
POPL
2009
ACM
15 years 5 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
75
Voted
EDO
2000
Springer
15 years 1 months ago
Using Model Checking to Detect Deadlocks in Distributed Object Systems
Abstract. We demonstratehow the use of synchronizationprimitives and threading policies in distributed object middleware can lead to deadlocks. We identify that objectmiddleware on...
Nima Kaveh
68
Voted
WDAG
2005
Springer
85views Algorithms» more  WDAG 2005»
15 years 3 months ago
Time and Space Lower Bounds for Implementations Using k-CAS
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
Hagit Attiya, Danny Hendler