13752 search results - page 2646 / 2751 » Parallel and Distributed Haskells |
125
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
122
Voted
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
136
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
125
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...