Signal searching system

Abstract

The invention relates to the technical field of chip design verification, in particular to a signal searching system, which comprises an application end, M clients, a processor and a memory in which a computer program is stored, and when the computer program is executed by the processor, the following steps are realized: when the application end executes a task of searching a target signal in a database file, M is a positive integer, and M is a positive integer; a search range corresponding to a database file is cut into M sub-ranges, a task and the corresponding sub-range are sent to a client, the client searches a target signal in the database file according to the corresponding sub-range to obtain a search result, the search result is sent to an application end, and the application end displays all the received search results. According to the technical scheme, the signal searching task is executed in a distributed mode through the multiple clients and then is returned to the application side, the searching efficiency is effectively improved, and then the use fluency of the EDA tool is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of chip design verification, and in particular to a signal search system. Background Art

[0002] In the chip design scenario, there will be a large number of X-state signals and Z-state signals that need to be searched in the database file corresponding to the signal. In the prior art, the client is usually used to directly search for the signal in the database file, and then the search result is returned to the EDA tool on the application side in the form of a process or manual input for display.

[0003] However, this method will take up a lot of time and resources for searching, which will reduce the fluency of using other functions of EDA tools. Therefore, how to improve the efficiency of signal search has become an urgent problem to be solved. Summary of the invention

[0004] In view of the above technical problems, the technical solution adopted by the present invention is:

[0005] A signal search system, the system comprising: an application end A, M clients {b1, b2, ..., b m , …, b M}, a processor and a memory storing a computer program, wherein b m is the mth client, m is an integer in the range of [1, M], the memory further stores a database file C, and when the computer program is executed by the processor, the following steps are implemented:

[0006] S101, when A performs the task of searching for the target signal in C, the search range D corresponding to C is cut into M sub-ranges {d1, d2, ..., d m , …, d M}, where d m is the mth sub-range, and the intersection of the M sub-ranges is the same as D.

[0007] S102, the task and d m Send to b m .

[0008] S103, by b m According to d m , search for the target signal in C and obtain the search result e m .

[0009] S104,b m E m Send to A.

[0010] S105, A displays all received search results.

[0011] Compared with the prior art, the present invention has obvious beneficial effects. By means of the above technical solution, a signal search system provided by the present invention can achieve considerable technical advancement and practicality, and has wide industrial utilization value, and has at least the following beneficial effects:

[0012] The present invention provides a signal search system, the system comprising: an application end A, M clients {b1, b2, ..., b m , …, b M}, a processor and a memory storing a computer program, wherein b m is the mth client, m is an integer in the range of [1, M], the memory further stores a database file C, and when the computer program is executed by the processor, the following steps are implemented: when A performs the task of searching for the target signal in C, the search range D corresponding to C is cut into M sub-ranges {d1, d2, ..., d m , …, d M}, where d m is the mth sub-range, the intersection of the M sub-ranges is the same as D, and the task and d m Send to b m , by b m According to d m , search for the target signal in C and obtain the search result e m , b m E m The data is sent to A, and A displays all the search results it receives.

[0013] It can be seen that the signal search task is executed in a distributed manner by multiple clients and then returned to the application end, which effectively speeds up the search efficiency and thus improves the smoothness of using EDA tools. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0015] Figure 1 A schematic diagram of a flow chart of a computer program executed by a processor in a signal search system provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0016] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0017] This embodiment provides a signal search system, which includes: an application end A, M clients {b1, b2, ..., b m , …, b M}, a processor and a memory storing a computer program, wherein b m is the mth client, m is an integer in the range of [1, M], and the memory also stores a database file C, see Figure 1 , is a flow chart of a computer program executed by a processor in a signal search system provided by an embodiment of the present invention. When the computer program is executed by the processor, the following steps are implemented:

[0018] S101, when A performs the task of searching for the target signal in C, the search range D corresponding to C is cut into M sub-ranges {d1, d2, ..., d m , …, d M}, where d m is the mth sub-range, and the intersection of the M sub-ranges is the same as D;

[0019] S102, the task and d m Send to b m ;

[0020] S103, by b m According to d m , search for the target signal in C and obtain the search result e m ;

[0021] S104,b m E m Send to A;

[0022] S105, A displays all received search results.

[0023] Among them, different clients are deployed on different servers and are connected to the main process of the application end A. The database file C can be used to store information of various signals involved in chip design.

