Advertisement

Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation

  • Amir Nahir
  • Yossi Shiloach
  • Avi Ziv
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4383)

Abstract

Multimedia SoCs are characterized by a main controller that directs the activity of several cores, each of which controls a stage in the processing of a media stream. Stimuli generation for such systems can be modeled as a scheduling problem that assigns data items to the processing elements of the system. Our work presents a linear programming (LP) modeling scheme for these scheduling problems. We implemented this modeling scheme as part of SoCVer, a stimuli generator for multimedia SoCs. Experimental results show that this LP-based scheme allows easier modeling and provides better performance than CSP-based engines, which are widely used for stimuli generation.

Keywords

Schedule Problem Mixed Integer Programming Constraint Satisfaction Problem Soft Constraint Stimulus Generation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bergeron, J.: Writing Testbenches: Functional Verification of HDL Models. Kluwer Academic Publishers, Dordrecht (2000)zbMATHGoogle Scholar
  2. 2.
    Wile, B., Goss, J.C., Roesner, W.: Comprehensive Functional Verification – The Complete Industry Cycle. Elsevier, Amsterdam (2005)Google Scholar
  3. 3.
    Bin, E., et al.: Using a constraint satisfaction formulation and solution techniques for random test program generation. IBM Systems Journal 41(3), 386–402 (2002)CrossRefGoogle Scholar
  4. 4.
    Planitkar, S.: Design verification with e. Prentice-Hall, Englewood Cliffs (2003)Google Scholar
  5. 5.
    Haque, F., Michelson, J., Khan, K.: The Art of Verification with Vera. Verification Central (2001)Google Scholar
  6. 6.
    Nahir, A., et al.: Scheduling-based test-case generation for verification of multimedia SoCs. In: Proceedings of the 43rd Design Automation Conference (2006)Google Scholar
  7. 7.
    Hillier, F., Lieberman, G.: Introduction to Operations Research. McGraw-Hill Higher Education, New York (2005)Google Scholar
  8. 8.
    ISO/IEC 13818-1: Generic coding of moving pictures and associated audio information (2000)Google Scholar
  9. 9.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computation, pp. 85–103. Plenum, New York (1972)Google Scholar
  10. 10.
    Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)zbMATHGoogle Scholar
  11. 11.
    Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. Econometrica 28, 497–520 (1960)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Crowder, H., Padberg, M.W.: Solving large-scale symmetric travelling salesman problems to optimality. Management Science 26(5), 495–509 (1980)zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 11(26), 832–843 (1983)CrossRefGoogle Scholar
  14. 14.
    Ladkin, P.B., Maddux, R.D.: On binary constraint problems. Journal of the ACM 41, 435–469 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Vilain, M., Kautz, H.: Constraint propagation algorithms for temporal reasoning. In: Proceedings of the Fourth National Conference on Artificial Intelligence, pp. 377–382 (1986)Google Scholar
  16. 16.
    Emek, R., et al.: X-Gen: A random test-case generator for systems and SoCs. In: IEEE International High Level Design Validation and Test Workshop, pp. 145–150. IEEE Computer Society Press, Los Alamitos (2002)CrossRefGoogle Scholar
  17. 17.
    Adir, A., et al.: Genesys-Pro: Recent advances in test-program generation for functional processor verification. IEEE Design & Test of Computers 26(2), 84–93 (2004)CrossRefGoogle Scholar
  18. 18.
    ILOG: Ilog cplex - high performance software for mathematical programming and optimization, http://www.ilog.fr/products/cplex/index.cfm

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Amir Nahir
    • 1
  • Yossi Shiloach
    • 1
  • Avi Ziv
    • 1
  1. 1.IBM Research Laboratory in HaifaIsrael

Personalised recommendations