110 search results - page 10 / 22 » Effective Jump-Pointer Prefetching for Linked Data Structure... |
CGO
2004
IEEE
13 years 10 months ago
2004
IEEE
The effective use of processor caches is crucial to the performance of applications. It has been shown that cache misses are not evenly distributed throughout a program. In applic...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
AIRWEB
2008
Springer
13 years 8 months ago
2008
Springer
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
TPDS
2008
13 years 6 months ago
2008
We present NRMI: a drop-in replacement for Java RMI that supports call-by-copy-restore semantics for arbitrary linked data structures, in addition to regular call-by-copy semantic...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— The goal of data center networking is to interconnect a large number of server machines with low equipment cost, high and balanced network capacity, and robustness to l...