Sciweavers

979 search results - page 22 / 196
» Optimal instruction scheduling using integer programming
Sort
View
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 3 months ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
14 years 1 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
13 years 11 months ago
Evolving machine microprograms
The realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine ins...
Pedro A. Castillo Valdivieso, G. Fernández,...
JCO
2000
116views more  JCO 2000»
13 years 9 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 7 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi