24368 search results - page 4553 / 4874 » Distributed Computing Economics |
187
click to vote
PPOPP
2009
ACM
16 years 7 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 ...
192
click to vote
PPOPP
2009
ACM
16 years 7 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...
213
click to vote
SPAA
2009
ACM
16 years 7 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...
168
click to vote
SPAA
2009
ACM
16 years 7 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...
192
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Transactional memory (TM) eliminates many problems associated with lock-based synchronization. Over recent years, much progress has been made in software and hardware implementati...