NDLI: Speculative reduction-based scalable redundancy identification

Content Provider	IEEE Xplore Digital Library
Author	Mony, H. Baumgartner, J. Mishchenko, A. Brayton, R.
Copyright Year	2009
Description	Author affiliation: Department of EECS, University of California, Berkeley, USA (Mishchenko, A.; Brayton, R.) \|\| IBM Systems & Technology Group, Austin, TX, USA (Mony, H.; Baumgartner, J.)
Abstract	The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inherent in redundancy identification hinges not only upon the ability to cross-assume those redundancies, but also upon the way in which these assumptions are leveraged. In this paper, we study the technique of speculative reduction for efficiently modeling redundancy assumptions. We provide theoretical and experimental evidence to demonstrate that speculative reduction is fundamental to the scalability of the redundancy identification process under various proof techniques. We also propose several techniques to speed up induction-based redundancy identification. Experiments demonstrate the effectiveness of our techniques in enabling substantially faster redundancy identification, up to six orders of magnitude on large designs.
Starting Page	1674
Ending Page	1679
File Size	122340
Page Count	6
File Format	PDF
ISBN	9781424437818
ISSN	15301591
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-04-20
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	European Design Automation Association (EDAA)
Subject Keyword	Scalability Fasteners Cost accounting Runtime Interpolation Merging Logic
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Speculative reduction-based scalable redundancy identification

Scalable liveness checking via property-preserving transformations

Redundancy reduction in self-organising map merging for scalable data clustering

Optimal redundancy removal without fixedpoint computation

Adaptive Decoder Complexity Reduction for Coarse Granular Scalability

4S: Scalable subspace search scheme overcoming traditional Apriori processing

Runtime Programming through Model-Preserving, Scalable Runtime Patches

Embedding-Based Methods for Trilattice Logic

Scalable defect mapping and configuration of memory-based nanofabrics

Speculative reduction-based scalable redundancy identification

Similar Documents

Speculative reduction-based scalable redundancy identification

Scalable liveness checking via property-preserving transformations

Redundancy reduction in self-organising map merging for scalable data clustering

Optimal redundancy removal without fixedpoint computation

Adaptive Decoder Complexity Reduction for Coarse Granular Scalability

4S: Scalable subspace search scheme overcoming traditional Apriori processing

Runtime Programming through Model-Preserving, Scalable Runtime Patches

Embedding-Based Methods for Trilattice Logic

Scalable defect mapping and configuration of memory-based nanofabrics

Speculative reduction-based scalable redundancy identification