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 条
  • [1] Incremental compilation for logic emulation
    Tessier, R
    TENTH IEEE INTERNATIONAL WORKSHOP ON RAPID SYSTEMS PROTOTYPING, PROCEEDINGS, 1999, : 236 - 241
  • [2] INCREMENTAL RATIO BY PARALLEL LOGIC
    LEVIALDI, S
    ELECTRONICS LETTERS, 1967, 3 (12) : 554 - &
  • [3] DERIVING A COMPILATION METHOD FOR PARALLEL LOGIC LANGUAGES
    KOHDA, Y
    TANAKA, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 315 : 80 - 94
  • [4] Soft component automata: Composition, compilation, logic, and verification
    Kappe, Tobias
    Lion, Benjamin
    Arbab, Farhad
    Talcott, Carolyn
    SCIENCE OF COMPUTER PROGRAMMING, 2019, 183
  • [5] Compilation techniques for parallel systems
    Gupta, R
    Pande, S
    Psarris, K
    Sarkar, V
    PARALLEL COMPUTING, 1999, 25 (13-14) : 1741 - 1783
  • [6] Efficient Temporal Logic Verification by Incremental Abstraction
    Lennartson, Bengt
    Liang, Xudong
    Noori-Hosseini, Mona
    2020 IEEE 16TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2020, : 894 - 899
  • [7] Using Four-Valued Signal Temporal Logic for Incremental Verification of Hybrid Systems
    Lercher, Florian
    Althoff, Matthias
    COMPUTER AIDED VERIFICATION, PT III, CAV 2024, 2024, 14683 : 259 - 281
  • [8] LOGIC VERIFICATION ALGORITHMS AND THEIR PARALLEL IMPLEMENTATION
    TONY, HK
    DEVADAS, S
    WEI, RS
    VINCENTELLI, AS
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1989, 8 (02) : 181 - 189
  • [9] Parallel Lisp compilation for distributed systems
    Feng, MD
    Yuen, CK
    AUSTRALIAN COMPUTER JOURNAL, 1995, 27 (03): : 77 - 91
  • [10] An Incremental Verification Paradigm for Embedded Systems
    Pakala, Hara Gopal Mani
    ADVANCES IN COMPUTING AND DATA SCIENCES, ICACDS 2016, 2017, 721 : 40 - 49