Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Almost all k-colorable graphs are easy to color
Journal of Algorithms
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Exact coloring of real-life graphs is easy
DAC '97 Proceedings of the 34th annual Design Automation Conference
CPU reservations and time constraints: efficient, predictable scheduling of independent activities
Proceedings of the sixteenth ACM symposium on Operating systems principles
Performance driven global routing for standard cell design
Proceedings of the 1997 international symposium on Physical design
Efficient coloring of a large spectrum of graphs
DAC '98 Proceedings of the 35th annual Design Automation Conference
New methods to color the vertices of a graph
Communications of the ACM
Backtrack programming techniques
Communications of the ACM
Model composition for scheduling analysis in platform design
Proceedings of the 39th annual Design Automation Conference
Synthesis and Optimization of Digital Circuits
Synthesis and Optimization of Digital Circuits
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic response time optimization for SDF graphs
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Optimisation problems for dynamic concurrent task-based systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
Improved force-directed scheduling in high-throughput digital signal processing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Heuristics are widely used for solving computational intractablesynthesis problems. However, until now, there has been limitedeffort to systematically develop heuristics that can be applied to avariety of synthesis tasks. We focus on development of generaloptimization principles so that they can be applied to a wide rangeof synthesis problems. In particular, we propose a new way torealize the most constraining principle where at each step wegradually relax the constraints on the most constrained elementsof the solution. This basic optimization mechanism is augmentedwith several new heuristic principles: minimal freedom reduction,negative thinking, calibration, simultaneous step consideration,and probabilistic modeling.We have successfully applied these optimization principles to anumber of common behavioral synthesis tasks. Specifically, wedemonstrate a systematic way to develop optimization algorithmsfor maximum independent set, time-constrained scheduling, andsoft real-time system scheduling. The effectiveness of theapproach and algorithms is validated on extensive real-lifebenchmarks.