96 search results - page 8 / 20 » Needed: foundations for transactional memory |
PODC
1998
ACM
14 years 29 days ago
1998
ACM
: We present a new model for handling messages and state in a distributed application that we call Messages in Local Transactions (MLT). Under this model, messages and data are not...
GROUP
2007
ACM
14 years 18 days ago
2007
ACM
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
ALENEX
2011
13 years 10 days ago
2011
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
SIGPLAN
2008
13 years 8 months ago
2008
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transa...
MICRO
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...