371 results about "Deadlock" patented technology

The invention provides a multi-transaction deadlock detection and processing method in resource-constrained equipment, which comprises the following steps of: in a transaction execution process, constructing a resource waiting graph which is used for recording a waiting relationship among transactions so as to reflect the occupation condition of shared resources by the transactions and a dependency relationship among the transactions; before a transaction is subjected to read-write operation each time, whether execution of the current transaction can cause a deadlock risk or not is judged in real time by detecting a dependency relationship between the current transaction and a target resource and combining a resource waiting graph; and when a deadlock risk is detected, deadlock avoidance strategies of priority processing, transaction rollback, transaction retry and exception processing are adopted to avoid deadlock. The deadlock problem occurring in the transaction parallel processing process can be effectively avoided or solved, and meanwhile the response efficiency of the application and the utilization rate of the storage space are guaranteed.

The invention relates to the technical field of constructional engineering informatization management, and discloses a constructional engineering full-period collaborative management and risk prediction system, which comprises a resource token definition module, a resource token generation module, a resource management module and a risk prediction module, and is characterized in that physical elements are mapped into discrete resource tokens configured with unit time delay charge rates; the process transactional modeling module is used for packaging the process into an atomic transaction unit containing a request and a release instruction; the discrete event rehearsal simulation engine executes circulation in the virtual time axis and records the hanging duration; the deadlock detection module monitors the occupancy topology in real time to identify a loop waiting closed loop; according to the dynamic priority arbitration logic, an accumulated lag weight value is calculated according to the product of the rate and the duration, resources are forcibly allocated accordingly to eliminate deadlock, the dynamic arbitration algorithm based on the time value gradient is constructed, the physical lag cost is converted into the calculation weight, and the capacity of the system for automatically converging to the optimal solution under complex constraints is improved.

The invention relates to the technical field of storage, and particularly discloses a solid-state electronic disk soft destruction method, device and system, which are mainly used for solving the systematic vulnerability problems of key metadata single-point failure, power-on deadlock, single recovery strategy, insufficient core component redundancy protection and the like of the existing solid-state electronic disk in an extreme application scene. The method comprises the following steps: monitoring metadata integrity, PCIe links and power-on progress in real time by anomaly perception, and generating an abnormal data packet; the decision arbitration generates an instruction packet according to an abnormal matching recovery strategy; and the execution layer dispatches hardware to complete repairing or clearing operation and feeds back a result. According to the scheme, the deep fault of the solid-state electronic disk can be intelligently sensed, accurately arbitrated and effectively recovered without physical intervention, and the reliability, availability and safety of the solid-state electronic disk are remarkably improved.

The invention provides an optimization method for sharing one group of physical registers by multiple groups of logic registers, which comprises the following steps: S1, defining a shared physical register file, the step comprises a physical register structure link and a quantity constraint link, the physical register structure link comprises N vector physical registers with VLEN bit width, and the quantity constraint link comprises N vector physical registers with VLEN bit width; each vector physical register can be divided into VLEN / FLEN floating point physical registers; in order to solve the problem of hardware redundancy caused by independence of a floating point register and a vector register in an RISC-V architecture, instruction pipeline sharing of floating point and vector expansion is realized through a scheme that multiple groups of logic registers share a physical register, and the hardware redundancy is avoided. And hardware overhead is reduced.

The invention discloses a network-on-chip routing method and device, routing nodes, equipment, a medium and a product, and relates to the technical field of network-on-chip, and the method comprises the steps: firstly, screening the routing nodes through employing the input direction of a message, and limiting the selection range of the next-hop routing node; the relative position of the target routing node relative to the current routing node is determined, the routing nodes are further screened according to the relative position, and candidate routing nodes are determined; and determining a next-hop routing node according to the cache capacity and the input direction of the candidate routing node, and transmitting the message to be transmitted to the next-hop routing node to complete routing. The problem that the routing of the network-on-chip is easy to cause network message blockage or link failure of the network-on-chip can be solved. According to the method, an input direction is adopted to limit a selection range of a next-hop routing node, a relative position is adopted to determine candidate routing nodes, the next-hop routing node is determined in the candidate routing nodes based on cache capacity, and self-adaptive deadlock-free routing is realized.

