122 results about "Wait state" patented technology

The invention provides a robot task data processing method based on a double-model architecture and a robot, and belongs to the technical field of electric digital data processing. Generating a task sequence corresponding to the first user instruction through the decision-making layer text generation large model, and generating a first action list of each task in the task sequence through the execution layer multi-mode large model. And the ROS main control unit calls an execution unit to execute the first action list so as to complete the current task, obtain task feedback information and update the context information set. The ROS main control unit enters a preset state, when a preset condition is not met, the execution layer multi-mode large model generates a first action list of each task according to the execution layer multi-mode large model, when the preset condition is met, the ROS main control unit enters a waiting state, and after a temporary instruction is obtained, the execution layer multi-mode large model generates a second action list based on the updated context information set and executes the second action list. The defect that modal interference is prone to occurring in the process of processing complex tasks during single AI large model control can be overcome.

The invention provides a sparse approximate inverse Shenwei parallel preprocessing method and system for electromagnetic scattering, and relates to the technical field of processor parallel computing, and the method comprises the steps: carrying out the performance hotspot analysis of a sparse approximate inverse preprocessor in an electromagnetic scattering simulation process, and determining a hotspot function of the sparse approximate inverse preprocessor; extracting a sparse matrix vector multiplication operation of a hotspot function, performing master-slave core parallel calculation on the sparse matrix vector multiplication operation, migrating the sparse matrix vector multiplication operation to slave core calculation, and accelerating hotspot calculation by using a heterogeneous parallel sparse approximate inverse algorithm; parallel computing of master-slave core intensive numerical computing tasks is achieved; in the parallel computing process, the slave cores communicate with the master core in a direct memory access mode, and during the period, the master core is in a waiting state to ensure data consistency and communication synchronization until all the slave cores compute distributed tasks.

The invention discloses a task scheduling method and device, a storage medium and electronic equipment, and the method comprises the steps: in response to a received target task triggered by an interaction operation of a user on a front-end page of a browser, determining whether there is a calculation task which is the same as the target task and is in a waiting state within a set time; if not, the target task is set to be in a waiting state, after the waiting state of the target task is finished, under the condition that it is determined that no calculation task identical to the target task exists in the tasks to be executed, the target task is added to the tasks to be executed, and the tasks to be executed are the calculation tasks executed when the browser thread is idle. Through the method, the target task initiated by the user in real time and the calculation task initiated by the user in the waiting state in history are subjected to first-time duplicate removal, and after the waiting state of the target task is finished, second-time duplicate removal is performed in the to-be-executed task, so that the execution of repeated calculation tasks is reduced through two-time duplicate removal, and the calculation efficiency is improved. And the performance of the browser is improved.

The invention provides an automatic fault-tolerant propulsion method and system for task execution abnormity and a storage medium, and relates to the technical field of distributed system fault-tolerant control, and the method comprises the steps: task dynamic arrangement: arranging tasks into a serial, parallel or dependent execution mode according to a preset dynamic rule, and realizing task trigger execution through an asynchronous thread pool; performing process monitoring, adding a monitoring annotation to an execution method of each task by using an AOP tangent, and capturing a task execution state in real time; performing abnormal grading processing, and executing a strategy according to a pre-configured three-level processing channel; spreading a dependency state, and automatically updating an associated task state based on a dependency relationship among the tasks: when an upstream task fails, pausing a downstream dependency task and marking the downstream dependency task as a waiting state, and continuing to execute a non-dependency task; and performing global state statistics, calculating a global state in real time through a task state algorithm, if all tasks are completed, marking the tasks as completed, if abnormal tasks exist, marking the tasks as abnormal, and triggering root cause analysis.

A system allows multiple users to interact with the system to perform data analysis. The system allows users to specify data analytics requests using high-level natural language requests. The system generates an execution plan based on natural language requests received from a particular user and executes the execution plan. The system detects a failure in executing the execution plan and determines whether to request help from another entity. The system may change the state of execution of the execution plan to a waiting state in which the system blocks execution until it receives an approval to proceed from an entity. The system receives a request to modify the execution plan from the entity and modifies the execution plan based on the request. The system iteratively performs the modification of the execution plan until an acceptable execution plan is generated.

