3616 search results - page 224 / 724 » Conditional Memory Ordering |
160
click to vote
SC
2004
ACM
15 years 11 months ago
2004
ACM
Large datasets, on the order of GB and TB, are increasingly common as abundant computational resources allow practitioners to collect, produce and store data at higher rates. As d...
158
Voted
PPOPP
2003
ACM
15 years 11 months ago
2003
ACM
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
164
click to vote
IWMM
2000
Springer
15 years 10 months ago
2000
Springer
We study the effectiveness of garbage collection (GC) algorithms by measuring the time difference between the actual collection time of an object and the potential earliest collec...
172
click to vote
SIGGRAPH
2000
ACM
15 years 10 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
160
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...