The invention relates to the technical field of warehouse management, in particular to an intelligent warehouse management system based on deep learning, which constructs a space-time diagram model comprising nodes and edges by combining historical warehouse-in and warehouse-out records, AGV (Automatic Guided Vehicle) tracks and scheduling logs on the basis of spatial distribution information and channel communication relations of warehouse goods locations and function bits. And through deep space-time diagram convolution modeling, outputting a goods allocation value score and a traffic congestion probability, and identifying a goods allocation area which should be preferentially allocated by the high-frequency SKU. And a goods allocation strategy is generated through a reinforcement learning model, and excessive occupation and deadlock of channels are avoided while high-frequency goods are quickly put in and put out of a warehouse. And finally, generating an AGV scheduling instruction set through a path planning algorithm, and issuing and executing the AGV scheduling instruction set. Dynamic collaborative optimization of goods allocation planning and AGV scheduling is realized, the high-frequency goods operation efficiency is improved, meanwhile, path congestion and conflicts are effectively avoided, and the throughput rate and the operation reliability of the system are improved.

The invention discloses an intelligent manufacturing system deadlock prediction method based on Petri-Net-GCN. The method comprises the following steps: dividing an intelligent manufacturing system into a production equipment module, a production process module and a production resource module; carrying out formalized modeling on the module on the basis of a Petri network; a Petri-Net-GCN deadlock prediction model is constructed, and the Petri-Net-GCN deadlock prediction model comprises a house-to-house transition message transmission module and a transition-to-house message transmission module; performing bidirectional aggregation updating on features among nodes in the Petri net graph by using a graph neural network structure; collecting initial Tokenn distribution, an incidence matrix and a deadlock label of the intelligent manufacturing system to construct a data set, and inputting the data set into a model for training; predicting a deadlock risk in an unknown system state by using the trained model; according to the method, rapid prediction and judgment are carried out in the current state of the intelligent manufacturing system, and prior early warning information is provided for production scheduling and resource configuration.

The invention discloses a warehouse logistics resource optimization scheduling system and method based on cloud computing, and relates to the technical field of resource scheduling. Comprising the following steps: segmenting time resources by logistics equipment to generate a space-time resource matrix, and mapping each time slice into a non-homogenized token; an enterprise submits an equipment use demand, participates in auction of non-homogeneous tokens in an idle period through an intelligent contract, and the enterprise who wins the bid unlocks the equipment use right in the corresponding period; taking an auction result as a constraint condition, and performing analysis in combination with deep reinforcement learning to obtain an intelligent scheduling action; and performing statistics according to the intelligent scheduling action, calculating the allocated cost of the enterprise by adopting a Shapley value algorithm, and summarizing to obtain an enterprise cost allocation report. According to the method, the deadlock problem of a traditional A * algorithm in a high-density storage scene is overcome, the multi-AGV cooperation efficiency is remarkably improved, the storage logistics operation cost is reduced, and fine management and dynamic optimization configuration of resources are achieved.

The invention relates to a modeling and formalized verification method for cache consistency protocol verification, and the method comprises the steps: building a protocol model which comprises a plurality of processor nodes, directory nodes and a communication mechanism through a structured modeling mode, and constructing an asynchronous message mechanism to simulate disordered concurrent communication; protocol behavior rules such as processor requests, directory responses and network receiving are defined, protocol property invariants are set, semantic constraints such as data consistency, confirmation before writing and sharing state legality are covered, model verification is carried out in a state space traversal mode, breadth-first search and a symmetry recognition mechanism are supported, and the method is suitable for the protocol behavior rules. A protocol error or deadlock state is effectively found, a traceable error path is generated, a verifier can automatically generate source codes through a compiler and operate on a host platform, and rapid verification and result output of a protocol model are achieved. The method has good protocol adaptability and model reusability, and is suitable for formalized verification of various cache consistency protocols.

The invention discloses a multi-dimensional data asynchronous calculation method and system based on a dynamic dependency graph, and relates to the field of data processing. The method comprises the following steps: constructing a metadata, logic and instance three-layer separation storage model; analyzing the reference relationship to construct a directed acyclic graph, and generating a calculation priority; monitoring data change, and executing asynchronous serialization calculation through a message queue based on priority; the associated document is automatically updated based on anchor mapping. According to the method, the calculation deadlock and the performance bottleneck of large-scale data in the Web environment are solved, logic decoupling and dynamic expansion are realized, the final consistency of the data is guaranteed, and the high-concurrency throughput and the stability are remarkably improved.

