Sciweavers

1291 search results - page 53 / 259
» Arithmetic program paths
Sort
View
RTAS
2005
IEEE
14 years 2 months ago
Improving WCET by Optimizing Worst-Case Paths
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compi...
Wankang Zhao, William C. Kreahling, David B. Whall...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 22 days ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
RTS
2006
84views more  RTS 2006»
13 years 8 months ago
Improving WCET by applying worst-case path optimizations
It is advantageous to perform compiler optimizations that attempt to lower the worst-case execution time (WCET) of an embedded application since tasks with lower WCETs are easier ...
Wankang Zhao, William C. Kreahling, David B. Whall...
ICCAD
2000
IEEE
74views Hardware» more  ICCAD 2000»
14 years 27 days ago
Simultaneous Gate Sizing and Fanout Optimization
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the timing-critical paths in a circuit. First, a continuous-variable delay model that ...
Wei Chen, Cheng-Ta Hsieh, Massoud Pedram
POPL
1998
ACM
14 years 22 days ago
Alias Analysis of Executable Code
Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfort...
Saumya K. Debray, Robert Muth, Matthew Weippert