Systems, computer program products, and methods are described herein for the implementation of an alternative data management system. The method includes dividing a process into one or more tasks, including a first task, to be completed. The method also includes determining a first task availability status for the first task. The first task availability status indicates whether the first task can be started by a user. The first task availability is designated as waiting in an instance in which at least one prerequisite task exists for the first task. The method includes causing the first task availability status to be changed from waiting to ready in an instance in which at least a portion of the prerequisite task(s) is completed. The method further includes assigning the first task to a first user in an instance in which the first user finishes one of the one or more tasks.

The invention discloses a DCU architecture-oriented sparse triangle solution dynamic load balancing method and device and a medium, and relates to the technical field of high-performance computing. The method comprises the following steps: rearranging a row sequence of a sparse matrix according to a dependency relationship; wherein the dependency relationship is determined according to an external dependency item and an internal dependency item of the thread block; and based on the sparse matrix of the rearranged row sequence, dividing the sparse matrix into a plurality of sub-matrixes according to the size of a thread scheduling unit, and determining a solving strategy according to the number of average non-zero elements in each sub-matrix. On one hand, the line dependency relationship of the sparse matrix is analyzed and rearranged in the preprocessing stage, so that calculation tasks are more uniformly distributed among DCU threads, and the situation that part of threads enter a waiting state due to the fact that data dependency is not met is reduced. On the other hand, the most suitable solving mode is dynamically selected according to the number of the non-zero elements in each row, and the calculation efficiency of overall solving is greatly improved.

The embodiment of the invention provides a data synchronization communication method and device, equipment and a storage medium, and the method comprises the steps: responding to an interface calling request, configuring a target shared memory of the interface calling request, and the target shared memory comprises target calling information; after the reference information of the target shared memory is sent to a second thread corresponding to the primary layer, entering a blocking waiting state, so that the second thread performs processing based on the reference information to obtain target response information and notifies the first thread to end the blocking waiting state; and after the blocking waiting state is ended, obtaining target response information from the target shared memory, and feeding back target result information. According to the scheme, lightweight and efficient synchronous interface calling can be realized, and the communication efficiency is improved.

The invention discloses a data handling method and device, a chip, a storage medium and electronic equipment. The data handling method comprises the following steps: in response to a direct memory access controller, receiving a data handling trigger signal from a data node, and handling data between the direct memory access controller and the data node; counting the total data volume of the carried data; and in response to detecting that the receiving state of the direct memory access controller on the data transfer trigger signal is an abnormal state before the total data volume reaches the predetermined data volume, executing a data transfer ending operation. According to the embodiment of the invention, the direct memory access controller is prevented from being in a waiting state all the time, and the central processing unit does not need to continuously poll a state register in the direct memory access controller, so that the overhead of the central processing unit is reduced.

This invention discloses a unified management and scheduling method, system, and storage medium for multiple workflow engines, belonging to the field of workflow orchestration and task scheduling technology. The method includes: receiving a start request for a target workflow, creating and recording a workflow instance, and determining the engine type; based on the engine type, selecting a target runtime adapter, driving the workflow instance to execute in the engine, and establishing a node execution record; when a target workflow node enters a waiting state, writing waiting and recovery information into an extended storage area; upon receiving a recovery advancement request, resuming the template workflow's progress, and verifying and auditing the recovery data; submitting the verified recovery data to the target runtime adapter, driving the target workflow node to complete the recovery advancement and triggering subsequent node scheduling, and outputting unified progress data. This invention can reduce the integration cost when multiple engines coexist, and improve cross-engine collaborative scheduling capabilities and audit traceability capabilities.

In one embodiment, a semiconductor storage device includes a plurality of memory chips, at least one of the memory chips including a first controller configured to be shifted to a wait state of generating a peak current, before generating the peak current in accordance with a command. The device further includes a control chip including a second controller configured to search a state of the first controller and control, based on a result of searching the state of the first controller, whether or not to issue a cancel instruction for the wait state to the first controller that has been shifted to the wait state.