The invention relates to the technical field of computer networks, in particular to a shortest routing and deadlock avoiding method and device for a double-layer polygon topology, and the method comprises the steps: determining the routing type of the topology; xOR processing is carried out on the mark low bits of the source node and the target node, and a candidate node corresponding to the shortest path of the source node is determined; determining an available state of the anti-deadlock node, if the available state is idle, determining routing bypass information, and sending the routing bypass information to the source node; and determining an available state of the common node, and generating a route selection vector of the candidate node, so that the source node determines a next-hop node according to the route selection vector, sends the data packet to the next-hop node, and takes the next-hop node as a new source node. According to the method provided by the embodiment of the invention, the number of the shortest paths is expanded into all theoretical shortest paths, so that the number of the shortest paths among the nodes in the computer network topology structure is increased, the system transmission efficiency and the data throughput are improved, and meanwhile, deadlock is avoided.

The invention discloses a power grid material vehicle path planning method, and provides a space-time hierarchical modeling and cloud edge collaborative optimization architecture aiming at the problems of dynamic embargo, channel capacity fluctuation, multi-resource conflict, response lag and the like faced by power grid material dispatching in the prior art. By constructing a space-time coupled channel capacity-path planning hierarchical model, multi-commodity network flow pre-calculation and real-time vehicle path dynamic decoupling are carried out, and material distribution is optimized in combination with a space-time double-coding genetic algorithm; a multi-agent deep game decision-making mechanism is designed, channel priorities of different types of materials are dynamically balanced through reinforcement learning, and distributed conflict resolution is achieved; a block chain-based cross-domain scheduling instruction synchronization system is developed, low-delay path re-planning is realized by adopting a differential updating mechanism, and second-level updating of a scheduling scheme under an emergent road condition is supported; the on-chain evidence storage technology is introduced to guarantee instruction integrity and operation tracing, and the scheduling deadlock risk is reduced in combination with a key channel competition early warning model.

The invention discloses a starting method for a pre-starting execution environment, computer equipment and a related product, and relates to the technical field of computers, the method comprises the following steps: when a first network driver triggers a target unloading process due to loading of a second network driver and the first network driver has sent a network release message in the target unloading process, starting the target unloading process; monitoring an overtime event and a network reply message event of the monitoring timer; when the timeout event is monitored and the network reply message event is not monitored, triggering the first network driver to resend the network release message; and when the retransmission times exceed a preset retransmission threshold value, forcibly terminating the target event polling operation, and transferring the network control right from the first network driver to the second network driver, so that the second network driver takes over and continues to execute the starting process based on the own network protocol stack. The technical problem of deadlock in the starting process of the pre-starting execution environment in related technologies is solved, and the technical effect of improving the starting reliability of the pre-starting execution environment is achieved.

The invention relates to the field of knowledge graph data processing, and discloses an indoor space automatic layout and rendering method and system based on a design knowledge graph, and the method comprises the steps: maintaining an entity knowledge graph containing a variation path, and discretizing a continuous geometric space into an environment topological graph; executing node mapping and resource topology handshake verification based on subgraph isomorphism; and responding to the mapping deadlock, triggering recursive topology rewriting along the variation path to reconstruct the query sub-graph, and generating a configuration instruction. According to the method, continuous geometric search is converted into discrete atlas isomorphism and attribute propagation, the high-dimensional space layout calculation complexity is reduced, the deadlock problem under the over-constraint condition is solved by utilizing a recursive variation mechanism, and the configuration efficiency is improved. And the logic leakproofness and engineering compliance of the layout scheme are ensured.

The invention discloses an industrial transfer robot path planning method based on artificial intelligence, relates to the technical field of industrial transfer robot path planning and multi-robot cooperative control, and provides a systematic breakthrough for narrow roadway passage of an industrial transfer robot through deep cooperation of the game theory and federal learning. A robot meeting scene is modeled as a limited action game, and a revenue function is designed in combination with priority weight and security constraint, so that the robot can autonomously generate a forward, yielding or keeping strategy, and bidirectional deadlock is avoided from the source; through a synchronous output mechanism of action probability distribution and a time window, the strategy performability is remarkably improved; the track layer directly generates a synchronization path on the cost graph according to the time window, and motion interruption caused by repeated sampling in a dynamic window method is avoided; even if track deviation or communication abnormity occurs, the rollback strategy can guarantee that the system recovers to be stable immediately, and continuous operation of the production line is maintained.

