Event scheduling method for digital circuit simulator

By dynamically linking non-air conditioning regions in a digital circuit simulator to form a single scheduling chain, the problem of low efficiency of the event scheduler is solved, and efficient event execution is achieved.

CN122389781APending Publication Date: 2026-07-14成都融见软件科技有限公司 +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202610838524.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-06-11
Publication Date
2026-07-14

AI Technical Summary

Technical Problem

In existing technologies, event schedulers are inefficient in digital circuit simulations due to invalid empty queue detection, which becomes a performance bottleneck, especially in scenarios where simulation events are sparse or discretely distributed. Existing optimization schemes cannot completely eliminate invalid detection and may sacrifice simulation functionality.

Method used

By dynamically establishing or updating links between non-air-conditioned regions when a new event is inserted, a single linear scheduling chain is formed, avoiding complex multiple loops and invalid checks, and event execution is performed directly by traversing the scheduling chain through a single loop.

Benefits of technology

It significantly improves event scheduling and execution efficiency, completely avoids invalid detection, and enhances simulation performance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122389781A_ABST
    Figure CN122389781A_ABST
Patent Text Reader

Abstract

The application relates to the technical field of electronic design automation, in particular to an event scheduling method for a digital circuit simulator. The method dynamically establishes or updates the link between non-empty scheduling areas in the form of event nodes when a new event is inserted, organizes all the event nodes to be processed into a single and linear scheduling chain, so that the event execution stage can complete the event scheduling by simply traversing the scheduling chain in a single loop, and the complex multi-nested loop and invalid empty queue detection for determining the next event to be executed in the prior art are completely avoided, thereby significantly improving the efficiency of event scheduling and execution.
Need to check novelty before this filing date? Find Prior Art