125
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
92
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
98
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
125
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
89
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is...
123
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
107
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
101
Voted
ASAP
2009
IEEE
15 years 10 months ago
2009
IEEE
— There is a clear trend towards multi-cores to meet the performance requirements of emerging and future applications. A different way to scale performance is, however, to specia...