Sciweavers

40 search results - page 1 / 8
» From bounded to unbounded concurrency objects and back
Sort
View
PODC
2011
ACM
12 years 7 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
PODC
2006
ACM
13 years 10 months ago
Common2 extended to stacks and unbounded concurrency
Common2, the family of objects that implement and are wait-free implementable from 2 consensus objects, is extended inhere in two ways: First, the stack object is added to the fam...
Yehuda Afek, Eli Gafni, Adam Morrison
ISCA
2007
IEEE
198views Hardware» more  ISCA 2007»
13 years 10 months ago
Making the fast case common and the uncommon case simple in unbounded transactional memory
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
Colin Blundell, Joe Devietti, E. Christopher Lewis...
ISTCS
1992
Springer
13 years 7 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
ENTCS
2006
130views more  ENTCS 2006»
13 years 4 months ago
LSC Verification for UML Models with Unbounded Creation and Destruction
The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [4] we have observ...
Bernd Westphal