11784 search results - page 170 / 2357 » Interpolation for data structures |
110
click to vote
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
HPCA
2000
IEEE
15 years 4 months ago
2000
IEEE
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
115
click to vote
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
107
Voted
CSL
2010
Springer
15 years 24 days ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
CONEXT
2009
ACM
15 years 24 days ago
2009
ACM
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...