Routing algorithms in VLSI design form the backbone of interconnect synthesis, ensuring that circuit elements are connected efficiently while conforming to strict physical and timing constraints.
We consider an online network routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results