71 results about "Deadlock" patented technology

The present application relates to a kind of hierarchical concurrent state migration net methods for digital twin virtual debugging, the main principle and structure of mechanism that the method has and main construction process are listed;The method is realized by composite state and subnet mechanism hierarchical abstract management of macroscopic process and microscopic execution details, utilizes global event publishing-response and cross-subnet state dependence mechanism to realize the dynamic linkage and synchronous interlocking between concurrent components, and the mutual exclusion access and release of shared resources are completed in combination with global resource token mechanism.Based on this, visual and verifiable concurrent process model can be generated in virtual debugging environment, and deadlock detection and resource bottleneck analysis are supported, thereby significantly improving the accuracy, reliability and maintainability of complex production unit or software system digital twin virtual debugging.

This application relates to an industrial Ethernet communication method, apparatus, computer device, and storage medium. The method includes: during aperiodic data interaction between the master station and the slave station, if physical frame loss occurs, retransmitting the interaction message to the target slave station where the physical frame loss occurred, and obtaining the cumulative number of times the interaction message is retransmitted; if the cumulative number reaches a preset threshold, obtaining the synchronization manager status of the target slave station; and based on the synchronization manager status, restoring communication between the master station and the target slave station. This method can solve the problem of protocol stack logic deadlock that may exist in current communication mechanisms.

The application discloses a kind of distributed reservation systems and methods for multi-resource cooperation, comprising: transaction manager, at least two resource managers, lock manager, transaction log module and workflow controller;Transaction manager coordinates each resource manager through two-phase commit 2PC protocol, realizes the atomicity execution of cross-node shadow and summary table update;Lock manager adopts read-write lock separation mechanism to resolve concurrent conflict, and handles deadlock problem through timeout detection and active unlocking strategy;Transaction log module is based on prewrite log mechanism Complete record shadow and summary table linkage operation details, provide reliable support for fault recovery and transaction rollback;Workflow controller encapsulates distributed call details, realizes service survival real-time detection and automatic reconnection function.The application has high expansibility, strong consistency, high concurrent adaptation capability and perfect exception fault-tolerant mechanism, and can be widely applied to travel service scene of multi-node deployment.

This application relates to the field of integrated circuit design technology and discloses an on-chip network deadlock prevention method and system based on path reservation and credit backhaul. The core of the method lies in proactively locking virtual channel resources along the entire path via an independent reservation request packet along an adaptive route before data packet transmission. Combined with a "credit backhaul confirmation" mechanism, data packets are only allowed to be injected into the network after the source node receives an confirmation packet, thus transforming resource dependencies into unidirectional credit flow control. Simultaneously, reservation resource management is achieved by setting a distributed reservation state table in each router, and soft reservation and multi-path exploration mechanisms are introduced to improve resource utilization efficiency and path selection flexibility. This scheme fundamentally breaks the conditions for circular waiting, completely avoids deadlock, and eliminates the performance bottleneck of traditional methods when virtual channel resources are limited, achieving high determinism in data transmission, low blocking risk, and high efficiency in resource utilization.

This invention discloses an AI inference resource decoupling scheduling method and system based on a two-dimensional orthogonal state space. User AI service rights are decomposed into storage rights dimension σ and computing power rights dimension φ, constructing an orthogonal state space S=(σ,φ), where σ and φ change independently and have no causal dependency. Four service modes are derived from the state space: full service, read-only memory, temporary session, and guided recovery. State transitions in the computing power rights dimension are triggered by critical conditions of discrete quota counting: the cost r for a single token generation is defined as the lower limit of physical resources required for a single forward propagation of the model decoder. When the remaining quota Q(t) is less than r, the physical system cannot complete the next calculation, and the state will inevitably transition and terminate the computation flow. State switching is achieved through metadata-level atomic operations, and the execution time is independent of the user data scale. This invention clarifies the inevitability of the technical effect through logical deduction, is applicable to software or hardware-software co-implementation, and solves the problems of resource deadlock, switching latency, and service interruption under subscription systems.