The application discloses a kind of based on multiple buffer's obfuscated network packet assembly transmission method and device, the method, including, data packet assembly step and cache data sending step;Data packet assembly step: multiple buffer is set for data packet to be sent queue, extract a data packet from to-be-sent queue each time, whether the idle load space of each buffer can accommodate the data packet in turn according to preset order is judged, can accommodate then store and continue to extract next;When all buffer cannot accommodate, enter waiting state until the data of buffer is read and sent, and then re-execute storage;Cache data sending step: multiple buffer is locked at preset sending time, read first buffer data and fill to the size of set load after forwarding to obfuscated network;After forwarding is completed, execute buffer pointer switching, unlock buffer and wait for the next sending time to repeat sending, improve payload utilization by optimizing data packet assembly and sending logic.

The application discloses a general multi-master parallel on-chip bus supporting X86 architecture and belongs to the field of data transmission buses. The general on-chip bus supports parallel data transmission between multiple master processing devices and multiple slave devices, supports IO and memory space access, multiple priority arbitration strategies, multiple waiting states, an on-chip shared address multi-path data (SAMD) topology structure and three-state multiplexing of a bus data external interface, read and write data are multiplexed, and PPGA pin resources are saved. Through testing and simulation, a general IP core is formed, can be applied in different EDA development tools and development environments, has strong generalization, can effectively avoid repeated work, improve work efficiency, and further reduce research and development cost and research and development time.

Disclosed are systems and methods for implementing timers as a service. A request to create a timer is received. The request corresponds to a wait state condition associated with an event in a data stream. The request specifies an endpoint for a payload associated with an expiration of the timer. The timer is created based on the wait state condition. The creating of the timer includes publishing information pertaining to the timer in a database. The timer is consumed. The consuming of the timer includes processing the information pertaining to the timer. Based on the expiration of the timer, the payload associated with the expiration of the timer is sent to the specified endpoint.

The invention discloses a state switching test method, device and system, electronic equipment and a storage medium, and relates to the technical field of software test.The main technical scheme includes the steps that when it is determined that the software state of a test execution end is switched to a to-be-tested state, a first target test case is sent to the test execution end; when it is determined that the first target test case completes the test, a first control instruction for switching the software state to the to-be-tested state is sent to a test execution end, so that the test execution end switches the software state to the to-be-tested state based on the first control instruction; when it is determined that the software state is switched to the to-be-tested state, sending a second target test case to the test execution end until each test case in the test case set is tested; the second target test case is any test case except the first target test case in the test case set. Compared with the prior art, the embodiment of the invention realizes the comprehensive coverage of the switching scene of the software state.

The invention discloses a data processing method and device, equipment and a storage medium. The method comprises the steps that an upper-layer application of embedded equipment is read; judging whether the upper-layer application passes verification or not, if the upper-layer application passes verification, entering a broadcast waiting state, and if the upper-layer application does not pass verification, entering the Boot main program; and when a firmware updating instruction is received in the broadcast waiting state, entering the Boot main program to perform firmware updating, and when the broadcast waiting state is overtime, performing overtime operation. The data processing method and device, the equipment and the storage medium have the beneficial effect that the situation that firmware cannot be upgraded can be effectively avoided.

A process of an operating system detects a dynamic migration, the dynamic migration including a change in hardware characteristics of a computer system on which the process is executed. A first message is broadcast to a group of processors, the first message causing each processor in the group of processors to enter a wait state. While each processor in the group of processors is in the wait state, a portion of a set of program instructions of the operating system is modified.

A method for preventing tearing effect, which is applied to a display driver chip. The display driver chip includes a frame memory, a display channel, and a synchronization signal generator that provides synchronization signals to the frame memory and the display channel. The method for preventing tearing effect includes: when detecting the power-on timing, adding a WAIT state to the synchronization signals generated by the synchronization signal generator. The WAIT state starts when the VACTIVE state ends and terminates when receiving the VSYNC from an external application processor. The power-on timing is when receiving a sleep command from an external application processor. For display purposes, the display driver chip internally adjusts the power-on timing of the power state. This method can eliminate the tearing effect generated when using a display driver chip with a built-in frame memory in video mode.

A process of an operating system is detected as having undergone a live migration, where the live migration involves a change in a hardware feature of the computer system on which the process is executing. A first message is transmitted to a group of processors, the first message causing each processor in the group of processors to enter a wait state. While each of the group of processors is in the wait state, a portion of a set of program instructions of the operating system is modified.

The invention provides a thread running method, a multi-core processor, computing equipment and a computing equipment cluster, and belongs to the technical field of computers. In the method, operation modes of processor cores of the multi-core processor comprise a user mode and a user exclusive mode; when a first processor core executes a first task through a first user thread in a user mode, if the first user thread executes first mode switching in the first task, the first processor core enters a user exclusive mode; the processor core can run the user thread in the user exclusive mode and has the execution authority for the instruction used for controlling the state of the processor core in the operating system kernel, so that the first processor core can freely enter the waiting state in the user exclusive mode and continue to execute the first task after being awakened; the method does not need to switch back to the user mode, and does not need to switch the mode when the processor needs to enter the waiting state next time, thereby improving the efficiency of inter-core communication between user threads, and reducing the power consumption of the processor.

Embodiments of the present application provide a process instance processing method and device, equipment and a storage medium, belonging to the technical field of financial technology. The method comprises: putting a candidate process instance with a process priority into an instance waiting queue; extracting a candidate process node and a node execution order of a target process instance from the instance waiting queue according to the process priority; executing the target process instance according to the node execution order to obtain a target execution instance; obtaining a target process node in a waiting state from the target execution instance to obtain a target process node, and putting the target process node into a node waiting queue; extracting a current node category and a current execution operation of a current process node from the node waiting queue according to the node execution order; calling a microservice to execute the current execution operation according to the current node category to obtain a node execution result; and executing the target execution instance according to the node execution result and the node execution order. The embodiments of the present application can automatically control the microservice to complete the business, and improve the efficiency of business completion.

This disclosure relates to a thread scheduling method, apparatus, electronic device, and storage medium. The thread scheduling method includes: obtaining a first parameter, which characterizes the number of processor cycles in which processor wait events occurred during the execution of a target thread in a historical scheduling cycle; a processor wait event characterizes a running event that causes a processor core to be in a waiting state; determining a second parameter based on the first parameter, which characterizes whether the occurrence of processor wait events during the execution of the target thread in a historical scheduling cycle leads to inefficient operation of the processor core; and scheduling the target thread based on the second parameter. This method uses the number of processor cycles in a waiting state as a criterion for judging processor core performance, subdividing the thread execution process from the perspective of processor cycles. This allows for a more accurate understanding of the target thread's requirements for processor core performance, ensuring that the target thread is scheduled to the most suitable processor core and maximizing the utilization of processor resources.

The present invention provides a method for managing the lifecycle of a mini-program, comprising: when the lifecycle module is started, it enters a waiting state; when the timing manager detects that the lifecycle module has been started, it obtains the pre-data required by the lifecycle module from the server and sends the pre-data to the lifecycle module; when the lifecycle module receives the pre-data, it exits the waiting state and performs business processing on the pre-data; the timing manager can be used to uniformly obtain the necessary pre-data for each lifecycle module, which not only ensures that these modules can obtain the required pre-data when performing subsequent business processing, but also can perceive in real time the situation of each lifecycle module obtaining the pre-data, can effectively control the timing of the mini-program startup process, and can effectively avoid the problem of confusion in the startup of the mini-program. The present invention also provides a mini-program lifecycle management system, electronic device and storage medium, which have the above-mentioned beneficial effects.

The application provides a concurrent vulnerability verification method and device, electronic equipment and readable storage medium, applied to the computer kernel security field, including: obtaining a first interleaved sequence in the computer kernel; the first interleaved sequence includes: a plurality of memory operation instructions; the plurality of memory operation instructions executed according to a target condition are used to trigger a concurrent vulnerability; adding a breakpoint before each memory operation instruction in the first interleaved sequence to obtain a second interleaved sequence and execute; the breakpoint is used to make the memory operation instruction after the breakpoint enter a waiting state; based on the memory operation instruction entering the waiting state and the target condition, the trigger information of the concurrent vulnerability is output. The embodiment adjusts the execution order of the interleaved sequence using the breakpoint, so that the execution process meets the target condition, and solves the problems of expected interleaved sequence execution interference and low reproduction efficiency.

