6584 search results - page 868 / 1317 » Distributed Shared Contexts |
220
click to vote
HPCA
2012
IEEE
14 years 2 months ago
2012
IEEE
The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of memory accesses is filtered by first and second level...
221
Voted
CONCUR
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
213
click to vote
HPDC
2012
IEEE
13 years 9 months ago
2012
IEEE
Many storage systems are shared by multiple clients with different types of workloads and performance targets. To achieve performance targets without over-provisioning, a system ...
211
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
204
click to vote
HPCA
2006
IEEE
16 years 7 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...