4747 search results - page 721 / 950 » Shuffle Memory System |
169
click to vote
OPODIS
2004
15 years 8 months ago
2004
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
164
click to vote
PDCN
2004
15 years 8 months ago
2004
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
167
click to vote
FTCS
1998
15 years 8 months ago
1998
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
167
click to vote
OSDI
1994
ACM
15 years 8 months ago
1994
ACM
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rat...
170
click to vote
CIDR
2009
15 years 7 months ago
2009
Does the advent of flash devices constitute a radical change for secondary storage? How should database systems adapt to this new form of secondary storage? Before we can answer t...