CN114691375A - Integrated circuit resistance extraction method based on parallel algorithm - Google Patents

Integrated circuit resistance extraction method based on parallel algorithm Download PDF

Info

Publication number
CN114691375A
CN114691375A CN202210618093.9A CN202210618093A CN114691375A CN 114691375 A CN114691375 A CN 114691375A CN 202210618093 A CN202210618093 A CN 202210618093A CN 114691375 A CN114691375 A CN 114691375A
Authority
CN
China
Prior art keywords
conductor
nodes
conductors
thread
resistance
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202210618093.9A
Other languages
Chinese (zh)
Other versions
CN114691375B (en
Inventor
马胜军
孙玕
孙延辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qingdao Zhencheng Technology Co ltd
Original Assignee
Qingdao Zhencheng Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qingdao Zhencheng Technology Co ltd filed Critical Qingdao Zhencheng Technology Co ltd
Priority to CN202210618093.9A priority Critical patent/CN114691375B/en
Publication of CN114691375A publication Critical patent/CN114691375A/en
Application granted granted Critical
Publication of CN114691375B publication Critical patent/CN114691375B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5038Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5011Pool
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5018Thread allocation

Abstract

The invention relates to a thread processing method in the field of integrated circuits, in particular to an integrated circuit resistance extraction method based on a parallel algorithm, which comprises the following steps; reading layout information, and storing all conductors in corresponding units according to the coordinates of the conductors or the via holes and the layers to which the conductors or the via holes belong; firstly, establishing a thread pool, and establishing a task adding thread pool for each conductor layer of each unit; then, starting threads according to the thread number configured by the user, and performing the following operations on each thread: step two, taking out a task from the thread pool; traversing all conductors in the task, and creating nodes at the positions contacted with other conductors or via holes; step two, the created nodes and the conductors or the through holes corresponding to the nodes are returned to the main process; and step three, all threads run to the end, all nodes are stored in the conductor, and repeated nodes are deleted.

Description

Integrated circuit resistance extraction method based on parallel algorithm
Technical Field
The invention relates to a thread processing method in the field of integrated circuits, in particular to an integrated circuit resistance extraction method based on a parallel algorithm.
Background
In the process of extracting the resistance of the integrated circuit, the connection relation of the circuit needs to be found, and then the resistance is calculated according to the resistivity. This part is time consuming as the circuit scale increases, so that large scale circuits use multiple processes or multiple threads. The existing tools are made in several ways: the first approach is to divide the circuit into several units, each using a process or thread. This method requires that conductors across the cell boundary be cut and finally connected at the boundary. This approach is difficult to handle in some cases. Such as the case of fig. 2. The conductor 2 is cut into 4 parts and finally the connection of the resistors is cumbersome and inaccurate. The second approach is to use one thread per layer. This method does not suffer from the problem of method one, but the number of threads is limited. Such as: if a circuit has 12 metal layers (M1-M12), this method can be handled with a maximum of 12 threads. This approach is not applicable if the circuit is very large, requiring more threads.
Disclosure of Invention
The invention provides an integrated circuit resistance extraction method based on a multithreading parallel algorithm.
In order to solve the problems, the technical scheme adopted by the invention is as follows:
an integrated circuit resistance extraction method based on a parallel algorithm is characterized in that: comprises the following steps;
reading layout information, and storing all conductors in corresponding units according to the coordinates of the conductors or the via holes and the layers to which the conductors or the via holes belong; if the boundary crossed by the conductor appears in different other cells, a pointer to the conductor is maintained in each cell.
The layout information format generally includes LEFDEF or Calibre Connectivity Interface (CCI), the CCI Interface is preferably used in the present application, and the layout information is in GDS format. The information in the layout comprises conductors on all conductor layers of the layout and via holes on all via hole layers;
firstly, establishing a thread pool, and establishing a task adding thread pool for each conductor layer of each unit; then, starting threads according to the thread number configured by the user, and performing the following operations on each thread:
step two, taking out a task from the thread pool, and taking out the task according to a storage sequence for convenience;
traversing all conductors in the task, and creating nodes at the positions contacted with other conductors or via holes, wherein the nodes comprise information of layer number and coordinates;
step two, the created nodes and the conductors or the through holes corresponding to the nodes are returned to the main process;
because a conductor may operate in different threads, if the created node is directly stored in the conductor, different threads may modify the condition of a conductor at the same time, and in order to avoid the condition, after all sub-threads are finished, the node is written into the conductor, see step three;
step three, after the thread pool is empty, all threads finish running, all nodes are stored in the conductors, each conductor is a class object, a list variable is stored in the members of the class to store all the nodes of the conductor, and repeated nodes are deleted;
step four, firstly, generating a task for each unit, each conductor layer and each via hole layer, and putting the task into a thread pool; then, starting a thread to calculate the resistance according to the configured thread number;
and step five, outputting the calculated resistance between the nodes after all the threads finish running.
As a further improvement, in step two, first, each conductor in the current cell is checked, if the conductor has contact with other conductors in the current cell, a node is created, and the coordinates of the node are the midpoint position of the contact;
then, each conductor in the current cell is examined and if the conductor has contact with a via in the current cell, a node is created whose coordinates are the midpoint of the overlap of the conductor and the via.
As a further improvement, in step four, for each thread, first, one task is taken out from the thread pool; then, traversing all conductors or via holes of the layer of the unit, and calculating the resistance between every two connected nodes according to the positions of the nodes, the resistivity RHO provided by a factory, the square resistance RPSQ or the unit via hole resistance RPV;
conductor resistance formula: r = RHO L/W/T, square resistance R = RPSQ L/W; wherein, L: distance between nodes, W: the width of the conductor between the nodes and the thickness of the T conductor;
the via resistance formula: r = RPV/a; wherein, A: area of the via.
As a further improvement, in step one, a storage method is performed;
firstly, the whole circuit is cut into a plurality of units, and all conductors are stored in the corresponding units according to coordinates (x, y); if the boundary crossed by the conductor appears in different other cells, a pointer to the conductor is maintained in each cell.
As a further improvement, in steps one, two and four, first, based on the storage method of S1, each conductor layer inside each cell is run with one thread, each thread operates all conductors on one conductor layer inside one cell, thread = cell × number of conductor layers, and by traversing all conductors, a node is created at the contact point of each conductor with other conductors inside the current cell; then, searching a contact point with a via hole in the same unit; after all the nodes are established, each conductor calculates the resistance according to the positions and the resistivity of the nodes; generating a resistance network; the resistance network connects the pins P1, P2 and P3 through nodes and resistors;
when the same conductor creates nodes in different units or different threads, the nodes created by each thread are stored, and after all threads are finished, the nodes are respectively stored in the conductor.
The invention provides a more flexible multithreading method, which can greatly improve the running speed. Nor do they pose any accuracy problems. For the difficulty of the prior art, another solution is provided: when each two conductors are examined, they are seen whether they are also stored in other units. If another unit also holds them, it does it only inside one of them. Therefore, the situation of repeatedly creating nodes is avoided, and the repeated nodes are not required to be deleted in the main process. But additional time is spent because each two conductors are checked for being stored in other cells.
When a program is started, a main process is provided, then a plurality of threads are started according to the setting of a user, and after each thread finishes a task, a result is transmitted to the main process through communication between a sub-thread and the main process, which is a conventional method of multi-thread communication.
Drawings
FIG. 1 is a schematic view of the process of the present invention.
Fig. 2 is a schematic diagram of the prior art structure of the present invention.
Fig. 3 is a schematic diagram of a modified structure of the present invention.
Detailed Description
The invention adopts a new method to quickly find out the connection relation of the circuit and calculate the resistance. The method and the device can avoid the accuracy problem caused by splitting the conductor and can perform parallel calculation more finely.
S1, executing the storing method;
firstly, the whole circuit is cut into a plurality of units, and all conductors are stored in the corresponding units according to coordinates (x, y); then, if the boundary crossed by the conductor appears in different other units, a pointer of the conductor is stored in each unit;
such as the example of fig. 3: t1, V1 would exist inside cell (0, 0), T2 would exist inside two cells (0, 0) and (0, 1), and T9 would exist inside 4 cells (1, 1), (1, 2), (2, 1), (2, 2).
S2, executing a parallel algorithm;
first, based on the storage method of S1, each conductor layer in each cell is run with one thread, each thread operates all conductors on one conductor layer in one cell, and thread = cell × number of conductor layers; for example, in the example of FIG. 3, there may be a maximum of 27 threads in the interior, (9 cells, 3-level conductors), first, traversing all conductors and all connected vias; secondly, a node is created at the contact point of each conductor with other conductors in the current cell; thirdly, a contact point with the via hole is searched in the same unit, so that a conductor or the via hole which is contacted with the via hole is prevented from being searched globally, and the searching time can be saved; finally, after all nodes are created, each conductor calculates the resistance from the resistivity according to the position of the node. This creates a resistive network connecting the pins P1, P2, P3 via nodes and resistors.
When the same conductor creates nodes in different units or different threads, the nodes created by each thread are stored and transmitted to a main process (shown in figure 1), and after all the threads are finished, the main process stores the nodes into the conductors respectively; when a duplicate node occurs, removing the duplicate node when the master process saves the node for each conductor;
the above algorithm has two difficulties: (1) the same conductor may create nodes in different units (and also in different threads), such as: the nodes of T9 and T8 are created in cell (1, 1) and the nodes of T9 and T10 are created in cell (0, 2), all of which need to be saved into T9. The upper and lower nodes of VIA are also created in different threads. If a node is created that writes conductors into each thread, this can lead to a situation where different threads modify a memory at the same time. The solution is as follows: storing the nodes created by each thread, and after all threads are finished, respectively storing the nodes into the conductors by the main process; (2) duplicate nodes may occur. Such as: the nodes of T5 and T6 are created at both cells (1, 1) and (2, 1). The solution is as follows: finally, duplicate nodes are removed as the master process saves nodes for each conductor. Since such a situation rarely occurs in the circuit, the influence on the operation time is very small.
According to the above description, the present invention requires the following steps:
reading layout information, and storing all conductors in corresponding units by a main process according to coordinates of conductors and/or via holes and layers to which the conductors and/or via holes belong;
firstly, establishing a task adding thread pool for each conductor layer of each unit by a main process; then, starting threads according to the configured thread number, and performing the following operations on each thread:
step two, taking out a task from the thread pool;
step two, traversing all conductors in the task;
in step two, firstly, checking each other conductor in the current unit, if the conductor is contacted with other conductors in the current unit, creating a node, wherein the coordinate of the node is the midpoint position of the contact place;
then, each conductor in the current unit is checked, if the conductor is in contact with the via hole in the current unit, a node is created, and the coordinate of the node is the middle point of the overlapped part of the conductor and the via hole;
step two, the created nodes and the conductors or the through holes corresponding to the nodes are returned to the main process;
step three, all threads run to the end, the main process stores all nodes in the conductor, and the repeated nodes are deleted;
step four, firstly, the main process generates a task for each unit, each conductor layer and each via hole layer again and puts the task into a thread pool; then, starting a thread according to the configured thread number;
in the fourth step, aiming at each thread, firstly, taking out a task from the thread pool; then, traversing all conductors or via holes of the layer of the unit, and calculating the resistance between every two connected nodes according to the positions of the nodes, the resistivity RHO provided by a factory, the square resistance RPSQ or the unit via hole resistance RPV;
conductor resistance formula: r = RHO L/W/T, and sheet resistance R = RRPSQ L/W. Wherein, L: distance between nodes, W: the width of the conductor between the nodes, and the thickness of the T conductor.
The via resistance formula: r = RPV/a. Wherein, A: area of the via.
And step five, after all the threads are operated, the main process outputs the calculated resistance between the nodes.
The present invention is fully described for clarity of disclosure and is not exhaustive of the prior art.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; it is obvious as a person skilled in the art to combine several aspects of the invention. And such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention. The technical contents not described in detail in the present invention are all known techniques.

Claims (5)

1. An integrated circuit resistance extraction method based on a parallel algorithm is characterized in that: comprises the following steps;
reading layout information, and storing all conductors in corresponding units according to the coordinates of the conductors or the via holes and the layers to which the conductors or the via holes belong;
firstly, establishing a thread pool, and establishing a task adding thread pool for each conductor layer of each unit; then, starting threads according to the thread number configured by the user, and performing the following operations on each thread:
step two, taking out a task from the thread pool;
traversing all conductors in the task, and creating nodes at the positions contacted with other conductors or via holes;
step two, the created nodes and the conductors or the through holes corresponding to the nodes are returned to the main process;
step three, all threads run to the end, all nodes are stored in the conductor, and repeated nodes are deleted;
step four, firstly, generating a task for each unit, each conductor layer and each via hole layer, and putting the task into a thread pool; then, starting a thread to calculate the resistance according to the configured thread number;
and step five, outputting the calculated resistance between the nodes after all the threads finish running.
2. The integrated circuit resistance decimation method based on a parallel algorithm as claimed in claim 1, characterized in that: in the second step, firstly, checking each conductor in the current unit, if the conductor is contacted with other conductors in the current unit, creating a node, wherein the coordinate of the node is the midpoint position of the contact place;
then, each conductor in the current cell is examined and if the conductor has contact with a via in the current cell, a node is created whose coordinates are the midpoint of the overlap of the conductor and the via.
3. The integrated circuit resistance extraction method based on parallel algorithm of claim 1, characterized in that: in the fourth step, aiming at each thread, firstly, taking out a task from the thread pool; then, traversing all conductors or via holes of the layer of the unit, and calculating the resistance between every two connected nodes according to the positions of the nodes, the resistivity RHO provided by a factory, the square resistance RPSQ or the unit via hole resistance RPV;
conductor resistance formula: r = RHO L/W/T, square resistance R = RPSQ L/W; wherein, L: distance between nodes, W: the width of the conductor between the nodes and the thickness of the T conductor;
the via resistance formula: r = RPV/a; wherein, A: area of the via.
4. The integrated circuit resistance extraction method based on parallel algorithm of claim 1, characterized in that: in step one, executing a storage method;
firstly, the whole circuit is cut into a plurality of units, and all conductors are stored in the corresponding units according to coordinates (x, y); if the boundary crossed by the conductor appears in different other cells, a pointer to the conductor is maintained in each cell.
5. The integrated circuit resistance decimation method based on a parallel algorithm as claimed in claim 4, characterized in that: in the first, second and fourth steps, firstly, based on the storage method of S1, each conductor layer in each cell is run with one thread, each thread operates all conductors on one conductor layer in one cell, thread = cell × number of conductor layers, and a node is created at the contact point of each conductor and other conductors in the current cell by traversing all conductors; then, searching a contact point with a via hole in the same unit; after all the nodes are established, each conductor calculates the resistance according to the positions and the resistivity of the nodes; generating a resistance network; the resistance network connects the pins P1, P2 and P3 through nodes and resistors;
when the same conductor creates nodes in different units or different threads, the nodes created by each thread are stored, and after all threads are finished, the nodes are respectively stored in the conductor.
CN202210618093.9A 2022-06-02 2022-06-02 Integrated circuit resistance extraction method based on parallel algorithm Active CN114691375B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210618093.9A CN114691375B (en) 2022-06-02 2022-06-02 Integrated circuit resistance extraction method based on parallel algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210618093.9A CN114691375B (en) 2022-06-02 2022-06-02 Integrated circuit resistance extraction method based on parallel algorithm

Publications (2)

Publication Number Publication Date
CN114691375A true CN114691375A (en) 2022-07-01
CN114691375B CN114691375B (en) 2022-08-26

Family

ID=82131138

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210618093.9A Active CN114691375B (en) 2022-06-02 2022-06-02 Integrated circuit resistance extraction method based on parallel algorithm

Country Status (1)

Country Link
CN (1) CN114691375B (en)

Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6802047B1 (en) * 2002-08-19 2004-10-05 Lsi Logic Corporation Calculating resistance of conductor layer for integrated circuit design
US20040225975A1 (en) * 2003-05-08 2004-11-11 Eddy Pramono IC signal path resistance estimation method
CN101236220A (en) * 2008-03-07 2008-08-06 北京邮电大学 System and method for testing jiggle contact resistance
CN101727172A (en) * 2008-10-27 2010-06-09 联想(北京)有限公司 Method and device for measuring process consumption of computer, and computer system
US7808484B1 (en) * 2007-01-21 2010-10-05 Bezalel Sol Bareli Squeezable computer mouse
WO2010145429A1 (en) * 2009-06-30 2010-12-23 中兴通讯股份有限公司 Method and system for managing thread pool
CN102360310A (en) * 2011-09-28 2012-02-22 中国电子科技集团公司第二十八研究所 Multitask process monitoring method and system in distributed system environment
CN106772678A (en) * 2016-12-16 2017-05-31 安徽理工大学 A kind of wellhole many reference amounts method for surveying of rock deformation destructive characteristics
US9678435B1 (en) * 2014-09-22 2017-06-13 Mentor Graphics, A Siemens Business Horizontal development bias in negative tone development of photoresist
CN109753354A (en) * 2018-11-26 2019-05-14 平安科技(深圳)有限公司 Processing method, device and the computer equipment of Streaming Media task based on multithreading
CN111881641A (en) * 2020-06-08 2020-11-03 北京智芯仿真科技有限公司 Multi-process self-adaptive distribution multi-layer VLSI field coupling method
CN112257364A (en) * 2020-10-23 2021-01-22 北京大学 Integrated circuit static time sequence analysis method for GPU accelerated calculation
US20210151485A1 (en) * 2019-11-20 2021-05-20 Gigajot Technology, Inc. Scalable-pixel-size image sensor
US11156526B1 (en) * 2018-05-15 2021-10-26 eWellbore, LLC Triaxial leak criterion for optimizing threaded connections in well tubulars
CN113671478A (en) * 2021-07-27 2021-11-19 西安电子科技大学 High-speed maneuvering target identification data processing method based on multi-core CPU
CN114036892A (en) * 2022-01-08 2022-02-11 青岛展诚科技有限公司 Parallel processing method and system for single fine granularity in capacitance extraction by random walk

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6802047B1 (en) * 2002-08-19 2004-10-05 Lsi Logic Corporation Calculating resistance of conductor layer for integrated circuit design
US20040225975A1 (en) * 2003-05-08 2004-11-11 Eddy Pramono IC signal path resistance estimation method
US7808484B1 (en) * 2007-01-21 2010-10-05 Bezalel Sol Bareli Squeezable computer mouse
CN101236220A (en) * 2008-03-07 2008-08-06 北京邮电大学 System and method for testing jiggle contact resistance
CN101727172A (en) * 2008-10-27 2010-06-09 联想(北京)有限公司 Method and device for measuring process consumption of computer, and computer system
WO2010145429A1 (en) * 2009-06-30 2010-12-23 中兴通讯股份有限公司 Method and system for managing thread pool
CN102360310A (en) * 2011-09-28 2012-02-22 中国电子科技集团公司第二十八研究所 Multitask process monitoring method and system in distributed system environment
US9678435B1 (en) * 2014-09-22 2017-06-13 Mentor Graphics, A Siemens Business Horizontal development bias in negative tone development of photoresist
CN106772678A (en) * 2016-12-16 2017-05-31 安徽理工大学 A kind of wellhole many reference amounts method for surveying of rock deformation destructive characteristics
US11156526B1 (en) * 2018-05-15 2021-10-26 eWellbore, LLC Triaxial leak criterion for optimizing threaded connections in well tubulars
CN109753354A (en) * 2018-11-26 2019-05-14 平安科技(深圳)有限公司 Processing method, device and the computer equipment of Streaming Media task based on multithreading
US20210151485A1 (en) * 2019-11-20 2021-05-20 Gigajot Technology, Inc. Scalable-pixel-size image sensor
CN111881641A (en) * 2020-06-08 2020-11-03 北京智芯仿真科技有限公司 Multi-process self-adaptive distribution multi-layer VLSI field coupling method
CN112257364A (en) * 2020-10-23 2021-01-22 北京大学 Integrated circuit static time sequence analysis method for GPU accelerated calculation
CN113671478A (en) * 2021-07-27 2021-11-19 西安电子科技大学 High-speed maneuvering target identification data processing method based on multi-core CPU
CN114036892A (en) * 2022-01-08 2022-02-11 青岛展诚科技有限公司 Parallel processing method and system for single fine granularity in capacitance extraction by random walk

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
EL SHERBINY ET AL: "Efficient method for calculating the grounding resistance of a buried grounding grid in a homogeneous soil", 《1994 PROCEEDINGS OF CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING》 *
KYUNG SIK SEO ET AL: "Characteristics of Electric and Magnetic Circuit Parameters in Thread-Type Magnetic Core System", 《 IEEE TRANSACTIONS ON APPLIED SUPERCONDUCTIVITY ( VOLUME: 26, ISSUE: 4, JUNE 2016)》 *
刘毅等: "应用于实时控制系统的线程池调度策略设计", 《计算机工程与应用》 *
夏振新: "基于嵌入式ARM和Linux的电阻点焊监控器的研制", 《中国知网优秀硕士论文全文数据库,工程科技I辑》 *

Also Published As

Publication number Publication date
CN114691375B (en) 2022-08-26

Similar Documents

Publication Publication Date Title
CN110334390B (en) Method and device for identifying outer wall in computer-aided design (CAD), storage medium and processor
CN112257365B (en) Method for establishing timing diagram in parallel based on geometric information
CN104572999B (en) Heterogeneous data-based error data detection method and device
CN114691375B (en) Integrated circuit resistance extraction method based on parallel algorithm
CN106407233A (en) A data processing method and apparatus
CN112800716B (en) Method for detecting open circuit of wire net in wiring of integrated circuit layout
CN114564904A (en) FPGA full-path rapid time sequence analysis method and device, computer and storage medium
Ghosh et al. Scalable self-stabilization
CN115328917A (en) Query method, device, equipment and storage medium
CN114004182A (en) Binary decision diagram construction method, equivalence verification method and storage medium
US5568381A (en) Combinatorial optimization system that extracts an undersirable relationship from a present solution
CN112862939A (en) GLTF processing method and device for display optimization, electronic equipment and storage medium
CN112307694A (en) Method and device for comparing difference of circuit schematic diagram
CN114062894A (en) Circuit component detection method, detection device, terminal equipment and storage medium
CN113282616A (en) Incremental time sequence data conflict detection method and device and storage medium
CN110096555B (en) Table matching processing method and device for distributed system
Fourie InductEx
CN112084198A (en) Direct column writing method and device for node admittance matrix in compressed storage form
CN111078671A (en) Method, device, equipment and medium for modifying data table field
CN111062180A (en) FPGA wiring method and device
CN111901178B (en) Risk pre-judging method, device and equipment for network flow direction
CN117634414B (en) Fly line interconnection method between different components, electronic equipment and storage medium
CN115546009B (en) Optimization method, device and equipment of non-maximum suppression algorithm and storage medium
CN116127902B (en) Circuit schematic diagram vertical track distribution system based on bipartite graph matching
CN109885738B (en) Layered electric path search method, power distribution network device, storage medium, and apparatus

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant