3206 search results - page 115 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
101
Voted
SIROCCO
2007
15 years 4 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
126
Voted
ANOR
2005
15 years 2 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
135
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
115
Voted
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
The inability to perform optimizations based on application-specific information presents a hurdle to the deployment of pervasive LAN file systems across WAN environments. This pa...
124
Voted
ISCA
2010
IEEE
15 years 7 months ago
2010
IEEE
In computer architecture, caches have primarily been viewed as a means to hide memory latency from the CPU. Cache policies have focused on anticipating the CPU’s data needs, and...