[0024] A may include a user interaction interface, which may be used to display the search result of the target signal in C.

[0025] In a specific embodiment, when bm When b is a different terminal from A, m Data is transmitted with A through the network.

[0026] Among them, each client that is a different terminal from A corresponds to a different IP address and is connected to A through the network respectively, so that A can send tasks and sub-ranges to the client, and the client can send search results to A.

[0027] In a specific embodiment, when b m When b is the same terminal as A, m Data is transferred with A through shared memory.

[0028] The application end and the client end may be the same terminal. In this case, the application end and the client end use a shared memory method to transmit data, thereby improving data transmission efficiency.

[0029] In a specific implementation, the database file C includes K reference signals {s1, s2, ..., s k ,…,s K}, where s k is the kth reference signal, and k is an integer in the range of [1, K].

[0030] In a specific implementation manner, the number of reference signals corresponding to a single sub-range is K / M.

[0031] The search range D is evenly divided into M sub-ranges {d1, d2, ..., d m , …, d M}, the number of reference signals corresponding to each sub-range is K / M.

[0032] In a specific embodiment, s k The corresponding number of signal transformations is g k , the number of reference signals corresponding to a single sub-range is f[] is the rounding function.

[0033] Since different reference signals correspond to different signal transformation times, the data volumes corresponding to different reference signals are different. In order to more evenly allocate sub-ranges of search tasks to each client, the number of reference signals corresponding to a single sub-range is set to In this embodiment, in order to ensure that all database files are found, f[] may be a round-up function.

[0034] In one embodiment, the granularity of the cutting can be further improved. Accordingly, multiple continuous sub-ranges are assigned to one client, and the search range D is cut into P×M sub-ranges. Each client is assigned P continuous sub-ranges to search for the target signal. There is an intersection between the P sub-ranges corresponding to any two clients, and P is an integer greater than 1. For example, when P is 2, the first and second sub-ranges are sent as b1, and the second and third sub-ranges are sent as b2, and so on. It can be seen that the range searched by each client has not increased, and the search efficiency has not decreased. At the same time, since the search ranges of different clients are repeated, the search results of each client can verify each other, thereby ensuring the accuracy of the search.

[0035] In a specific implementation, the target signal is an X-state signal.

[0036] In a specific implementation, the target signal is a Z-state signal.

[0037] The target signal may be an X-state signal and / or a Z-state signal.

[0038] In this embodiment, the signal search task is executed in a distributed manner by multiple clients and then returned to the application end, which effectively speeds up the search efficiency and further improves the smoothness of using the EDA tool.

[0039] Although some specific embodiments of the present invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present invention. It will also be appreciated by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present invention. The scope of the present invention is defined by the appended claims.

Claims

1. A signal search system, characterized in that: The system comprises: an application end A, M clients {b1, b2, ..., b m , …, b M }, a processor and a memory storing a computer program, wherein b m is the mth client, m is an integer in the range of [1, M], the memory further stores a database file C, and when the computer program is executed by the processor, the following steps are implemented: S101, when A performs the task of searching for the target signal in C, the search range D corresponding to C is cut into M sub-ranges {d1, d2, ..., d m , …, d M }, where d m is the mth sub-range, and the intersection of the M sub-ranges is the same as D; S102, the task and d m Send to b m ; S103, by b m According to d m , search for the target signal in C and obtain the search result e m ; S104,b m E m Send to A; S105, A displays all received search results.

2. The signal search system according to claim 1, characterized in that: When b m When b is a different terminal from A, m Data is transmitted with A through the network.

3. The signal search system according to claim 1, characterized in that: When b m When b is the same terminal as A, m Data is transferred with A through shared memory.

4. The signal search system according to claim 1, characterized in that: The database file C includes K reference signals {s1, s2, ..., s k ,…,s K }, where s k is the kth reference signal, and k is an integer in the range of [1, K].

5. The signal search system according to claim 4, characterized in that: The number of reference signals corresponding to a single sub-range is K / M.

6. The signal search system according to claim 4, characterized in that: s k The corresponding number of signal transformations is g k , the number of reference signals corresponding to a single sub-range is f[(∑ K k＝1 g k ) / M], f[] is the rounding function.

7. The signal search system according to claim 1, characterized in that: The target signal is an X-state signal.

8. The signal search system according to claim 1, characterized in that: The target signal is a Z-state signal.

Images