A new structural pattern matching algorithm for technology mapping

In this paper, a new structural matching algorithm for technology mapping is proposed. The algorithm is based on a key observation that the matches for a node in a subject Boolean network are related to the matches for its children. The structural relationships between the library cells are modeled...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Design Automation, 2001 Proceedings s. 371 - 376
Hlavní autoři: Zhao, Min, Sapatnekar, Sachin S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 01.01.2001
IEEE
Edice:ACM Conferences
Témata:
Applied computing > Physical sciences and engineering > Electronics
Applied computing > Physical sciences and engineering > Engineering
Computer science
Computer systems organization
Contracts
Hardware
Logic
Mathematics of computing > Discrete mathematics
Network synthesis
Pattern matching
Permission
Software libraries
Table lookup
Theory of computation > Design and analysis of algorithms > Data structures design and analysis > Pattern matching
Tree data structures
ISBN:1581132972, 9781581132977
ISSN:0738-100X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, a new structural matching algorithm for technology mapping is proposed. The algorithm is based on a key observation that the matches for a node in a subject Boolean network are related to the matches for its children. The structural relationships between the library cells are modeled using a lookup table. The proposed method is fast, has low memory usage, and is easy to implement. Experimental results show speedups of 20x over Matsunaga's fast mapping approach, and orders of magnitude over SIS, with the same or slightly better results, and much lower memory utilization.
AbstractList In this paper, a new structural matching algorithm for technology mapping is proposed. The algorithm is based on a key observation that the matches for a node in a subject Boolean network are related to the matches for its children. The structural relationships between the library cells are modeled using a lookup table. The proposed method is fast, has low memory usage, and is easy to implement. Experimental results show speedups of 20x over Matsunaga's fast mapping approach, and orders of magnitude over SIS, with the same or slightly better results, and much lower memory utilization.
In this paper, a new structural matching algorithm for technology mapping is proposed. The algorithm is based on a key observation that the matches for a node in a subject Boolean network are related to the matches for its children. The structural relationships between the library cells are modeled using a lookup table. The proposed method is fast, has low memory usage, and is easy to implement. Experimental results show speedups of 20/spl times/ over Matsunaga's fast mapping approach, and orders of magnitude over SIS, with the same or slightly better results, and much lower memory utilization.
Author Zhao, Min
Sapatnekar, Sachin S.
Author_xml – sequence: 1
  givenname: Min
  surname: Zhao
  fullname: Zhao, Min
  organization: Advanced Tools, Motorola Inc., Austin, TX, Dept. of ECE, University of Minnesota, Minneapolis, MN
– sequence: 2
  givenname: Sachin S.
  surname: Sapatnekar
  fullname: Sapatnekar, Sachin S.
  organization: Advanced Tools, Motorola Inc., Austin, TX, Dept. of ECE, University of Minnesota, Minneapolis, MN
BookMark eNqN0D1PwzAYBGBLFIm2dGRhysREij9iOx5LxZdUiQUkNstOXreBJA6OI9R_T1CQWLnllkc33ALNWt8CQhcErwnJ-A2TOWVqPRan4gQtCM8JYVRJOkNzLFmeEozfztCq79_xGI6FknyObjdJC19JH8NQxCGYOulMjBDapDGxOFTtPjH13ocqHprE-ZBEKA6tr_3-OIquG8E5OnWm7mH120v0en_3sn1Md88PT9vNLjWUZTF1mVXMEgo0N4UCY62VIs9tKXKVOcKNkKVh1orCldQSTJ2gEsCJcqQCLFuiq2m3C_5zgD7qpuoLqGvTgh96zUhGBFFshJcTrABAd6FqTDhqxThn8m_FFI223n_0mmD986GePtTThyO8_hfUNlTg2Dd6WnJi
ContentType Conference Proceeding
Copyright 2001 ACM
Copyright_xml – notice: 2001 ACM
DBID 6IE
6IH
CBEJK
RIE
RIO
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1145/378239.378526
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EndPage 376
ExternalDocumentID 935537
Genre orig-research
Conference Paper
GroupedDBID 6IE
6IH
6IK
6IL
AAJGR
AAVQY
AAWTH
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IERZE
LHSKQ
OCL
RIE
RIL
RIO
123
29O
6IF
6IM
6IN
ACGFS
ADZIZ
CHZPO
IEGSK
IJVOP
IPLJI
M43
RNS
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-a234t-f4b93b12e28ac9eabbb7688bd6894f15a67da3bb6cfd2b102f627eef6dabb6eb3
IEDL.DBID RIE
ISBN 1581132972
9781581132977
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000171225800068&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0738-100X
IngestDate Fri Jul 11 05:51:26 EDT 2025
Wed Aug 27 02:15:32 EDT 2025
Wed Jan 31 06:47:05 EST 2024
Wed Jan 08 03:35:50 EST 2025
IsPeerReviewed false
IsScholarly true
Language English
License 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 Permissions@acm.org
LinkModel DirectLink
MeetingName DAC01: 38th ACM/IEEE-CAS/ EDAC Design Automation Conference
MergedId FETCHMERGED-LOGICAL-a234t-f4b93b12e28ac9eabbb7688bd6894f15a67da3bb6cfd2b102f627eef6dabb6eb3
Notes SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
PQID 31416193
PQPubID 23500
PageCount 6
ParticipantIDs proquest_miscellaneous_31416193
acm_books_10_1145_378239_378526
acm_books_10_1145_378239_378526_brief
ieee_primary_935537
PublicationCentury 2000
PublicationDate 2001-01-01
PublicationDateYYYYMMDD 2001-01-01
PublicationDate_xml – month: 01
  year: 2001
  text: 2001-01-01
  day: 01
