3206 search results - page 82 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
114
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
136
click to vote
ASPDAC
2001
ACM
15 years 6 months ago
2001
ACM
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
148
Voted
HPCC
2011
Springer
14 years 2 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
117
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
112
Voted
DSD
2007
IEEE
15 years 9 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...