By Topic

POMR: a power-optimal maze routing methodology

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Youssef, A. ; VLSI Res. Group, Waterloo Univ., Ont., Canada ; Anis, M. ; Elmasry, M.

As the number of global interconnect buffers is expected to reach 700,000 in the 70nm CMOS process, their adverse impact on the chip total power consumption becomes evident. In this paper, we formulate the power optimal maze routing and buffer insertion/sizing problem for a two pin net, as a shortest paths ranking problem. The polynomial time bound on our formulation fits well within the context of the increased number of buffers. Moreover, its ability to account for buffer and wire blockage arising from the underlying blocks in today's SOC's is an advantage over the analytical alternative formulations. During the assessment of the impact of technology scaling using a set of MCNC benchmarks, an average power saving as high as 35% with a 10% sacrifice in delay is observed. In addition, there is a 10% variation in the power savings when accounting for the process variations.

Published in:

SOC Conference, 2004. Proceedings. IEEE International

Date of Conference:

12-15 Sept. 2004