3616 search results - page 133 / 724 » Conditional Memory Ordering |
219
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
164
click to vote
HPCC
2007
Springer
16 years 15 days ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
151
click to vote
DATE
2006
IEEE
16 years 12 days ago
2006
IEEE
In many computer systems with large data computations, the delay of memory access is one of the major performance bottlenecks. In this paper, we propose an enhanced field remappi...
197
click to vote
ISSTA
2006
ACM
16 years 9 days ago
2006
ACM
We present initial work on perturbation techniques that cause the manifestation of timing-related bugs in distributed memory Message Passing Interface (MPI)-based applications. Th...
177
click to vote
ISCA
2005
IEEE
15 years 12 months ago
2005
IEEE
Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Tempor...