Sciweavers

55 search results - page 1 / 11
» Improving both the performance benefits and speed of optimiz...
Sort
View
LCTRTS
2010
Springer
13 years 3 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
PLDI
2004
ACM
13 years 11 months ago
Fast searches for effective optimization phase sequences
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 ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
CGO
2007
IEEE
13 years 12 months ago
Evaluating Heuristic Optimization Phase Order Search Algorithms
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson
TON
2008
138views more  TON 2008»
13 years 5 months ago
On the performance benefits of multihoming route control
Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks tod...
Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, ...
BMCBI
2011
12 years 9 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
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...
Torbjørn Rognes