BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip

@article{Korte2007BonnToolsMI,
  title={BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip},
  author={Bernhard Korte and Dieter Rautenbach and Jens Vygen},
  journal={Proceedings of the IEEE},
  year={2007},
  volume={95},
  pages={555-572}
}
The BonnTools provide innovative solutions for layout and timing closure that are used for many of the most complex integrated circuits. During 20 years of cooperation between the University of Bonn and IBM, new mathematical foundations and algorithms have been developed for the need of new technologies and leading-edge designs. In this paper we present the main ideas for placement, routing, timing optimization, and clock tree synthesis, which are the foundation of a continuing success story 
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 62 references

BA faster polynomial algorithm for the unbalanced Hitchcock transportation problem,[ Research Institute for Discrete Mathematics, Univ

  • U. Brenner
  • 2005
Highly Influential
9 Excerpts

BOptimizing yield in global routing,

  • D. Müller
  • Proc. IEEE Int. Conf. Computer-Aided Design,
  • 2006

Generalizing Dijkstra ’ s algorithm for shortest paths in huge graphs , with applications to VLSI routing

  • S. Peyer, D. Rautenbach, J. Vygen
  • Manuscript
  • 2006

Similar Papers

Loading similar papers…