The application belongs to the technical field of communication and specifically relates to a kind of sidelink resource scheduling method based on trajectory mask and dynamic priority;Including: UGV continuously monitors the PSCCH message sent by other terminal, when identifying that the sending end is UAV, the SCS and DMRS symbol density are configured;Obtain the future flight trajectory prediction information of UAV and calculate the interference intensity of future trajectory point, screen physical time-frequency resource or configure candidate reserved subchannel;Calculate the dynamic priority of UAV service;According to SCS, DMRS symbol density and the dynamic priority of UAV service, construct discrete state judgment vector, judge the communication mode of UAV according to discrete state judgment vector;UAV issues logistics instruction to UGV according to different communication modes;The application solves the resource scheduling problem under high dynamic, serious shielding and high concurrent access, effectively eliminates resource deadlock with low calculation complexity, and improves communication robustness.

The application relates to the technical field of digital information processing, and discloses a digital information processing system for agent task distribution, which comprises the following modules: a state quantization module, which is used for realizing binary processing on operating parameters according to a benchmark threshold array and generating an ability bitmap vector; a topology construction module, which is used for sequentially stacking the vector to construct a global state bitmap matrix; a constraint conversion module, which is used for compiling task constraints into a demand bitmap vector; an activity screening module, which is used for realizing logical filtering on the matrix by using an activity bit mask to generate a candidate resource bitmap; and a matching distribution module, which is used for calculating a bitwise AND result and issuing an instruction. According to the application, continuous state quantity is mapped to a Boolean logic space, the matching cost is changed from floating-point operation into bit operation which is supported by a processor originally, the computing power deadlock under high-frequency concurrency is eliminated, and it is ensured that the distribution action is completed within a determined clock period.

This application provides a method, apparatus, and device for preventing deadlocks in batch data writing based on primary key ordering. The method involves extracting the primary key and normalizing its type from the set of records to be written to generate a normalized primary key string; performing primary key ordering sorting based on the normalized primary key string to generate a logically ordered record sequence; performing intelligent batch sharding on the logically ordered record sequence to generate sharded record batches; and performing batch data writing based on the sharded record batches according to their ordered arrangement, while also implementing adaptive concurrency adjustment and backoff retries. This scheme, by forcing all concurrent transactions to acquire locks in a completely consistent order, mathematically breaks the circular wait condition that leads to deadlocks, reducing the deadlock rate to an extremely low level and improving data processing throughput and system stability in high-concurrency scenarios.

This application provides a model training fault identification method and electronic device, relating to the field of communication technology, which can improve the efficiency and accuracy of model training deadlock fault identification. The model training uses a processor from at least one server. In this method, first information is obtained from each of multiple processors. For each processor, if N consecutive pieces of first information are consistent, second information is obtained for each processor. If each piece of second information satisfies a preset condition, a deadlock fault is determined to exist during model training. The second information includes at least one indicator for indicating processor performance; N is a positive integer greater than 1; and the first information indicates the communication status of the processor.

This invention discloses a distributed storage management device and computing device for multi-core systems. The distributed storage management device includes a DVM proxy module, a DVM remote sending module, and a DVM remote receiving module, each deployed in each core. The DVM proxy module receives DVM request messages containing invalidation address information submitted by the core node in its core, and uses a distributed broadcast mechanism to send the DVM request messages to the core nodes and IO nodes of its core and other cores, thereby invalidating the invalidation addresses carried in the DVM request messages to achieve a unified memory view. This invention aims to solve the cache consistency problem of invalidating large areas of address space data in multi-core systems, including broadcasting invalidation information of DVM operations, avoiding deadlocks in DVM synchronization operations between multiple cores, and optimizing the excessively long execution latency of DVM operations in multi-core scenarios.

The application relates to the field of power distribution automation digital networks, and discloses a primary and secondary fusion complete ring network box data interaction method and system, which comprises the following steps: calculating a transient mutation variable factor in each sampling window; when the transient mutation variable factor is greater than a mutation variable factor threshold value, switching a long byte message into a short frame segment and multiplexing a transient mutation pre-warning prefix code; a receiving end captures a jump edge of the prefix code, thereby adjusting a shift register addressing step length to realize frame synchronization; when the transient mutation variable factor falls back, a hysteresis count characteristic value is controlled to increase with the sampling window until a standard long byte message structure is restored when a safety window threshold value is reached, the application enables the data interaction to have an active feedforward defense capability, overcomes data frame misplacement and step loss and protocol boundary oscillation under burst pulse group interference, eliminates communication deadlock of a control terminal, and guarantees high-concurrent error-free transmission of key alarm messages.

This application relates to the field of robotics technology and discloses a multi-manipulator cooperative control system, including a spatiotemporal elastic bundle construction module for generating spatiotemporal elastic bundles containing a central trajectory and non-uniform elastic bundles for each manipulator; a continuous cooperative deformation module for guiding bundle deformation through gradients weighted by the elastic modulus to eliminate spatiotemporal interference; a topological deadlock detection module for determining whether the system is trapped in a local optimum; a discrete topology negotiation module for generating and selecting the optimal macroscopic topology scheme, such as temporal rearrangement or spatial detour, when the system is trapped in a deadlock; and a constraint re-injection and reset module for converting the scheme into new constraints to guide subsequent planning. This invention, through a hybrid mechanism combining continuous planning and discrete decision-making, can proactively identify and break through local optima, significantly improving the success rate and globality of planning, while simultaneously considering computational efficiency and task execution accuracy.

Embodiments of the present application provide a synchronization number allocation method and device, a storage medium and a product, relating to the technical field of artificial intelligence chips. The method comprises: for a plurality of synchronization indication information in program code, respectively performing: obtaining an initially set or last time updated pre-allocation number; if the synchronization indication information indicates that M groups of computing cores are respectively synchronized, obtaining a target accumulated result of the pre-allocation number and i-1 preset steps for a synchronization point corresponding to the i-th group of computing cores in the M groups of computing cores, and taking the target accumulated result as the synchronization number of the synchronization point corresponding to the i-th group of computing cores if the target accumulated result is not greater than the upper limit of the synchronization number; and obtaining an updated pre-allocation number by accumulating the pre-allocation number by M preset steps. In this way, different synchronization numbers are configured for a plurality of synchronization points in the program code, ensuring that each synchronization point corresponds to a unique synchronization number and effectively reducing the risk of deadlock, thereby improving the performance of the chip.

The application discloses a high-availability array type USB device management system and method. The system comprises an embedded control surface module, a data surface cascade module and a power surface independent control module; the data surface cascade module comprises a hub controller and a plurality of USB physical ports; the power surface independent control module comprises a load switch for independent power supply of the ports and an analog-to-digital converter for collecting power supply current characteristics; a host computer end is configured with a virtual host controller interface driver; the embedded control surface module obtains characteristic quantity to calculate a deadlock state evaluation factor, controls power supply reset when the evaluation factor is over a threshold value, intercepts a request block, encapsulates a custom topology header and sends the custom topology header to the host computer end to build a virtual topology tree in a kernel. The application can accurately identify a bottom-layer hardware deadlock and apply hard isolation, isolate system device enumeration disorder caused by peripheral reset and ensure that an automatic control instruction has absolute physical certainty.

The present application belongs to the technical field of chip design, and particularly relates to a fetch control method and system based on RISC-V architecture. Through the design of splicing and cutting modules, cross-cache line instruction efficient splicing is realized, fetch bubbles caused by pipeline suspension are effectively avoided, the overhead of cross-block fetching is reduced, and the fetch throughput is improved. Through the age vector-based directional flushing mechanism, the prefetch instruction transactions on the prediction error path are accurately flushed, the pipeline flushing accuracy is improved, and the repeated fetch rate caused by full flushing is reduced. Through the missing queue module, a dedicated reserved entry is configured for the main fetch transaction, the pre-fetch request resource preemption is isolated, the main fetch missing problem under high pre-fetch pressure is alleviated, and the pipeline blocking and deadlock hazards caused by resource competition are avoided.

This invention provides a distributed deadlock detection method, apparatus, and electronic device. The method includes: acquiring the dependencies between transactions in a distributed system; selecting a transaction that is not a starting transaction from among the transactions as the current transaction; starting from the current transaction, traversing transactions according to the dependencies, and determining whether the target path has been traversed in other traversal processes each time a transaction is encountered; if the determination result is yes, returning to select a transaction that is not a starting transaction from among the transactions; otherwise, after recording the target path as having been traversed in a specified traversal process, continuing traversal until the traversal is completed, returning to select a transaction that is not a starting transaction from among the transactions; and if the traversed paths form a loop during the transaction traversal, the loop is determined to be a distributed deadlock. This invention can quickly and effectively detect distributed deadlocks.

