10 results about "Liveness" patented technology

The invention provides a code repair verification, knowledge base construction and active defense method and related device.According to the scheme, a first code is subjected to dependency analysis, and a related code method, a related application program interface and a related data entity which have dependency relations with the first code are obtained from three aspects; according to the method, accurate and comprehensive dependency analysis is realized, the three-dimensional influence matrix is constructed on the basis, the target test case related to the first code can be accurately selected according to the three-dimensional influence matrix to perform code testing, original full-amount testing is replaced with an accurate testing mode, computing resource consumption during testing is effectively reduced, and the testing efficiency is improved. And the verification time is shortened. Meanwhile, by means of an active knowledge packaging mode, the reuse rate of knowledge and the updating speed of the knowledge base can be effectively increased, similar defects can be actively checked when developers submit codes, active defense is achieved, and repeated occurrence of the similar defects is effectively avoided.

This invention provides a method, system, electronic device, and storage medium for live round-robin scheduling of thread blocks, belonging to the field of GPGPU thread scheduling and execution. The method includes: when a thread block's thread bundle encounters a long-delay memory access operation, receiving feedback from the thread bundle scheduler, matching the corresponding thread block entry using the feedback ID number, and decrementing the liveness value by 1. When the liveness value is zero, the thread block is deactivated, and the execution context information of the thread block is stored in shared memory. The shared memory stores data for multiple thread blocks and the round-robin context information for each thread block. Simultaneously, thread blocks with liveness values ​​are selected for activation and sent to the pipeline for scheduling. When the thread block is reactivated, its context information is read from the shared memory for continued execution. By polling and switching live thread blocks, the latency of long-delay instructions is masked, improving the GPGPU's operating efficiency.

The disclosure includes a system and method for detecting liveness including generating a first cue for presentation to a user via a client device, the first cue for inducing a first action when the user is live; receiving sensor data representing a first reaction by the user to the first cue; determining, based on the first reaction, whether the first reaction satisfies a threshold; and determining that the user is live based on a determination that the first reaction satisfies a threshold.

Systems and methods for computing forward and reverse paths and checking the liveness, keep-alive status, or continuity of the forward and reverse paths are provided. A method (90), according to one implementation, includes the step of creating (92) one or more messages related to a computation of a forward path from a head-end node (12, 32) to a tail-end node (14, 34) and a computation of a reverse path from the tail-end node (14, 34) to the head-end node (12, 32). The method (0) also includes the step of adding (94) a data object to the one or more messages, the data object including an intent to check the liveness of the forward path and reverse path.

Various aspects of the subject technology relate to systems, methods, and machine-readable media for enhancing liveness in a blockchain. Various aspects may include running a first consensus protocol. Aspects may also include detecting a liveness attack in the first consensus protocol. Aspects may also include suspending, when the liveness attack is detected, acceptance of new blocks in the first consensus protocol. Aspects may also include broadcasting a preferred block and identifying a highest accepted block in the set of nodes from running the first consensus protocol based on the preferred block. Aspects may also include transitioning from the first consensus protocol to the second consensus protocol and running the second consensus protocol until a consensus value or a new accepted block is decided. Aspects may also include reinstating and resuming running the first consensus protocol based on the new accepted block.

The invention discloses a job node false activity detection method in a batch scheduling scene and a related device, and the method comprises the steps: screening out a target node configured with a false activity detection rule from job nodes of which scheduling operation is triggered, and setting a batch breakpoint submission redundancy time interval in the false activity detection rule, sending a batch program execution result auxiliary query instruction to the batch program corresponding to the target node, obtaining a program execution position timestamp returned by the batch program according to the batch program execution result auxiliary query instruction, and calculating a time interval between the program execution position timestamp and the current time, and when the time interval is greater than the batch breakpoint submission redundant time interval, judging that the target node is in a false active state. According to the method, the real execution state of the batch program is accurately judged by adding the batch breakpoint submission redundancy time interval in the job node and combining a mode of sending the batch program execution result auxiliary query instruction to the batch program, so that the false alarm probability of node false activity detection is effectively reduced.

This invention discloses a global register activity analysis and context switching optimization method for atomic task flows, belonging to the fields of embedded system software optimization, compiler backend technology, and real-time operating system kernel design. The method first transforms the directed acyclic graph describing the task execution logic into a linear execution sequence, and then calculates the active interval (the time span from generation to last use) of each data variable by traversing this sequence. Subsequently, using a zero-copy register forwarding algorithm, by detecting data dependencies between adjacent tasks, physical register safety gaps, and interface alignment conditions, the physical registers carrying the data are locked and redundant memory loading instructions are eliminated during the code generation stage. Finally, by calculating the intersection of the set of registers actually modified by the task flow and the set of registers saved by the callers according to the target architecture ABI specification, a minimum context switching set (Cmin) code is dynamically generated, saving only the necessary registers.

According to a method, at a given instance of a cluster of instances of at least one service, at least one monitored instance is selected from the cluster of instances according to a selection criterion such that each instance of the cluster of instances is selected as a monitored instance by at least one other instance of the cluster of instances. The given instance is caused to detect an operational status of the at least one monitored instance. If the operational status indicates that one of the at least one monitored instance is failed, the operational status of the failed monitored instance is provided to a centralized controller for the cluster of instances. Through the solution, the detection of instance liveness can be executed by individual instances symmetrically in a distributed and self-management manner.

Various aspects of the subject technology relate to systems, methods, and machine-readable media for enhancing liveness in a blockchain. Various aspects may include running a first consensus protocol. Aspects may also include detecting a liveness attack in the first consensus protocol. Aspects may also include suspending, when the liveness attack is detected, acceptance of new blocks in the first consensus protocol. Aspects may also include broadcasting a preferred block and identifying a highest accepted block in the set of nodes from running the first consensus protocol based on the preferred block. Aspects may also include transitioning from the first consensus protocol to the second consensus protocol and running the second consensus protocol until a consensus value or a new accepted block is decided. Aspects may also include reinstating and resuming running the first consensus protocol based on the new accepted block.

A liveness monitoring architecture to deterministically ascertain the functional status of nodes in a high-availability (HA) environment to more efficiently recover from a split-brain condition is disclosed.