Sciweavers

386 search results - page 21 / 78
» Informing Memory Operations: Providing Memory Performance Fe...
Sort
View
ASPLOS
2011
ACM
13 years 7 days ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
ANCS
2005
ACM
14 years 2 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
ICS
2004
Tsinghua U.
14 years 2 months ago
Effective stream-based and execution-based data prefetching
With processor speeds continuing to outpace the memory subsystem, cache missing memory operations continue to become increasingly important to application performance. In response...
Sorin Iacobovici, Lawrence Spracklen, Sudarshan Ka...
CJ
2010
190views more  CJ 2010»
13 years 6 months ago
A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory
A concurrent object is an object that can be concurrently accessed by several processes. Sequential consistency is a consistency criterion for such objects. Informally, it states ...
Vicent Cholvi, Antonio Fernández, Ernesto J...
PLDI
2012
ACM
11 years 11 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...