5171 search results - page 870 / 1035 » Deterministic Parallel Processing |
262
Voted
ASPLOS
2009
ACM
16 years 4 months ago
2009
ACM
The wide availability of commodity graphics processors has made real-time graphics an intrinsic component of the human/computer interface. These graphics cores accelerate the z-bu...
127
Voted
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
127
Voted
PPOPP
2009
ACM
16 years 4 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...
117
click to vote
SPAA
2009
ACM
16 years 4 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...
167
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...