Sciweavers

2805 search results - page 66 / 561
» Modeling Memory for Melodies
Sort
View
PLDI
2011
ACM
14 years 8 months ago
Partial-coherence abstractions for relaxed memory models
Michael Kuperstein, Martin T. Vechev, Eran Yahav
VISUALIZATION
1998
IEEE
15 years 10 months ago
Fast and memory efficient polygonal simplification
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
Peter Lindstrom, Greg Turk
WOMPAT
2001
Springer
15 years 10 months ago
A Study of Implicit Data Distribution Methods for OpenMP Using the SPEC Benchmarks
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
Dimitrios S. Nikolopoulos, Eduard Ayguadé
DFT
1999
IEEE
119views VLSI» more  DFT 1999»
15 years 10 months ago
RAMSES: A Fast Memory Fault Simulator
In this paper, we present a memory fault simulator called the Random Access Memory Simulator for Error Screening (RAMSES). Although it was designed based on some wellknown memory ...
Chi-Feng Wu, Chih-Tsun Huang, Cheng-Wen Wu
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 6 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt