Sciweavers

56 search results - page 10 / 12
» Fast compiler optimisation evaluation using code-feature bas...
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 1 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
PAKDD
2009
ACM
233views Data Mining» more  PAKDD 2009»
14 years 1 days ago
A Kernel Framework for Protein Residue Annotation
Abstract. Over the last decade several prediction methods have been developed for determining structural and functional properties of individual protein residues using sequence and...
Huzefa Rangwala, Christopher Kauffman, George Kary...
SC
2009
ACM
14 years 2 months ago
Age based scheduling for asymmetric multiprocessors
Asymmetric (or Heterogeneous) Multiprocessors are becoming popular in the current era of multi-cores due to their power efficiency and potential performance and energy efficienc...
Nagesh B. Lakshminarayana, Jaekyu Lee, Hyesoon Kim
CGO
2005
IEEE
14 years 1 months ago
A Progressive Register Allocator for Irregular Architectures
Register allocation is one of the most important optimizations a compiler performs. Conventional graphcoloring based register allocators are fast and do well on regular, RISC-like...
David Koes, Seth Copen Goldstein
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
13 years 11 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson