Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1840845.1840935acmconferencesArticle/Chapter ViewAbstractPublication PagesislpedConference Proceedingsconference-collections
research-article

A pareto-algebraic framework for signal power optimization in global routing

Published: 18 August 2010 Publication History
  • Get Citation Alerts
  • Abstract

    This paper proposes a framework for (signal) interconnect power optimization at the global routing stage. In a typical design flow, the primary objective of global routing is minimization of wirelength and via consumption. Our framework takes a global routing solution that is optimized for this objective, and quickly generates a new solution that is optimized for signal power, with only a small, controlled degradation in wirelength. Our model of signal power includes layer-dependent fringe and area capacitances of the routes, and their spacing. Our framework is fast compared to the existing global routing procedures, thereby not causing much overhead and fitting well in the design flow to optimize signal power after wirelength minimization. The framework is based on Pareto-algebraic operations and generates multiple global routing solutions to provide a tradeoff between power and wirelength, thereby allowing the user to optimize power with a controlled degradation in wirelength. The generated solution remains free of overflow in routing resource usage. We experiment with large benchmarks from the ISPD 2008 suite and a 45nm technology model. We show on average 19.9% dynamic power saving with at most 3% wirelength degradation using the existing wirelength optimized solutions from the open literature.

    References

    [1]
    ISPD 2008 {online}http://www.sigda.org/ispd2008/contests/ispd08rc.html.
    [2]
    Nangate 45 nm open cell library, {online} http://www.nangate.com 2008.
    [3]
    Y.-J. Chang, et al. NTHU - Route 2.0: A fast and stable global router. In ICCAD, pages 338--343, 2008.
    [4]
    M. Cho, et al. Boxrouter 2.0: architecture and implementation of a hybrid and robust global router. In ICCAD, pages 503--508, 2007.
    [5]
    M. Geilen, et al. An algebra of pareto points. Fundamenta Informaticae, 78(1):35--74, 2007.
    [6]
    N. Magen, et al. Interconnect-power dissipation in a microprocessor. In SLIP, pages 7--13, 2004.
    [7]
    M. Moser, et al. An algorithm for the multidimensional multiple-choice knapsack problem. IEICE Trans. on Fundamentals of Electronics. (E80-A(3)):582--589, 1997.
    [8]
    J. A. Roy and I. L. Markov. High-performance routing at the nanometer scale. In ICCAD, pages 496--502, 2007.
    [9]
    H. Shojaei, et al. A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for cmp run-time management. In DAC, pages 917--922, 2009.
    [10]
    T.-H. Wu, et al. GRIP: Scalable 3D global routing using integer programming. In DAC, pages 320--325, 2009.
    [11]
    Y. Xu, et al. Fastroute 4.0: global router with efficient via minimization. In ASPDAC, pages 576--581, 2009.

    Cited By

    View all
    • (2015)A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack ProblemBio-Inspired Computing -- Theories and Applications10.1007/978-3-662-49014-3_46(513-522)Online publication date: 24-Dec-2015
    • (2013)Power-driven global routing for multisupply voltage domainsVLSI Design10.1155/2013/9054932013(2-2)Online publication date: 1-Jan-2013
    • (2013)A fast and scalable multidimensional multiple-choice knapsack heuristicACM Transactions on Design Automation of Electronic Systems10.1145/2541012.254101418:4(1-32)Online publication date: 25-Oct-2013

    Index Terms

    1. A pareto-algebraic framework for signal power optimization in global routing

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        ISLPED '10: Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
        August 2010
        458 pages
        ISBN:9781450301466
        DOI:10.1145/1840845
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        In-Cooperation

        • IEEE CAS

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 18 August 2010

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. dynamic power
        2. global routing
        3. pareto algebra

        Qualifiers

        • Research-article

        Conference

        ISLPED'10
        Sponsor:

        Acceptance Rates

        Overall Acceptance Rate 398 of 1,159 submissions, 34%

        Upcoming Conference

        ISLPED '24

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)3
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 27 Jul 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2015)A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack ProblemBio-Inspired Computing -- Theories and Applications10.1007/978-3-662-49014-3_46(513-522)Online publication date: 24-Dec-2015
        • (2013)Power-driven global routing for multisupply voltage domainsVLSI Design10.1155/2013/9054932013(2-2)Online publication date: 1-Jan-2013
        • (2013)A fast and scalable multidimensional multiple-choice knapsack heuristicACM Transactions on Design Automation of Electronic Systems10.1145/2541012.254101418:4(1-32)Online publication date: 25-Oct-2013

        View Options

        Get Access

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media