The invention relates to the technical field of data lines, and particularly discloses a data line system and a data line for intelligently switching data transmission and charging, and the system comprises a dual-core synchronization management module which is used for enabling dual cores to enter an initial detection state through encryption synchronization signaling when equipment is connected; the asynchronous signal processing module is used for generating state judgment parameters through multi-scale sliding window processing and time-frequency domain feature fusion; the consensus decision arbitration module outputs a backtracking trigger signal through dynamic projection transformation and self-adaptive threshold comparison; the state backtracking recovery module is used for generating a retry instruction with a random delay period based on the historical backtracking success rate and the signal quality evaluation; the safety mode control module is used for identifying dominant features by analyzing historical failure records and switching to a safety operation mode; through distributed dual-core cooperative processing and an intelligent fault recovery mechanism, the technical problems of confusion of protocol stacks and deadlock of a state machine in a complex electromagnetic environment are solved, and the anti-interference capability and reliability of the system are improved.

The invention provides a chip, a data transmission method and electronic equipment. The chip comprises a plurality of core particles, each core particle comprises a plurality of functional nodes, the plurality of core particles are interconnected by adopting a grid structure, and the plurality of functional nodes in each core particle are interconnected by adopting a bidirectional annular structure; a first data packet sent from the first core grain to the second core grain is transmitted in the annular structure in the first core grain according to a first direction, and is transmitted to the second core grain through the grid structure according to a dimension sequence routing strategy, and the first data packet is transmitted in the annular structure in the second core grain according to a second direction, the second direction is opposite to the first direction. According to the method and the device, deadlock can be avoided, the implementation complexity is low, and the operation overhead is small.

The invention relates to the technical field of inspection, in particular to an agent inspection task allocation method and device and an inspection system. The agent inspection task allocation method comprises the steps of obtaining an inspection task, performing task splitting on the inspection task to obtain sub-task information of a plurality of sub-tasks, sending the sub-task information to a plurality of second devices, so that the plurality of second devices generate first bidding information for a target sub-task according to the sub-task information, and allocating the first bidding information to the target sub-task according to the first bidding information. And obtaining first bidding information sent by the plurality of second devices, determining a target device from the plurality of second devices according to the first bidding information, and sending a first task execution instruction of the target sub-task to the target device, so that the target device executes the target sub-task according to the first task execution instruction. By splitting the complex inspection task and selecting the most suitable equipment to execute each split sub-task, not only can the task deadlock be avoided, but also the inspection task time delay can be reduced.

The invention discloses a processor, a chip, equipment and an instruction execution method. The processor comprises a shared memory for storing first quantity information, second quantity information, third quantity information and fourth quantity information; the first number information is the total number of threads in the working group, the second number information is the number of threads waiting to be synchronized on the N instruction branches, the third number information is the number of threads not needing to be synchronized, and the fourth number information is the number of finished threads. And the synchronization instruction assembly line is used for calculating the sum of the thread numbers of the second, third and fourth number information, and when the sum of the thread numbers is equal to the total number of the threads, unfinished threads in the working group are triggered to execute an instruction behind the rendezvous point. According to the scheme, under the condition that the sum of the thread numbers is equal to the total thread number, the synchronization instruction assembly line can trigger the threads which are not finished in the working group to continue to execute subsequent instructions, and the problem of task deadlock caused by the fact that part of the threads cannot reach the synchronization point is avoided.

The invention discloses a process data processing method and device based on a workflow engine, and belongs to the technical field of process data processing. Whether branch process change of a gateway node occurs in a target process or not is determined by identifying difference information between new version process definition data and old version process definition data of the target process; if the branch process of the gateway node is changed, acquiring an in-operation process instance of the target process, and if the current active node of the in-operation process instance is located in the branch process of the gateway node, determining the current active node of the in-operation process instance according to the difference information and the type of the gateway node. And executing dynamic self-adaptive migration on a branch process of the gateway node of the running process instance so as to dynamically migrate the running process instance to the new version process definition data. According to the method, the problem of deadlock or inconsistent state caused by migration of the process instance in operation can be avoided, and the continuity of operation of the business process of an enterprise is ensured.