The present techniques relate to a clock control scheme and related methods and circuitry in a system comprising one or more processor cores and there is disclosed a control state machine in a clock c

The application relates to the technical field of industrial automation control, and proposes a control method, device, equipment and medium of a high-voltage frequency converter. The method comprises the following steps: receiving a ready instruction sent by a first control end, collecting real-time state signals of multiple associated components in the high-voltage frequency converter in parallel according to the ready instruction; performing logical judgment on the real-time state signals of each associated component and preset respective corresponding ready conditions; determining to enter a ready waiting state only when the real-time state signals of all the associated components all satisfy the corresponding ready conditions; after determining to enter the ready waiting state, keeping each associated component working and collecting the running state of each associated component in real time, generating and outputting a ready waiting signal to a second control end; receiving a start instruction returned by the second control end according to the ready waiting signal, and performing corresponding start operation according to the start instruction. Through the technical scheme, the control of safe and rapid start is realized.

This invention discloses a data parallel processing method, apparatus, and electronic device based on model data, relating to the field of multi-threaded control technology, aimed at reducing power consumption during model-localized runtime. The method includes: after the first thread in the multi-threaded system completes its calculation, if the global busy-wait token is in a closed state, setting the global busy-wait token to an open state, simultaneously setting its own end token to an open state, and entering a cyclic busy-wait state; after the second thread in the multi-threaded system completes its calculation, if the global busy-wait token is in a open state, setting the second thread's own end token to an open state, stopping execution, and relinquishing the CPU. This invention is applicable to data processing of large localized models.

The purpose is to enhance the enjoyment of the game. [Solution] In a gaming machine, the game control microprocessor comprises a CPU, a program executed by the CPU, a ROM storing information referenced by the program, a RAM capable of storing information updated by the program, a general-purpose register, a data register, and a flag register. The CPU writes first information to the RAM at the start of a variation performance indicating the result of a lottery. When the power to the gaming machine is cut off during the execution of the variation performance and then power is turned on to the gaming machine, the CPU reads the first information from the RAM and transmits it to the performance control microprocessor. When the variation performance resumes after the machine has entered a waiting state for customers, the CPU reads the first information from the RAM and transmits it to the performance control microprocessor.

The invention discloses a remote disk equipment access method and device, computer equipment, a medium and a product, and relates to the technical field of data storage. The method comprises the following steps: entering a connection waiting state during starting, and monitoring a connection request of a client disk host; establishing connection with the disk host in response to the connection request, entering a request waiting state after successful connection, and monitoring an operation request of the disk host; executing disk operation on local physical disk equipment in response to the operation request, and returning to the request waiting state after the operation is completed; in the request waiting state, if it is detected that the physical disk device has a state change, reporting change information to the disk host, and returning to the request waiting state after reporting is completed. Decoupling of the network state, the equipment state and the service state is achieved, resource waste and response delay are reduced, and reliability and recovery efficiency of remote storage access are remarkably improved.

The invention discloses a task assignment method and system based on a task graph, and relates to the technical field of sparse linear equation set solver, and the method comprises the steps: calculating task processing time based on a time estimation model during task assignment; the number of completed tasks is initialized to be zero, the number of initial idle threads is initialized to be the number of total threads, and the tasks with the initial task state being in task waiting are put into a to-be-dispatched task sequence; executing a task assignment main cycle; when the initial idle thread number is greater than zero and the to-be-dispatched task sequence is not empty, distributing a thread number for the task; when the initial idle thread count is zero, determining the fastest thread based on the task processing time; when the to-be-dispatched task sequence is empty, traversing the task chain depending on the current task to obtain the dependent task of the current task, putting the dependent task into the to-be-dispatched task sequence, and executing the task dispatching main cycle, so that the problem that the task processing time cannot be accurately predicted and the thread resources cannot be uniformly distributed in the prior art can be solved.