8499 search results - page 1530 / 1700 » cans 2009 |
171
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 ...
216
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
156
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
181
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
174
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...