The invention relates to the technical field of fault positioning, and discloses an indoor distribution multi-source data fusion fault positioning system based on reinforcement learning, which comprises a space-time tensor construction module, a federated collaborative detection module, a map reasoning positioning module and a prediction scheduling module, and is characterized in that a multi-source space-time data federated learning framework under privacy protection is constructed; and cross-physical domain dynamic reasoning and resource elastic scheduling of the fault propagation chain are realized. According to the method, through fusion of multi-source spatio-temporal data and federal collaborative learning, fundamental transformation from passive response to active prediction is realized, fault root causes in a complex environment can be accurately identified, and the false alarm rate is significantly reduced; equipment deadlock is effectively avoided by a dynamic resource scheduling mechanism, and the operation and maintenance efficiency is improved; the privacy protection design ensures the safety of cross-domain cooperation, meanwhile, the environmental perception capability enhances the robustness to hidden faults such as electromagnetic interference, and finally, a fault prediction-positioning-scheduling full-process closed loop is constructed.

The invention discloses a management system for an integrated circuit test, and relates to the technical field of integrated circuit test management, and the system comprises a task scheduling module which is used for receiving a plurality of test task requests, and generating a test task scheduling sequence based on the priority parameter of each test task, the current state of a test resource, and a historical execution result; and the resource coordination module is used for acquiring the running states of the plurality of test devices, executing resource allocation operation according to the test task scheduling sequence, and generating a coordination abnormal event if resource conflict or scheduling failure is detected in the execution process. According to the invention, a dependency graph between test equipment and bottom hardware resources is constructed through the resource coordination module, and accurate modeling of a resource mutual exclusion relationship, concurrent capacity and conflict risk is supported, so that resource conflicts are pre-judged before scheduling, and the problems of resource scrambling and deadlock are effectively avoided.

The invention relates to the technical field of electric digital data processing, and discloses a multi-level circulation box quantity distribution scheduling method and system, and the method comprises the steps: extracting a request numerical value in a resource request instruction, comparing the request numerical value with a reference limit, and when the request numerical value exceeds a preset triggering proportion, executing the step 1; splitting the resource request instruction into an activated detection sub-instruction and a frozen main body sub-instruction; issuing a detection sub-instruction and receiving a processing state updating signal fed back by the target node; calculating a state circulation rate of the detection sub-instruction, and when the state circulation rate is higher than a preset circulation rate threshold value, unfreezing the main body sub-instruction and triggering an issuing operation; according to the invention, through an active interaction mechanism of data instruction fragmentation and sequential logic gating, prediction of an uncertain demand is converted into determinacy verification of instant physical feedback; the problems of system resource locking and scheduling deadlock caused by input data distortion in a distributed network are solved.

The invention relates to a deadlock-free core grain routing architecture construction method and device and a processor, and the method comprises the following steps: constructing a multi-data flow network structure in a core grain: constructing an internal subnet which is used for transmitting data in the core grain, does not interact with the outside of the core grain, and comprises at least one routing node and a function module capable of receiving and transmitting data; an outbound subnet is constructed, is used for data transmission in the direction away from the core particles, and comprises at least one routing node, a data transceiving function module and a boundary router; constructing an inbound subnet which is used for data transmission in a core particle direction and comprises at least one routing node, a data transceiving function module and a boundary router; a transmission subnet is constructed, is used for data transmission of which the starting point and the terminal point are other core particles, and comprises at least one routing node, a transmission module and a boundary router; and preventing data transmission from deadlock in the core particles and / or among the core particles according to the multi-data flow network structure through a core particle interaction protocol.

The invention discloses a control method and system for continuous work of a device and a storage medium. The control method comprises the following steps: receiving a sensor signal, wherein the sensor signal represents the running state of a controlled object; acquiring a preset control logic for controlling the action of the controlled object, wherein the preset control logic comprises a plurality of branch logics for processing sensor signals; and when the sensor signal meets the preset shielding condition, skipping the branch logic related to the sensor signal in the preset control logic, and continuing to execute the remaining branch logic. According to the method, intelligent screening and decision making are carried out on sensor signals through preset shielding conditions, precise recognition and positioning of invalid or valid signals are completed, and the situation that a traditional system is caught in logic deadlock and process due to waiting or responding to the signals is fundamentally avoided; therefore, the controlled object can still maintain the core operation capability when the local function is lost, and the continuity and stability of the production process are guaranteed.

