506 search results - page 57 / 102 » Distributing synchronous programs using bounded queues |
SIAMCOMP
2011
13 years 2 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
SPAA
2009
ACM
14 years 8 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...
FIDJI
2003
Springer
14 years 27 days ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...