Incremental compilation for parallel logic verification systems

被引:1
|
作者
Tessier, R [1 ]
Jana, S
机构
[1] Univ Massachusetts, Dept Elect & Comp Engn, Amherst, MA 01003 USA
[2] Intel Corp, Hillsboro, OR 97124 USA
关键词
incremental compilation; incrementa partitioning; incremental routing; logic emulation;
D O I
10.1109/TVLSI.2002.801614
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Although simulation remains an important part of application-specific 'integrated circuit (ASIC) validation, hardware-assisted parallel verification is becoming a larger part of the overall ASIC verification flow. In this paper, we describe and analyze a set of incremental compilation steps that can be directly applied to a range of parallel logic verification hardware, including logic emulators. Important aspects of this work include the formulation and analysis of two incremental design mapping steps: the partitioning of newly added design logic onto multiple logic processors and the communication scheduling of new added design signals between logic processors. To validate our incremental compilation techniques, the. developed mapping heuristics have been integrated into the compilation flow for a field-programmable gate-array-based Ikos VirtuaLogic emulator [1]. The modified compiler has been applied to five large benchmark circuits that have been synthesized from register-transfer level and mapped to the emulator. It is shown that our incremental approach reduces verification compile time for modified designs by up to a factor of five versus complete design recompilation for benchmarks of over 100 000 gates. In most cases, verification run-time following incremental compilation of a modified design matches the performance achieved with complete design recompilation.
引用
收藏
页码:623 / 636
页数:14
相关论文
共 50 条
  • [32] PARALLEL LOGIC SIMULATION OF VLSI SYSTEMS
    BAILEY, ML
    BRINER, JV
    CHAMBERLAIN, RD
    ACM COMPUTING SURVEYS, 1994, 26 (03) : 255 - 294
  • [33] PARALLEL LOGIC PROGRAMMING SYSTEMS ON MULTICOMPUTERS
    TALIA, D
    JOURNAL OF PROGRAMMING LANGUAGES, 1994, 2 (01): : 77 - 87
  • [34] Integrated range comparison for data-parallel compilation systems
    Sun, XH
    Pantano, M
    Fahringer, T
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (05) : 448 - 458
  • [35] EXPERIMENTAL-VERIFICATION OF PARALLEL PROCESSING ON A HYBRID OPTICAL PARALLEL ARRAY LOGIC SYSTEM
    TANIDA, J
    NAKAGAWA, J
    YAGYU, E
    FUKUI, M
    ICHIOKA, Y
    APPLIED OPTICS, 1990, 29 (17): : 2510 - 2521
  • [36] Specification and verification of reactive systems with temporal logic
    Fawzi, MG
    CARI'96 - PROCEEDINGS OF THE 3RD AFRICAN CONFERENCE ON RESEARCH IN COMPUTER SCIENCE, 1996, : 884 - 894
  • [37] Shareable and Inheritable Incremental Compilation in iOOBN
    Samiullah, Md (samiullah@du.ac.bd), 1600, Springer Science and Business Media Deutschland GmbH (14326 LNAI):
  • [38] Lightweight Verification of Separate Compilation
    Kang, Jeehoon
    Kim, Yoonseung
    Hur, Chung-Kil
    Dreyer, Derek
    Vafeiadis, Viktor
    ACM SIGPLAN NOTICES, 2016, 51 (01) : 178 - 190
  • [39] Incremental compilation-to-SAT procedures
    Benedetti, M
    Bernardini, S
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 46 - 58
  • [40] An incremental compilation approach for OpenMP applications
    Giordano, M
    Furnari, MM
    NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 2005, 3779 : 249 - 252