The present application relates to the technical field of data calculation and scheduling arrangement in the power industrial control production scene, and discloses a power industrial control calculation workflow DAG deadlock avoidance method based on incremental topology, comprising: modeling the dependency relationship between workflow input and running state information as a multidimensional dependency graph; locating the affected node set according to the multidimensional dependency graph and the change event, and adjusting the node sequence in the affected node set to obtain an incremental topology sequence, and completing the construction of the affected subgraph; performing explicit loop and implicit loop risk detection processing on the affected subgraph, classifying the risk detection results, combining the classification results with the business target to generate a conflict resolution strategy, so as to realize the directed acyclic graph deadlock avoidance; converting the conflict resolution strategy into executable operations to perform change processing on the multidimensional dependency graph, and performing structure and semantic verification on the change result to verify the deadlock avoidance effect of the workflow directed acyclic graph. The present application can improve the continuous operation capability of the workflow.

The application discloses a full-parameter feedback type intelligent heat room layered cooperative control system and method, relates to the technical field of centralized heating pipe network automation control, and comprises a multi-dimensional heterogeneous parameter sensing module, a layered cooperative calculation module, a dynamic decoupling execution module and a soft measurement self-recovery monitoring module. The sensing module collects hydraulic transient and thermal lag data in all directions; the cooperative calculation module constructs a dimensionless 'thermal-hydraulic coupling urgency index' based on heterogeneous data, realizes decoupling calculation of time scale and physical dimension and generates a cooperative regulation instruction; and the execution module executes anti-oscillation clamping regulation of the regulation valve according to the instruction and in combination with a dynamic penalty function. The application breaks the dimensional interference and regulation deadlock in traditional full-parameter control, completely eliminates feedback storm under the layered architecture, and innovatively converts building thermal inertia into a virtual energy storage pool of the pipe network, so that high decoupling of thermal and hydraulic forces and peak load cutting and valley filling without additional hardware are realized.

The application provides a residual neuromorphic processing architecture, which comprises 16 neuromorphic cores and an on-chip network communication, and introduces two mechanisms of double packet time division multiplexing and distributed pipeline synchronization on the basis of a traditional on-chip network router circuit, so that a high-throughput pipeline parallel inference without deadlock can be realized in a 16-core system with a 4*4 grid scale only by adding a small amount of state machine and a multiplexer circuit. The deadlock problem is solved by a double packet time division multiplexing control strategy, so that the MS and the pulse packet are alternately transmitted in time, and the routing deadlock caused by the mixed data flow is fundamentally avoided. The application improves the calculation accuracy, reduces the resource consumption and improves the throughput. Compared with the scheme without adopting the DP-TDM, the application is shortened by 29.37%. The system reaches a high throughput of 817.9K time steps / second, and the comprehensive performance is better than that of the existing scheme.

This invention provides a multi-mode, multi-task scheduling method, system, medium, and device for the fly ash island of a CFB boiler, including: creating tasks for the electrostatic precipitator i-field pump, initializing r i c i z i and w i ; Determine if the pipeline is idle; if idle, calculate the maximum value vector M; Determine if deadlock has occurred; if deadlock has occurred, set N = M; if not deadlocked, set N = N1 + N2; Determine if the system is in hibernation or wake-up mode; set s = 1 for hibernation and s = 0 for wake-up mode; implement interrupt protection and return mechanisms to complete the multi-mode scheduling switch of the silo pump; Calculate the pipeline permit vector P based on the value of s; Determine which electrostatic precipitator i-field silo pump's p i If p = 1, the corresponding electrostatic precipitator i-field pump is granted permission, and the delivery status c of the task of the electrostatic precipitator i-field pump corresponding to p = 1 is... i Setting it to 1 executes the corresponding electrostatic precipitator i-field silo pump task. This invention enables parallel operation of silo pump tasks in any conveying mode, serially occupying pipelines for fly ash conveying, effectively avoiding pipeline blockage caused by simultaneous ash conveying, and extending the effective conveying distance.

