Results 1 -
3 of
3
Combinatorial Optimization in VLSI design
- Combinatorial Optimization: Methods and Applications. IOS
"... Abstract VLSI design is probably the most fascinating application area of combinatorial optimization. Virtually all classical combinatorial optimization problems, and many new ones, occur naturally as subtasks. Due to the rapid technological development and major theoretical advances the mathematics ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Abstract VLSI design is probably the most fascinating application area of combinatorial optimization. Virtually all classical combinatorial optimization problems, and many new ones, occur naturally as subtasks. Due to the rapid technological development and major theoretical advances the mathematics of VLSI design has changed significantly over the last ten to twenty years. This survey paper gives an up-to-date account on the key problems in layout and timing closure. It also presents the main mathematical ideas used in a set of algorithms called BonnTools, which are used to design many of the most complex integrated circuits in industry.
Combinatorial Problems in Chip Design
, 2008
"... The design of very large scale integrated (VLSI) chips is an exciting area of applying mathematics, posing constantly new challenges. We present some important and challenging open problems in various areas of chip design. Although the problems are motivated by chip design, they are formulated mathe ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
The design of very large scale integrated (VLSI) chips is an exciting area of applying mathematics, posing constantly new challenges. We present some important and challenging open problems in various areas of chip design. Although the problems are motivated by chip design, they are formulated mathematically; understanding and solving them does not require any knowledge of chip design. We give some partial results and argue why a full resolution of one of the problems could result in an advance of the state of the art in algorithms for chip design.
Performance Analysis of Floyd Warshall Algorithm vs Rectangular Algorithm
"... In this paper, we have examined the comparative study of Floyd Warshall algorithm and the Rectangular algorithm. We have tested these two algorithms on random graphs generated by the Erdös – Renyi (ER) model. The evaluation of the algorithms for different probabilities show that the Floyd Warshall a ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper, we have examined the comparative study of Floyd Warshall algorithm and the Rectangular algorithm. We have tested these two algorithms on random graphs generated by the Erdös – Renyi (ER) model. The evaluation of the algorithms for different probabilities show that the Floyd Warshall algorithm gives slightly better performance for dense graphs while the Rectangular algorithm works better for sparse graphs.
