CN117311912B - Data interaction method based on interaction debugging, storage medium and electronic equipment - Google Patents
Data interaction method based on interaction debugging, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN117311912B CN117311912B CN202311621718.8A CN202311621718A CN117311912B CN 117311912 B CN117311912 B CN 117311912B CN 202311621718 A CN202311621718 A CN 202311621718A CN 117311912 B CN117311912 B CN 117311912B
- Authority
- CN
- China
- Prior art keywords
- data
- simulation
- cache
- count
- sig
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 230000003993 interaction Effects 0.000 title claims abstract description 21
- 238000004088 simulation Methods 0.000 claims abstract description 64
- 230000004044 response Effects 0.000 claims abstract description 41
- 230000002452 interceptive effect Effects 0.000 claims abstract description 21
- 230000001960 triggered effect Effects 0.000 claims abstract description 11
- AYFVYJQAPQTCCC-GBXIJSLDSA-N L-threonine Chemical compound C[C@@H](O)[C@H](N)C(O)=O AYFVYJQAPQTCCC-GBXIJSLDSA-N 0.000 claims description 22
- 238000013507 mapping Methods 0.000 claims description 8
- 230000002596 correlated effect Effects 0.000 claims description 6
- 230000000875 corresponding effect Effects 0.000 claims description 6
- 230000014759 maintenance of location Effects 0.000 claims description 4
- 238000004806 packaging method and process Methods 0.000 claims description 3
- 230000008030 elimination Effects 0.000 claims description 2
- 238000003379 elimination reaction Methods 0.000 claims description 2
- 238000012544 monitoring process Methods 0.000 claims description 2
- 238000012795 verification Methods 0.000 abstract description 3
- 230000000903 blocking effect Effects 0.000 abstract 1
- 230000005540 biological transmission Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000013480 data collection Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45504—Abstract machines for programme code execution, e.g. Java virtual machine [JVM], interpreters, emulators
- G06F9/45508—Runtime interpretation or emulation, e g. emulator loops, bytecode interpretation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention relates to the technical field of chip verification, in particular to a data interaction method based on interaction debugging, a storage medium and electronic equipment, wherein a simulation signal sig triggered by user operation is obtained through an interaction debugging interface, and the sig comprises N access requests; inputting sig and callback events into a data request module to generate a target data request module, and adding the target data request module into a signal queue; the callback event is used for triggering the interactive debugging interface to call response data when the response data of the sig is complete; the thread pool monitors a signal queue, and M threads simultaneously and sequentially read M target data request modules from the signal queue; each thread searches and returns response data according to the target data request module, and after callback events collect all the response data, the interaction debugging interface is triggered to call the response data, so that the data response efficiency is improved, and the problem of blocking caused by long waiting time when a large amount of data is acquired in the prior art is solved.
Description
Technical Field
The present invention relates to the field of chip verification technologies, and in particular, to a data interaction method based on interaction debugging, a storage medium, and an electronic device.
Background
In chip verification, after compiling and Simulation are completed, debugging is often required to find out possible potential problems by using a Debug tool, wherein in an Interactive Debug (interactive_debug) scene, the Debug tool needs to interact data with a simulator (simulator) frequently and in a large quantity. At present, a user operation triggers a corresponding task and joins a task queue, a single thread takes the task from the task queue to execute and obtain corresponding data, and the processing method at least has the following defects:
1) When a large amount of data is acquired, the Debug tool is caused to wait for a long time, so that the user operation cannot be responded in time, and the jam occurs.
2) The same data are repeatedly acquired, and unnecessary network IO is occupied.
Disclosure of Invention
Aiming at the technical problems, the invention adopts the following technical scheme:
in a first aspect, an embodiment of the present invention provides a data interaction method based on interaction debugging, where the method includes the following steps:
s100, acquiring simulation signals sig triggered by user operation through an interactive debugging interface, wherein the sig comprises N access requests, and N is more than or equal to 1.
S200, inputting sig and callback events into a data request module to generate a target data request module, and adding the target data request module into a signal queue; and the callback event is used for triggering the interactive debugging interface to call the response data when the response data of the sig is complete.
S300, the thread pool monitors the signal queue, and M threads simultaneously and sequentially read M target data request modules from the signal queue.
S400, each thread searches and returns response data according to the target data request module, and after callback events collect all the response data, the interaction debugging interface is triggered to call the response data; wherein the jth thread thre j Based on the simulation signal sig of the read kth target data request module k The step of searching and returning response data comprises the steps of:
S410，thre j searching a cache according to the sig, wherein the cache stores a plurality of mapping relations composed of simulation signals and simulation data thereof; if thre is obtained j Will thre j Is returned to thre j Is a callback event; otherwise, S420 is performed.
S420, analyzing sig k Obtaining N access requests; and packaging the N access requests according to a preset protocol to obtain a plurality of data packets.
S430, through multiple connections in the poolThe connection sends the data packet to the simulator, acquires the simulation data in the simulator, and returns the simulation data to the thre j Is a callback event of (2).
In a second aspect, embodiments of the present invention also provide a non-transitory computer readable storage medium having stored therein at least one instruction or at least one program, the at least one instruction or the at least one program loaded and executed by a processor to implement the above-described method.
In a third aspect, an embodiment of the present invention further provides an electronic device including a processor and the above-described non-transitory computer-readable storage medium.
The invention has at least the following beneficial effects:
according to the embodiment of the invention, the threads of the interactive debugging interface are separated from the computing threads of the system through the thread pool monitoring signal queue, and the threads of the interactive debugging interface are prevented from being blocked by multithreading parallel execution; meanwhile, the parallelism of task processing can be improved and the response efficiency can be improved through a plurality of parallel connections in the connection pool; the mapping relation of the simulation signals is stored through the cache, so that repeated data acquisition can be avoided, and the network IO overhead is reduced. The efficiency of data response can be greatly improved by combining the thread pool, the connection pool and the cache, the blockage is avoided, the acquisition of repeated data is avoided, and the problem that the waiting time is long and the blockage occurs when a large amount of data is acquired in the prior art is solved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a data interaction method based on interaction debugging according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to fall within the scope of the invention.
Referring to fig. 1, a flowchart of a data interaction method based on interaction debugging is shown, and the method includes the following steps:
s100, acquiring simulation signals sig triggered by user operation through an interactive debugging interface, wherein the sig comprises N access requests, and N is more than or equal to 1.
It should be noted that, the user performs a user operation through the interactive debug interface, for example, a triggered selected signal, a click signal, an expanded signal, a drag signal, and the like. The interactive debugging interface is a graphical user interface (Graphical User Interface, GUI).
Wherein, one simulation signal triggered by the user may correspond to a plurality of access requests.
S200, inputting sig and callback event callb into a data request module to generate a target data request module, and adding the target data request module into a signal queue; and the callb is used for triggering the interactive debugging interface to call the response data when the response data of the sig is complete.
The callback event callb is used for triggering the interactive debugging interface to call response data when the target data request module obtains complete response data.
The data request module is configured to obtain all response data of the simulation signal sig, that is, the response data is a simulation value of each access request in the simulation signal sig. The data request module is also used for triggering the interactive debugging interface to call the response data by the callback event when the response data of the simulation signal sig is complete. As an example, the data request module detects whether the searched signal is the input simulation signal sig, and if so, acquires the data of the simulation signal sig. It should be noted that, the general simulation signal sig and the simulation data are stored in the form of key value pairs in the cache or the memory.
Optionally, the emulation data is data or an address.
The data request module is configured with a return format such as a data type of response data to be returned in advance.
The signal queue is used for storing a target data request module to be processed, and accords with the first-in first-out principle.
S300, the thread pool monitors the signal queue, and M threads simultaneously and sequentially read M target data request modules from the signal queue. The thread pool is an independent thread pool of the interactive debugging interface and is not shared with other processes.
The thread pool comprises M threads, each thread reads a target data request module from the signal queue at the same moment, and when the target data request module finishes execution, the next task is executed.
Wherein each thread in the thread pool can read the target data request module from the signal queue at the same time. The method can realize the simultaneous parallel execution of a plurality of threads, and can prevent the target data request module in the signal queue from being blocked compared with the single-thread processing.
And S400, each thread searches and returns response data according to the target data request module, and after callback events collect all the response data, the interaction debugging interface is triggered to call the response data. Because the callback event is set, the interactive debugging interface is triggered to read response data after the data collection is complete, at this time, the user can operate other simulation signals without waiting for the completion of the data collection and executing other operations after the interactive debugging interface obtains the response data.
Further, the jth thread thre j Based on the simulation signal sig of the read kth target data request module k The step of searching and returning response data comprises the steps of:
S410，thre j searching a cache according to the sig, wherein the cache stores a plurality of mapping relations composed of simulation signals and simulation data thereof; if thre is obtained j Will thre j Is returned to thre j Is a callback event; otherwise, S420 is performed.
Optionally, the mapping relationship is a key value pair formed by the simulation signal and the simulation data.
The simulation data of the simulation signal is read from the buffer memory, so that the reading speed of the simulation data can be greatly improved. In addition, when the simulation data of one simulation signal is stored in the cache, the simulation data does not need to be repeatedly read into the memory again, so that the occupation of the network IO port is reduced.
S420, analyzing sig to obtain N access requests req= { req 1 ,req 2 ,…,req h ,…,req N }，req h For an h-th access request in sig, the value range of h is 1 to N; and packaging the N access requests according to a preset protocol to obtain a plurality of data packets.
If the corresponding mapping relation of the simulation signals does not exist in the buffer memory, the memory is required to be read, and simulation data of the simulation signals of the simulator are acquired from the memory. Therefore, the corresponding access request needs to be packaged into a data packet through a preset protocol for transmission.
Optionally, the preset protocol is a transmission control protocol (transmission Control Protocol, TCP).
S430, sending the data packet to the simulator through a plurality of connections in the connection pool, obtaining simulation data in the simulator, and returning the simulation data in the simulator to the thre j Is a callback event of (2).
Wherein, a plurality of connections are preset in the connection pool.
Optionally, a plurality of connections with the same starting address and destination address are included in the connection pool.
Preferably, when the data packet is detected to obtain the response data, the connection occupied by the data packet which has returned the response data is released.
Preferably, when a connection in the connection pool is not available, the connection is newly established based on the start address and the destination address.
Wherein, the simulation data of the simulator is stored in the memory. And acquiring simulation data of the simulator by reading the memory.
As a oneIn a preferred embodiment, the simulation data in the simulator is returned to thre in S430 j The step of callback events of (2) further comprises:
s432, the simulation data is returned to the thread pool through a connection original path in the connection pool.
S434, the thread in the thread pool adds the simulation data into the cache and returns the simulation data to the thre at the same time j Is a callback event of (2).
The simulation data which are not stored in the cache are added into the cache, so that the mapping relation formed by the simulation signals and the simulation data stored in the cache can be updated timely, the same data are prevented from being read repeatedly from the simulator, and occupation of network IO ports is reduced.
As a preferred embodiment, the step of adding the emulation data to the cache by the threads in the thread pool in S434 further comprises:
s4341, calculating the current reserved value of each cache data in the cache, wherein the P-th cache data cah p The current reserved value of (2) satisfies:
T p =T1 p ×rate+Tn p x (1-rate), and Tn p =count p ×fc。
Wherein T is p Is cah p T1 p Is cah p Last reserved value, rate is reserved value weight, tn p For the cah currently obtained p Initial reserved value, count of (c) p Is cah p Fc is the weight of the hit number.
It should be noted that, as the condition that the retention value needs to be satisfied, the initial retention value of each piece of simulation data in the cache is positively correlated with the hit number, the higher the hit number, the greater the weight of the hit number, and the greater the final retention value. Meanwhile, the last reserved value is positively correlated with the current reserved value, and the reserved value fully reflects the importance of the current data to be continuously stored.
S4342, obtaining the initial reserved value of the simulation data. It should be noted that, when the simulation data is added into the cache, the initial reserved value is a preset value.
S4343, judging whether the cache is full, if not, inserting initial reserved values of the simulation data according to the current reserved values of the cache data; and if the data is full, eliminating the cache data with the minimum current reserved value, and inserting the initial reserved value of the simulation data according to the sequence of the current reserved value of the cache data after elimination.
S4341-S4343 can timely eliminate the cache data with the minimum reserved value, reserve the cache data with more hit times, solve the problem of repeatedly accessing the memory to acquire the same data, and reduce occupied network IO ports.
As a preferred embodiment, the fc is positively correlated with the hit count of the cache data.
As a preferred embodiment, the fc and count satisfy: when count is greater than a preset hit count upper threshold, fc is the maximum value of the weight. When count is 0, fc is 0. When count is greater than 0 and less than the preset hit count upper threshold, fc is positively correlated with count. Preferably, when the count is greater than 0 and less than a preset hit number upper threshold, the count value is divided into Q levels, and the weight of the hit number corresponding to each level is designated, and the Q weights are sequentially increased in order of increasing levels. Optionally, when the count is greater than 0 and less than a preset hit count upper threshold, the count value is divided into Q levels, and the median of each level is a weight.
According to the embodiment of the invention, the thread of the interactive debugging interface is separated from the computing thread of the system by using the independent thread pool, so that the thread of the interactive debugging interface is prevented from being blocked; meanwhile, the parallelism of task processing can be improved through a plurality of parallel connections in the connection pool, and the response efficiency can be improved; the mapping relation of the simulation signals is stored through the cache, so that repeated data acquisition can be avoided, and the network IO overhead is reduced. The efficiency of data response can be greatly improved by combining the thread pool, the connection pool and the cache, the blockage is avoided, the acquisition of repeated data is avoided, and the problem that the waiting time is long and the blockage occurs when a large amount of data is acquired in the prior art is solved.
Embodiments of the present invention also provide a non-transitory computer readable storage medium that may be disposed in an electronic device to store at least one instruction or at least one program for implementing one of the methods embodiments, the at least one instruction or the at least one program being loaded and executed by the processor to implement the methods provided by the embodiments described above.
Embodiments of the present invention also provide an electronic device comprising a processor and the aforementioned non-transitory computer-readable storage medium.
Embodiments of the present invention also provide a computer program product comprising program code for causing an electronic device to carry out the steps of the method according to the various exemplary embodiments of the invention as described in the specification, when said program product is run on the electronic device.
While certain specific embodiments of the 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 invention. Those skilled in the art will also appreciate that many modifications may be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.
Claims (10)
1. The data interaction method based on interaction debugging is characterized by comprising the following steps:
s100, acquiring simulation signals sig triggered by user operation through an interactive debugging interface, wherein the sig comprises N access requests, and N is more than or equal to 1;
s200, inputting sig and callback events into a data request module to generate a target data request module, and adding the target data request module into a signal queue; the callback event is used for triggering the interactive debugging interface to call response data when the response data of the sig is complete;
s300, monitoring a signal queue by a thread pool, and simultaneously and sequentially reading M target data request modules from the signal queue by M threads; the thread pool is an independent thread pool of the interactive debugging interface, and the threads of the interactive debugging interface are separated from the computing threads of the system;
s400, each thread searches and returns response data according to the target data request module, and after callback events collect all the response data, the interaction debugging interface is triggered to call the response data; wherein the jth thread thre j The step of searching and returning response data according to the read simulation signal sig of the kth target data request module comprises the following steps:
S410，thre j searching a cache according to the sig, wherein the cache stores a plurality of mapping relations composed of simulation signals and simulation data thereof; if thre is obtained j Will thre j Is returned to thre j Is a callback event; otherwise, S420 is performed;
s420, analyzing the sig to obtain N access requests; packaging the N access requests according to a preset protocol to obtain a plurality of data packets;
s430, sending the data packet to the simulator through a plurality of connections in the connection pool, obtaining simulation data in the simulator, and returning the simulation data in the simulator to the thre j Is a callback event of (2).
2. The method of claim 1, wherein the simulation data in the simulator is returned to thre in S430 j The step of callback events of (2) further comprises:
s432, returning the simulation data to the thread pool through a connection original path in the connection pool;
s434, the thread in the thread pool adds the simulation data into the cache and returns the simulation data to the thre at the same time j Is a callback event of (2).
3. The method of claim 2, wherein the step of adding the emulation data to the cache by the threads in the thread pool in S434 further comprises:
s4341, calculating the current reserved value of each cache data in the cache, wherein the P-th cache data cah p The current reserved value of (2) satisfies:
T p =T1 p ×rate+Tn p x (1-rate), and Tn p =count p ×fc；
Wherein T is p Is cah p T1 p Is cah p Last reserved value, rate is reserved value weight, tn p For the cah currently obtained p Initial reserved value, count of (c) p Is cah p Fc is the weight of hit number;
s4342, obtaining an initial retention value of the simulation data;
s4343, judging whether the cache is full, if not, inserting initial reserved values of the simulation data according to the current reserved values of the cache data; and if the data is full, eliminating the cache data with the minimum current reserved value, and inserting the initial reserved value of the simulation data according to the sequence of the current reserved value of the cache data after elimination.
4. A method according to claim 3, wherein fc is positively correlated with the number of hits count of the cache data.
5. A method according to claim 3, wherein fc and count satisfy:
when count is greater than a preset hit number upper threshold, fc is the maximum value of the weight;
when count is 0, fc is 0;
when count is greater than 0 and less than the preset hit count upper threshold, fc is positively correlated with count.
6. The method of claim 5, wherein when the count is greater than 0 and less than a preset hit count upper threshold, the count value is divided into Q ranks, and the weight of the hit count corresponding to each rank is assigned, and the Q weights are sequentially incremented in order of increasing ranks.
7. The method of claim 1, wherein the connection pool of S430 includes a plurality of identical connections, the plurality of connections having identical start addresses and identical destination addresses.
8. The method of claim 1, wherein S430 further comprises: and when the data packet is detected to obtain the response data, releasing the connection occupied by the data packet which has returned the response data.
9. A non-transitory computer readable storage medium having stored therein at least one instruction or at least one program, wherein the at least one instruction or the at least one program is loaded and executed by a processor to implement the method of any one of claims 1-8.
10. An electronic device comprising a processor and the non-transitory computer readable storage medium of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311621718.8A CN117311912B (en) | 2023-11-30 | 2023-11-30 | Data interaction method based on interaction debugging, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311621718.8A CN117311912B (en) | 2023-11-30 | 2023-11-30 | Data interaction method based on interaction debugging, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117311912A CN117311912A (en) | 2023-12-29 |
| CN117311912B true CN117311912B (en) | 2024-02-02 |
Family
ID=89260804
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311621718.8A Active CN117311912B (en) | 2023-11-30 | 2023-11-30 | Data interaction method based on interaction debugging, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117311912B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102354298A (en) * | 2011-07-27 | 2012-02-15 | 哈尔滨工业大学 | Software testing automation framework (STAF)-based fault injection automation testing platform and method for high-end fault-tolerant computer |
| CN107943618A (en) * | 2017-11-27 | 2018-04-20 | 北京华如科技股份有限公司 | The data quick recovery method and storage medium of analogue system |
| CN108255585A (en) * | 2016-12-28 | 2018-07-06 | 北京奇虎科技有限公司 | SDK exception controls and application program operation method, device and its equipment |
| CN110852603A (en) * | 2019-11-07 | 2020-02-28 | 武汉极意网络科技有限公司 | High-throughput wind control data processing method, device, equipment and storage medium |
| CN112988356A (en) * | 2021-03-30 | 2021-06-18 | 北京大米科技有限公司 | Asynchronous calling method and device, storage medium and electronic equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020199173A1 (en) * | 2001-01-29 | 2002-12-26 | Matt Bowen | System, method and article of manufacture for a debugger capable of operating across multiple threads and lock domains |
| US10732634B2 (en) * | 2017-07-03 | 2020-08-04 | Baidu Us Llc | Centralized scheduling system using event loop for operating autonomous driving vehicles |
-
2023
- 2023-11-30 CN CN202311621718.8A patent/CN117311912B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102354298A (en) * | 2011-07-27 | 2012-02-15 | 哈尔滨工业大学 | Software testing automation framework (STAF)-based fault injection automation testing platform and method for high-end fault-tolerant computer |
| CN108255585A (en) * | 2016-12-28 | 2018-07-06 | 北京奇虎科技有限公司 | SDK exception controls and application program operation method, device and its equipment |
| CN107943618A (en) * | 2017-11-27 | 2018-04-20 | 北京华如科技股份有限公司 | The data quick recovery method and storage medium of analogue system |
| CN110852603A (en) * | 2019-11-07 | 2020-02-28 | 武汉极意网络科技有限公司 | High-throughput wind control data processing method, device, equipment and storage medium |
| CN112988356A (en) * | 2021-03-30 | 2021-06-18 | 北京大米科技有限公司 | Asynchronous calling method and device, storage medium and electronic equipment |
Non-Patent Citations (2)
| Title |
|---|
| ParallelC-Assist: Productivity Accelerator Suite Based on Dynamic Instrumentation;Nachiketa Chatterjee等;《IEEE Access》;第73599-73612页 * |
| 嵌入式软件虚拟化测试技术标准框架研究;曲明成等;《哈尔滨工业大学学报》;第49-55页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117311912A (en) | 2023-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104601696B (en) | Service processing method, service calling system, device and system | |
| US5960181A (en) | Computer performance modeling system and method | |
| US8868855B2 (en) | Request management system and method for dynamically managing prioritized requests | |
| US8132170B2 (en) | Call stack sampling in a data processing system | |
| EP2701074A1 (en) | Method, device, and system for performing scheduling in multi-processor core system | |
| US10348815B2 (en) | Command process load balancing system | |
| CA3055071C (en) | Writing composite objects to a data store | |
| CN109255057B (en) | Block generation method, device, equipment and storage medium | |
| CN111339078A (en) | Data real-time storage method, data query method, device, equipment and medium | |
| KR20080005523A (en) | Multithreading with concurrency domains | |
| KR20200135718A (en) | Method, apparatus, device and storage medium for managing access request | |
| CN109656895A (en) | Distributed memory system, method for writing data, device and storage medium | |
| CN109379305A (en) | A kind of data distributing method, device, server and storage medium | |
| CN112988185A (en) | Cloud application updating method, device and system, electronic equipment and storage medium | |
| WO2021252043A1 (en) | Running pbs jobs in kubernets | |
| GB2456621A (en) | Queuing cache store requests while read requests are processed until the number of store request reaches a limit or a timeout happens. | |
| CN117311912B (en) | Data interaction method based on interaction debugging, storage medium and electronic equipment | |
| US8423975B1 (en) | System performance simulator | |
| CN105183398B (en) | A kind of storage device, electronic equipment and data processing method | |
| US8918786B2 (en) | Generating simulated stall signals based on access speed model or history of requests independent of actual processing or handling of conflicting requests | |
| CN116382839A (en) | Method and device for detecting state of virtual machine, electronic equipment and storage medium | |
| US9659041B2 (en) | Model for capturing audit trail data with reduced probability of loss of critical data | |
| RU2643622C1 (en) | Computer module | |
| US20200301608A1 (en) | Controller event queues | |
| CN108415779A (en) | Technology for the queue management by main machine structure interface |
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 |