The application discloses a module interlocking start control system and method based on a hardware state machine, relates to the technical field of embedded system safe starting and hardware timing control, and comprises the following steps: after the system is powered on, the state machine is in S0, and a 555 timer is triggered to start timing; after the timing is finished, the state machine jumps to S1, B_RST is high, and a B module starts; after the B module completes verification, an A module receives a start signal and a rising edge occurs, the state machine enters S2, and the A module normally operates; if the A module is reset due to a fault, a falling edge of the A module triggers the state machine to return to S0, and the B module is reset accordingly, so that bidirectional reset synchronization is realized. The application realizes interlocking control of starting and resetting between modules through a pure hardware state machine, can accurately control starting timing, effectively avoids logical deadlocks caused by bidirectional dependence, and can reset the B module when the A module fails, so that the safety and reliability of embedded system starting are greatly improved.

This invention belongs to the field of IVCPS and database technology, and discloses an IVCPS cross-domain database collaborative access method based on multi-scale decoupling and atomic encapsulation. The method comprises seven steps: data access and cleaning, multi-scale decoupling, atomic encapsulation, layered database entry, task reconstruction, lock-free extraction and scheduling, and self-healing maintenance. It constructs a vehicle-road-network multi-scale orthogonal decoupling model, encapsulates state vectors into five-tuple atomic components and routes them to edge / regional / central cloud layered databases. Cross-domain requests are decomposed into lock-free snapshot extraction instructions through a reconstruction matrix, and data closure is achieved by combining load scheduling and lifecycle self-healing. This invention eliminates cross-layer coupling redundancy, solves memory backlog and access deadlock problems, reduces business response latency, achieves multi-tenant data isolation and database data consistency, adapts to distributed computing architectures, and significantly improves the robustness, throughput, and real-time performance of the IVCPS cloud control platform, supporting the commercialization of vehicle-road-cloud integration.

The invention relates to the technical field of data processing, in particular to an agricultural equipment sales-oriented full-process business management and analysis system, which comprises a time sequence feature analysis module configured to generate a trend amplification coefficient according to a matching relationship between current time and a preset farming time window, and weight historical sales volume data based on the trend amplification coefficient to obtain a weighted historical sales volume; outputting a dynamic safe water level line; the bimodal arbitration module is configured to compare the current available stock with the dynamic safety water line in real time; a sequence distribution mechanism or a weight filtering mechanism is activated; and the data consistency guarantee module is configured to respond to the allocation of the resource locking authority, generate a temporary token in a memory, and asynchronously trigger data synchronization aiming at the database. According to the method, the problems of resource mismatching and concurrent deadlock under the seasonal pulse demand are solved through the time sequence dynamic water level and bimodal arbitration.

The application provides an industrial collaboration-oriented digital economic resource optimal allocation system and method, relates to the technical field of digital economic resource allocation, adopts three-dimensional tensor operation, fuses real-time supply and demand and pre-calculated industrial multi-dimensional complementary relationship, realizes fine and global quantification of the combined collaborative value of "supply side-demand side-resource type", solves through construction of a binary integer programming model, automatically outputs an optimal matching list maximizing the overall collaborative value, automatically decomposes the matching list into an execution step graph with logical dependence based on a pre-constructed process library, generates a scheduling plan according to historical time consumption fluctuation and sorting, enhances the executability and adaptability of the scheme, finally, verifies the output scheme through model detection, fundamentally ensures that the output scheme has no logical deadlock and meets all timing constraints, and thus delivers a high-quality and reliable resource allocation scheme.

This invention belongs to the field of software encapsulation technology and discloses a visual business function encapsulation method and system for no-code workflow platforms. Through the full-process visualization operation of visual business functions, users only need to drag and drop components and declaratively configure parameters to realize complex business logic orchestration. At the same time, a visual field selector is provided to realize parameter pre-mapping, and the drill-down canvas supports hierarchical logic orchestration. With the addition of logic conflict detection and intelligent component recommendation functions, it can automatically identify and prompt logical problems such as loop deadlock. It can also recommend suitable components based on IO contracts and historical data, which lowers the usage threshold for no-code users. At the same time, it adopts a compilation mode that combines pre-compilation and incremental compilation, and uses a multi-level caching system of local, distributed and disk persistence to reuse native closure functions. Combined with slot ID index access to local variables, it improves data read and write efficiency, and has significant performance advantages in high-frequency call scenarios.

