skip to main content
10.1145/1123008.1123042acmconferencesArticle/Chapter ViewAbstractPublication PagesispdConference Proceedingsconference-collections
Article

ISPD 2006 Placement Contest: Benchmark Suite and Results

Published:09 April 2006Publication History

ABSTRACT

This talk introduces the new suite of ISPD 2006 placement benchmarks. These circuits are all directly derived from real industrial ASIC designs and represent today's mixed-size physical design constraints in terms of size and complexity. Compared to ISPD 2005 placement benchmarks, ISPD 2006 suite has more movable macros and the wider range of design utilizations. The ISPD 2006 Placement Contest is being held with these new benchmarks. This year, a more sophisticated scoring function will be deployed to measure the quality of placement solutions. The metric function takes into account HPWL (half-perimeter-bounding-box-wirelength), runtime and density target constraints. The purpose of adding runtime to the scoring function is to gently encourage faster placement performance. The purpose of the density target constraint is to encourage more routable placements. Further, this also allows more space for buffering, gate sizing and other synthesis transformations that might happen after the placement. Thus, this year's contest forces the placers to become more realistic than last year's, which focused solely on wirelength minimization. A total ten academic placement tools participated in the contest and the final results will be announced during this talk.

Index Terms

  1. ISPD 2006 Placement Contest: Benchmark Suite and Results

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ISPD '06: Proceedings of the 2006 international symposium on Physical design
          April 2006
          232 pages
          ISBN:1595932992
          DOI:10.1145/1123008

          Copyright © 2006 ACM

          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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 April 2006

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate62of172submissions,36%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader