98 search results - page 14 / 20 » Macro-op Scheduling: Relaxing Scheduling Loop Constraints |
113
Voted
ICPP
2002
IEEE
15 years 6 months ago
2002
IEEE
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...
104
click to vote
INFORMS
2000
15 years 1 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
WSC
2007
15 years 4 months ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
123
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
101
click to vote
MJ
2006
15 years 1 months ago
2006
The Hardware (HW)/Software (SW) partitioning/scheduling relies on two subtasks : the cost function and the real time (RT) analysis. Besides these two subtasks, the proposed generi...