Multicommodity Flow Algorithms for Buffered Global Routing

Details Multicommodity Flow Algorithms for Buffered Global Routing Multicommodity Flow Algorithms for Buffered Global Routing

2005-08-06

arxiv.org/abs/cs/0508045v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we describe a new algorithm for buffered global routing according to a prescribed buffer site map. Specifically, we describe a provably good multi-commodity flow based algorithm that finds a global routing minimizing buffer and wire congestion subject to given constraints on routing area (wirelength and number of buffers) and sink delays. Our algorithm allows computing the tradeoff curve between routing area and wire/buffer congestion under any combination of delay and capacity constraints, and simultaneously performs buffer/wire sizing, as well as layer and pin assignment. Experimental results show that near-optimal results are obtained with a practical runtime.

Affiliated with

Also associated with

No associations

Rating

Multicommodity Flow Algorithms for Buffered Global Routing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multicommodity Flow Algorithms for Buffered Global Routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multicommodity Flow Algorithms for Buffered Global Routing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522359