Sciweavers

3206 search results - page 143 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
PPOPP
2009
ACM
16 years 3 months ago
A compiler-directed data prefetching scheme for chip multiprocessors
Data prefetching has been widely used in the past as a technique for hiding memory access latencies. However, data prefetching in multi-threaded applications running on chip multi...
Dhruva Chakrabarti, Mahmut T. Kandemir, Mustafa Ka...
109
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 3 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
ASPDAC
2006
ACM
102views Hardware» more  ASPDAC 2006»
15 years 9 months ago
An O(mn) time algorithm for optimal buffer insertion of nets with m sinks
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
Zhuo Li, Weiping Shi
DANCE
2002
IEEE
15 years 8 months ago
Active Names: Flexible Location and Transport of Wide-Area Resources
In this paper, we explore flexible name resolution as a way of supporting extensibility for wide-area distributed services. Our approach, called Active Names, maps names to a cha...
Amin Vahdat, Michael Dahlin, Thomas E. Anderson, A...