2452 search results - page 354 / 491 » The Case for Precision Sharing |
167
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
187
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
175
click to vote
MICRO
2009
IEEE
16 years 1 months ago
2009
IEEE
Network-on-Chips (NoCs) are likely to become a critical shared resource in future many-core processors. The challenge is to develop policies and mechanisms that enable multiple ap...
181
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
189
click to vote
SIGMETRICS
2009
ACM
16 years 1 months ago
2009
ACM
Flash Memory based Solid State Drive (SSD) has been called a “pivotal technology” that could revolutionize data storage systems. Since SSD shares a common interface with the t...