Sciweavers

1043 search results - page 18 / 209
» Reading, Writing and Relations
Sort
View
ACL2
2006
ACM
15 years 10 months ago
Memories: array-like records for ACL2
We have written a new records library for modelling fixedsize arrays and linear memories. Our implementation provides fixnum-optimized O(log2 n) reads and writes from ad
Jared Davis
PDIS
1994
IEEE
15 years 8 months ago
Session Guarantees for Weakly Consistent Replicated Data
Four per-session guarantees are proposed to aid users and applications of weakly consistent replicated data: Read Your Writes, Monotonic Reads, Writes Follow Reads, and Monotonic ...
Douglas B. Terry, Alan J. Demers, Karin Petersen, ...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 4 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
HPCA
2007
IEEE
16 years 4 months ago
A Burst Scheduling Access Reordering Mechanism
Utilizing the nonuniform latencies of SDRAM devices, access reordering mechanisms alter the sequence of main memory access streams to reduce the observed access latency. Using a r...
Jun Shao, Brian T. Davis
SASO
2007
IEEE
15 years 10 months ago
Shruti: A Self-Tuning Hierarchical Aggregation System
Current aggregation systems either have a single inbuilt aggregation mechanism or require applications to specify an aggregation policy a priori. It is hard to predict the read an...
Praveen Yalagandula, Michael Dahlin