Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/1326073.1326126acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
research-article

An incremental learning framework for estimating signal controllability in unit-level verification

Published: 05 November 2007 Publication History

Abstract

Unit-level verification is a critical step to the success of full-chip functional verification for microprocessor designs. In the unit-level verification, a unit is first embedded in a complex software that emulates the behavior of surrounding units, and then a sequence of stimuli is applied to measure the functional coverage. In order to generate such a sequence, designers need to comprehend the relationship between boundaries at the unit under verification and at the inputs to the emulation software. However, figuring out this relationship can be very difficult. Therefore, this paper proposes an incremental learning framework that incorporates an ordered-binary-decision-forest(OBDF) algorithm, to automate estimating the controllability of unit-level signals and to provide full-chip level information for designers to govern these signals. Mathematical analysis shows that the proposed OBDF algorithm has lower model complexity and lower error variance than the previous algorithms. Meanwhile, a commercial microprocessor core is also applied to demonstrate that controllability of input signals on the load/store unit in the microprocessor core can be estimated automatically and information about how to govern these signals can also be extracted successfully.

References

[1]
C. Roth, J. Tyler, P. Jagodik and H. Nguyen "Divide and conquer approach to functional verification of PowerPC microprocessors," Proc. Int'l Workshop on Rapid System Prototyping, pp. 128--133, 1997.
[2]
J. Monaco, D. Holloway and R. Raina, "Functional verification methodology for the PowerPC 604 microprocessor," Proc. Design Automation Conf., pp. 319--324, 1996.
[3]
K. Albin, "Nuts and bolts of core and SoC verification," Proc. Design Automation Conf., pp. 249--252, 2001.
[4]
C. Scafidi, J. D. Gibson, and R. Bhatia, "Validating the Itanium2 Exception Control Unit: A Unit-level Approach," IEEE Design & Test of Computers, pp. 94--101, 2004.
[5]
C. Wen, L.-C. Wang and K.-T. Cheng, "Simulation-based Functional Test Generation for Embedded Processors," IEEE Tran. on Computers, vol. 55, no. 11, pp. 1--9, Nov. 2006.
[6]
C. Wen, O. Guzey, L.-C. Wang and J. Yang, "Simulation-based Functional Test Justification Using a Boolean Data Miner," to appear in IEEE Int'l Conf. on Computer Design, 2006.
[7]
L. Valiant, "A theory of the learnable," Communications of the ACM, vol. 27, no. 11, pp. 1134--1142, 1984.
[8]
M. Kearns, M. Li, L. Pitt and L. Valiant, "On the learnability of Boolean formulae," Proc. 19th Symp. on Theory of Computing, pp. 285--295, 1987.
[9]
D. Angluin, "Queries and concept learning," Machine Learning, vol. 2, no. 4, pp. 319--342, 1987.
[10]
T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning - Date Mining, Inference, and Prediction, Springer, 2001.
[11]
V. N. Vapnik, The nature of statistical learning theory, Springer, 1999.
[12]
A. Krogh, and P. Sollich "Statistical mechanics of ensemble learning," Physical Review, vol. 55, no. 1, pp. 811--816, 1997.
[13]
K. Tumer, and J. Ghosh "Error Correlation and Error Reduction in Ensemble Classifiers," Connection Science, vol. 8, no. 3--4, pp. 385--403, 1996.
[14]
L. Breiman, Random forests. Machine Learning Journal, vol 45, pp. 5--32, 2001.
[15]
Leo Breiman, Jerome H. Friedman, Richard A. Olshen, and Charles J. Stone. Classification and regression trees. Wadsworth Inc., Belmont, California, 1984.
[16]
L. Breiman, Bagging predictors. Machine Learning Journal, vol. 26, no. 2, pp. 123--140, 1996.
[17]
B. Efron, and R. Tibshirani, "The bootstrap method for standard errors and confidence intervals of the adjusted attributable risk," Statistical Science, vol. 1, no. 1, pp. 54--77, 1986.
[18]
I. Kononenko, "On biases in estimating multi-valued attributes," Int'l Joint Conf. on Artificial Intelligence, pp. 1034--1040, 1995.
[19]
R. E. Bryant. Graph-based Algorithms for Boolean Function Manipulation IEEE Tran. Comp, C-35, 8, pp. 677--691, 1986.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '07: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
November 2007
933 pages
ISBN:1424413826
  • General Chair:
  • Georges Gielen

Sponsors

Publisher

IEEE Press

Publication History

Published: 05 November 2007

Check for updates

Qualifiers

  • Research-article

Conference

ICCAD07
Sponsor:

Acceptance Rates

ICCAD '07 Paper Acceptance Rate 139 of 510 submissions, 27%;
Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 106
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

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