The application discloses a Petri-Net-GCN-based intelligent manufacturing system deadlock prediction method, which comprises the following steps: dividing an intelligent manufacturing system into a production equipment module, a production process module and a production resource module; performing formal modeling on the modules based on a Petri net; constructing a Petri-Net-GCN deadlock prediction model, which comprises a place-to-transition message transmission module and a transition-to-place message transmission module; bidirectionally aggregating and updating features between nodes in a Petri net graph by using a graph neural network structure; collecting initial token distribution, a correlation matrix and a deadlock label of the intelligent manufacturing system to construct a data set and input the data set into model training; and predicting a deadlock risk in an unknown system state by using the trained model; and the application can rapidly predict and judge the current state of the intelligent manufacturing system, thereby providing prior warning information for production scheduling and resource allocation.

This application provides a method, system, medium, device, and program product for synchronizing the state of a list component, relating to the field of terminal application technology. The method includes: when listening for scrolling operations, before a child item is marked as visible and added to the dynamic linkage pool, obtaining an offset from the global state manager; registering a component controller to join the linkage pool and receive broadcasts; upon receiving a broadcast, adding a current driver pointer to the child item through the global state manager; and performing scrolling by combining the offset and the driver pointer. This application avoids the problem of inconsistent rendering and data binding timing when a virtual list scrolls at high speed. It accurately marks the event source through the driver pointer, blocking multi-directional event loops without state locks, simplifying state management, avoiding deadlocks, and comprehensively improving the user experience of virtual lists in complex scenarios.

This invention provides a non-intrusive method for locating deadlocks in C programs, comprising the following steps: S1: Modify the Pthreads library used by the C program in the Linux operating system, add a new synchronization and mutual exclusion function, and compile to generate a new Pthreads library; S2: Modify the system header files related to the original synchronization and mutual exclusion function in the Linux operating system, and use macro definitions to make the original synchronization and mutual exclusion function point to the new synchronization and mutual exclusion function; S3: The user uses the original synchronization and mutual exclusion function and the new Pthreads library to jointly write, compile, and run a multi-threaded C program; S4: The deadlock detection program obtains the running data of the multi-threaded C program from the computer's shared memory. If a deadlock occurs in one or more threads, running the deadlock detection program can locate the specific source code file name and line of code of the deadlocked thread. The deadlock location method proposed in this invention can accurately locate the source code file name and line of code in the C program where a deadlock occurs without inserting other code into the user's C code, thus improving the efficiency of users in finding deadlocked programs.

This invention discloses a method, system, computer device, and storage medium for concurrent distribution and scheduling of SIP signaling and multi-level overload protection. The method includes: step S1, constructing a fixed-capacity serialization processor object pool; step S2, implementing session affinity routing based on a concatenated hash algorithm and obtaining hash routing results; step S3, implementing overload protection for the global task processing thread pool and backpressure based on the SIP 503 protocol; and step S4, implementing deep detection of the serialization processor task queue and source rate limiting at the transport layer. This method can eliminate concurrent deadlock at the architectural level, achieve multi-level adaptive overload protection, and perform SIP signaling distribution and scheduling of service traffic.

This application discloses a method for booting a computing device, a device for booting a computing device, a medium, and a program product, relating to the field of storage technology. The method of this application involves a first network driver running boot firmware, which can obtain a boot image through the computing device's network card. A second network driver running the boot image can obtain data received by the network card through an interrupt routine of the second network driver. After triggering the exit routine of the first network driver, if the interrupt routine and the exit routine of the first network driver have the same running priority, the running priority of the exit routine is adjusted, allowing the exit routine to run before the interrupt routine. This prevents the boot image from intercepting response messages returned by the network server to the boot firmware through the interrupt routine and ensures the normal exit of the first network driver, thereby avoiding deadlock problems between the boot engine and the boot firmware, and thus solving the problem of computing device boot freezes caused by deadlock.