The invention discloses a multi-robot intelligent collaborative simulation training system based on an augmented reality technology, and relates to the technical field of intelligent warehousing and logistics automation. An AR dynamic obstacle generation technology breaks through static limitation of a traditional simulation scene, sudden interference such as container collapse, temporary forbidding and the like is simulated through a physical engine, and real-time simulation is achieved. A training strategy is directly exposed to a high-simulation risk environment; a topology potential field decision-making mechanism is introduced to quantify course conflicts and distance threats into a repulsive force field in a unified mode, a course Gaussian modulation item accurately filters non-direct collision targets, and the oscillation defect of a traditional potential field method is avoided. According to the path entropy calculation, the conflict probability is analyzed through direction density distribution, gradient adjustment is forcibly activated when the entropy of a narrow channel exceeds a threshold value, the chain reaction of high-density deadlock is restrained from the source, and the group path fluency is guaranteed.

This invention provides a controller rate limiting method, apparatus, device, and product, comprising: acquiring the key value and return signature of a resource to be re-enqueued; wherein the return signature is sent by the tuning process based on the return point of the resource to be re-enqueued in the tuning process, and each return point in the tuning process corresponds to a return signature; determining the re-enqueuing time of the resource to be re-enqueued based on the key value and return signature; and performing a delayed enqueuing operation for the resource to be re-enqueued based on the re-enqueuing time. By acquiring the return point of the resource in the tuning process based on the key value and return signature, determining the re-enqueuing time, and performing a delayed enqueuing operation at the re-enqueuing time, rate limiting is performed when the external preconditions required for updating the state cannot be met during the tuning process, thus avoiding deadlock and solving the problem of idle consumption of computing and network resources in the controller and cluster.

The invention provides a multi-task automatic mutual exclusion lock management middleware which realizes full-automatic lock management through intelligent resource classification, dynamic lock strategy matching and priority sensitive scheduling. The middleware is internally provided with a resource feature analysis algorithm, read-write features of resources such as hardware equipment and memory queues can be automatically recognized, and optimal lock mechanisms are allocated to different scenes in combination with a preset lock strategy library; a priority preemptive scheduling algorithm is originally created, high-priority tasks are allowed to break through the limitation of a lock waiting queue, and the real-time task response capability is guaranteed; and meanwhile, an annular deadlock detection module is integrated, and a low-priority lock occupation task is relieved through transaction rollback, so that circular waiting is relieved. A developer only needs to label task priority labels, zero manual lock coding can be achieved, and the lock conflict risk is reduced. The modules cooperate to achieve full-automatic lock management, lock conflict and deadlock risks are remarkably reduced on the premise that lock logic does not need to be coded manually, and the real-time performance and reliability of a multi-task system are remarkably improved.

The invention provides a system behavior simulation and logic verification method and system based on a state machine model. The method comprises the following steps: constructing a state machine model of system behaviors; generating an intermediate representation code embedded with a time constraint check function, wherein the time constraint calculates a state transition time upper limit based on a Lyapunov stability model; compiling the executable code framework; receiving real-time operation data through a human-in-the-loop interface, mapping the real-time operation data into an input event, driving simulation operation, and dynamically rendering a state conversion process by adopting a virtual reality technology; verifying the behavior correctness based on the state coverage and a logic closed-loop index, wherein the logic closed-loop detects a deadlock risk through an improved banker algorithm; and if the verification is not passed, the recent valid state is traced back, the model is adjusted, and the verification is executed again. According to the method, the problems of inaccurate time sequence verification, insufficient real-time interaction, single verification index and the like in a traditional method are solved, and the accuracy and reliability of system simulation are remarkably improved.

The invention provides an AXI bus monitoring system and method, the system comprises a host side monitor, a slave side monitor and an error summarization processing module, and the error summarization processing module is respectively connected with the host side monitor and the slave side monitor; a plurality of register groups are arranged in each monitor, and each register group corresponds to one timer and one state machine and is used for monitoring one read or write transaction; the timer is used for carrying out timeout counting on the read / write transaction, and when the count exceeds a preset value, a timeout error is triggered to be reported to the error summarization processing module; the state machine is used for tracking which stage the read or write transaction is performed in real time; the register block is used for latching an AXI bus signal so that a monitor constructs data to complete access; and the error summarization processing module is used for executing corresponding processing according to the error codes reported by the host side monitor and / or the slave side monitor and the information latched by the register block. The system can effectively avoid system deadlock.