PublicationDecade 2000
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle Design Automation, 2001 Proceedings
PublicationTitleAbbrev DAC
PublicationYear 2001
Publisher ACM
IEEE
Publisher_xml – name: ACM
– name: IEEE
SSID ssj0000506975
ssj0004161
Score 1.6081917
Snippet In this paper, a new structural matching algorithm for technology mapping is proposed. The algorithm is based on a key observation that the matches for a node...
SourceID proquest
ieee
acm
SourceType Aggregation Database
Publisher
StartPage 371
SubjectTerms Applied computing -- Physical sciences and engineering -- Electronics
Applied computing -- Physical sciences and engineering -- Engineering
Computer science
Computer systems organization
Contracts
Hardware
Logic
Mathematics of computing -- Discrete mathematics
Network synthesis
Pattern matching
Permission
Software libraries
Table lookup
Theory of computation -- Design and analysis of algorithms -- Data structures design and analysis -- Pattern matching
Tree data structures
Title A new structural pattern matching algorithm for technology mapping
URI https://ieeexplore.ieee.org/document/935537
https://www.proquest.com/docview/31416193
WOSCitedRecordID wos000171225800068&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LS8QwEIAHVzzoRV0V12cOeqy2zas5qrh4kMWDyt5C0kx1Qbuyu_r7TdLuKiiIUGgL0wfTSTOTZL4BOHFOFoZlNpFclQnLJU-My2lSSSqMEo7RSPt8vJWDQTEcqruWsx1zYRAxLj7Ds3AY5_LduHwPQ2XngQVOZQc6UsomVWsxnJLyVKhvvN3gt0cCJw300nQYcrp4Ecuqy7xFPc3P5Zy9yfg59T2mNx-_44G30DHla1t35cfPOvZA_fV_vfsGbH9l8pG7RR-1CUtYd2F9XsqBtC27C2vfuIRbcHlBvLdNGrZs4HKQt4jhrIn3b-PiS2JensaT0ez5lXivl8wWA_ReIhAfnrbhoX99f3WTtMUWEpNTNksqZhW1WY55YUqFxlrrI5HCOlEoVmXcCOkMtVaUlcutd0sqkUvESjgvKnxIvgPL9bjGXSCOWVNiypErx0RKjcFCmMIa_wiGadaDY69WHaKIqW4So7luFK8bxffg9A8JbScjrHrQDZrWbw2ZQzdK9veffyntG0uYATE1jt-nmmbBLhTd-_W6fVhtVpiF7QCWvZLxEFbKj9loOjmK9vYJ1vvMmA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3dT9swEMBPgyENXoCOifLph-0xI_Fn_MjQEIhS8cCmvll2fIFKI0Vt4e_HdtKCNKRpUqQk0uVDl3N8Z_t-B_DVe1VaXrhMCV1lnCqRWU9ZVismrZaes0T7_D1Qw2E5GumbjrOdcmEQMS0-w-_xMM3l-0n1FIfKTiILnKkV-Cg4p0WbrLUcUMlFLvUb4m703BODk0V-aT6KWV2iTIXVFe1gT4tztaBvcnHCQp8ZDCjsRCQurNjqoau88tfvOvVB55v_9fZbsPOay0dulr3UNnzApgebi2IOpGvbPdh4Qyb8DD9OSfC3SUuXjWQO8phAnA0JHm5afknsn7vJdDy_fyDB7yXz5RB9kIjMh7sd-HX-8_bsIuvKLWSWMj7Pau40cwVFWtpKo3XOhVikdF6WmteFsFJ5y5yTVe2pC45JLalCrKUPojIE5V9gtZk0uAvEc2crzAUK7bnMmbVYSls6Gx7BMS_6cBzUamIcMTNtarQwreJNq_g-fPuHhHHTMdZ96EVNm8eWzWFaJYf7L76UCc0lzoHYBidPM8OKaBea7b173TF8uri9HpjB5fBqH9bb9WZxO4DVoHA8hLXqeT6eTY-S7b0AqwTP3w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Design+Automation%2C+2001+Proceedings&rft.atitle=A+new+structural+pattern+matching+algorithm+for+technology+mapping&rft.au=Zhao%2C+Min&rft.au=Sapatnekar%2C+Sachin+S&rft.date=2001-01-01&rft.isbn=9781581132977&rft.spage=371&rft.epage=376&rft_id=info:doi/10.1145%2F378239.378526&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0738-100X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0738-100X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0738-100X&client=summon