Sciweavers

3206 search results - page 48 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
PARA
2004
Springer
15 years 7 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
129
Voted
DSD
2010
IEEE
161views Hardware» more  DSD 2010»
15 years 2 months ago
Design of Trace-Based Split Array Caches for Embedded Applications
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...
Alice M. Tokarnia, Marina Tachibana
ACMMSP
2006
ACM
232views Hardware» more  ACMMSP 2006»
15 years 8 months ago
Implicit and explicit optimizations for stencil computations
Stencil-based kernels constitute the core of many scientific applications on block-structured grids. Unfortunately, these codes achieve a low fraction of peak performance, due pr...
Shoaib Kamil, Kaushik Datta, Samuel Williams, Leon...
127
Voted
JCC
2006
69views more  JCC 2006»
15 years 2 months ago
Dramatic performance enhancements for the FASTER optimization algorithm
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
Benjamin D. Allen, Stephen L. Mayo
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 11 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak