Sciweavers

835 search results - page 90 / 167
» On optimal slicing of parallel programs
Sort
View
CP
2004
Springer
14 years 3 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
POPL
2010
ACM
14 years 7 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
PPDP
2007
Springer
14 years 4 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
COCOA
2007
Springer
14 years 4 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
CASES
2003
ACM
14 years 3 months ago
Compiler optimization and ordering effects on VLIW code compression
Code size has always been an important issue for all embedded applications as well as larger systems. Code compression techniques have been devised as a way of battling bloated co...
Montserrat Ros, Peter Sutton