127 search results - page 23 / 26 » A cache-defect-aware code placement algorithm for improving ... |
137
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
185
Voted
BMCBI
2011
14 years 6 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
139
Voted
CODES
2001
IEEE
15 years 6 months ago
2001
IEEE
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
138
click to vote
CGO
2008
IEEE
15 years 9 months ago
2008
IEEE
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
148
click to vote
ICS
2007
Tsinghua U.
15 years 9 months ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...