134 results about "Coroutine" patented technology

The invention discloses a coroutine scheduling method, device, system and equipment, a storage medium and a product, and relates to the technical field of task scheduling, a multi-priority queue group is used for storing a first coroutine task to be executed in a corresponding scheduling domain, and a storage module is used for storing a second coroutine task periodically executed in a corresponding scheduling domain; the execution cycle of the first coroutine task is smaller than that of the second coroutine task. And when the expired second coroutine task exists in the storage module, mounting the expired second coroutine task to the multi-priority queue group. The situation that the first coroutine task with the low priority cannot be executed due to the fact that the second coroutine task does not reach the execution time is effectively avoided. And the coroutine tasks are obtained and executed from the multi-priority queue group according to the priority sequence, so that the tasks with high priorities are ensured to preferentially obtain execution resources. According to the running state and the load state of each scheduling domain, task migration of each scheduling domain is carried out, and the resource utilization rate is optimized.

The embodiment of the invention discloses a batch writing method and equipment for a PostgreSQL database, relates to the technical field of cross-database migration, and is used for solving the problems of poor compatibility and low reliability of an existing mode. The method comprises the steps of performing cross-database dialect semantic mapping on a heterogeneous data source based on a cross-database semantic mapping engine to obtain a global concurrent import control parameter set of a target database, and extracting the heterogeneous data source based on analysis configuration of the global concurrent import control parameter set to obtain a standard record object; performing flow control on a task channel of the target database based on a self-adaptive backpressure strategy so as to assemble the standard record objects into data batches and distribute the data batches to a working coroutine of the target database; the batch writing protocol is called through the working coroutine, the batch direct writing request is initiated to the target database for batch writing, and the writing abnormity is processed based on the preset fault-tolerant mechanism to obtain the writing result, so that the data writing risk is effectively reduced while the compatibility is ensured, and the reliability of cross-database batch writing is improved.

The present disclosure provides a runtime virtualization method and apparatus. A specific implementation of the method includes: constructing a dynamic runtime library based on the native runtime library of an application, where the dynamic runtime library simulates threads implemented in the native runtime library in a coroutine manner; loading the dynamic runtime library when starting the application to generate a runtime virtualization environment and a coroutine scheduling thread running in the runtime virtualization environment, where the coroutine scheduling thread is used to schedule coroutines, and the runtime virtualization environment is an environment after replacing the native runtime library with a generated runtime environment; receiving a task request of the application in the runtime virtualization environment; and scheduling coroutines using the coroutine scheduling thread based on the task request and the dynamic runtime library so that the coroutines complete the tasks corresponding to the task request. This implementation improves the concurrency performance of the application, reduces resource consumption and resource scheduling pressure without making any modifications or recompiling to the application in the target operating system.

The invention relates to the technical field of computer application, in particular to a coroutine-driven multi-strategy APP behavior collection event reporting system. Comprising a management center, and the management center is in communication connection with a system configuration module, an event coroutine module, an event uploading module and a collection retransmission module. The method comprises the following steps: collecting equipment information data and user identity information, initializing the collected equipment information data and the user identity information, obtaining configuration data, and establishing a start burying point through the configuration data; establishing a communication link according to the starting burying point; analyzing the obtained use behavior of the APP user to obtain an APP behavior collection sub-event; processing the APP behavior collection sub-event through a coroutine unit to obtain a sub-event data packet, uploading the sub-event data packet, and generating a data uploading completion signal and a data uploading failure signal; and retransmitting the sub-event data packet through the data uploading completion signal and the data uploading failure signal. The data loss rate can be reduced.

The invention discloses a software performance test system, method and device in a high-concurrency scene, and relates to the field of software testing, the system comprises a scene intelligent construction module used for generating a concurrency scene through a behavior tree modeling and time sequence prediction algorithm according to service demand parameters and historical traffic data; the distributed test environment scheduling module is used for constructing a distributed test environment by adopting a container arrangement technology; the virtual user load generation module is used for simulating concurrent user requests by adopting a coroutine pool technology; the real-time performance data acquisition module is used for acquiring multi-source performance data of the tested software in real time; the intelligent performance analysis module is used for calculating a core performance index according to the multi-source performance data and carrying out anomaly detection and trend prediction; and the performance bottleneck positioning module is used for mining a dependency relationship among the core performance indexes and generating a bottleneck positioning report and an optimization suggestion document. According to the method, the accuracy, the efficiency and the stability of software performance testing in a high-concurrency scene are improved.

The invention provides an asynchronous graph calculation method and system based on a coroutine, electronic equipment and a storage medium, and relates to the technical field of graph calculation. The asynchronous graph calculation method comprises the following steps: determining an activation vertex based on an activation vertex bitmap; the activation vertexes are distributed to different parallel tasks, so that each parallel task calls a first preset function based on the current activation vertex to generate a target message, and the target message is stored in a corresponding local message queue; aggregating the target messages in the local message queue based on the plurality of first target coroutines to obtain a target message set; and calling a second preset function based on the plurality of second target coroutines to carry out message processing on the target message set so as to complete asynchronous graph calculation. The resource utilization rate of the whole graph computing system can be effectively improved.

The invention discloses a method for rewriting binary software and electronic equipment for rewriting the binary software, according to a deformation number and original code rewriting information, a part of instructions of an original binary code are selected to be replaced with a jump instruction sequence, the jump instruction sequence jumps into an additional code unit, and the additional code unit is rewritten according to the additional code unit. And after completing the same logic function of the replaced instruction, the additional code unit skips to the back of the replaced instruction and continues to execute the instruction. The additional code unit can also run additional calculation, plug-in coroutines and the like. The method is suitable for being used as random scrambling of cryptographic operation to resist energy analysis attacks. And the method is also suitable for code obfuscation, tamper-proof monitoring, piracy prevention and the like of binary software.

The invention belongs to the technical field of task scheduling of a storage system, and discloses a user-mode-oriented storage task self-adaptive scheduling method and system, and a more efficient task processing framework is realized by replacing an original kernel thread-based storage task scheduling scheme with a user-mode coroutine scheduling mechanism. The multi-level priority queues are directly managed in task scheduling, and CPU core binding configuration is carried out, so that the switching delay of a user mode / kernel mode is reduced, and the task execution controllability is improved. A dual-threshold self-adaptive scheduling strategy switching technology is introduced, and a greedy scheduler and a reinforcement learning scheduler are combined, so that the problem of adaptability of a static scheduling strategy in a dynamic load environment is relieved, performance loss caused by scheduling strategy solidification is avoided, and the self-adaptive capability and service quality guarantee of a system under a complex load are improved. Compared with an existing task scheduling method based on a kernel thread, the task scheduling method has the advantages that the overall performance and the resource utilization rate of a storage system can be remarkably improved while the task execution efficiency and the SLA requirement are guaranteed.

The invention provides an online fragment restructuring method and related equipment, and relates to the technical field of computers.The method comprises the steps that an online fragment restructuring request is received, a target fragment is determined, a migration task is created in the target fragment, and a first coroutine and a second coroutine are created in the target fragment according to the incremental copying process in the migration task, the first coroutine and the second coroutine are executed asynchronously and concurrently, a binary log event in the source fragment is obtained in the first coroutine and written into a relay log of the target fragment, and data in the relay log is written into the target fragment through the second coroutine. The problem of shutdown migration is solved, shutdown processing is not needed, usability and efficiency are improved, dependence on manual operation is reduced, and the scene application range is widened.

The invention relates to a high-concurrency request processing method for reducing Linux kernel resource loss. The high-concurrency request processing method comprises the following steps: receiving a user request and extracting a routing key; the requests are distributed to one fragment in the fixed N fragments through a fragment event executor, each fragment is bound with a single thread and a bounded queue, and the same routing key requests are executed in the same fragment in a strongly sequenced mode according to the enqueue sequence; calling a coprogram state machine to push a business process in the fragment execution thread, and returning a state result of migrating to a next state, keeping a current state or terminating the process through a state processing function; dynamically triggering self-adaptive back pressure based on queue depth or waiting time delay, and adjusting a request submission strategy according to a queue filling rate and exponentially weighted moving average waiting time delay; and submitting the long blocking task to an asynchronous task subsystem, and performing isolated execution through an independent bounded queue and a small concurrent thread pool. The same-key sequence is guaranteed through fragmentation single-thread execution, and thread switching and lock contention are remarkably reduced.

The present disclosure provides a database thread pool control method and apparatus. A specific implementation of the method includes: loading a dynamic runtime library capable of replacing threads with coroutines in the operating system of the database to generate at least one coroutine scheduling thread; receiving a connection request sent by a client to the database; detecting whether a request for the database to create a new thread is a request for processing the connection request; in response to detecting that the request for the database to create a new thread is a request for processing the connection request, creating a coroutine corresponding to the connection request, and scheduling the coroutine through at least one coroutine scheduling thread to complete the access task corresponding to the connection request. In this implementation, the coroutine scheduling thread serves as the working thread of the database thread pool, and the task "starvation" problem of the traditional multithreaded scheduling model and its related task response speed jitter problem are avoided by using the coroutine swap-in and swap-out mechanism. While improving the database concurrency performance, the resource consumption of concurrent scheduling is reduced.

Embodiments of the present application provide a kind of alarm rate detection method, device, equipment and storage medium, the method can create and target test equipment same and one-to-one corresponding coroutine, then call each coroutine continuously through the way of mutual exclusion, constantly from the ordered acquisition of preset rule set in measured rule package, then measured rule package is sent to target test equipment to carry out the test of rule package, each coroutine can be realized uninterrupted continuous testing, and after completing the test of all measured rule package, the alarm result of each measured rule package is determined and alarm rate is determined, without waiting target test equipment to spit alarm after each time sending rule package, so that the test efficiency of rule package can be improved.

The invention discloses a shared resource access method and device, equipment, a medium and a product, and relates to the technical field of efficient concurrency control and resource management in a computer system.The shared resource access method and device adopt a mixed structure combining a lock-free annular queue and a double-end queue, queue data are analyzed through a load prediction unit, and the load trend is predicted; the queue capacity and the migration threshold value are dynamically adjusted; the lock-free annular queue is preferentially used in daily life to improve the access efficiency, and when the queue is close to the capacity upper limit or triggers the migration threshold, migration and capacity expansion of waiting coroutines are automatically realized through the double-end queue, so that the processing performance under high concurrency is ensured, and the dynamic capacity requirement is met; finally, the technical problems that the performance and the capacity of a single queue are difficult to consider in a high-concurrency scene and the single queue cannot adapt to a dynamic load are solved, and efficient scheduling of shared resources in a coroutine environment is realized.

The invention provides a coroutine task scheduling optimization method based on OpenHarmony, belongs to the technical field of industrial robot operation, and aims to solve the problem that an industrial robot is insufficient in real-time performance, concurrency and flexibility in a complex task scene, and the method comprises the following steps: S1, coroutine data structure design; s2, optimizing coroutine memory management; s3, multi-architecture processor adaptation is carried out; s4, optimizing a coroutine task scheduling mechanism; s5, carrying out coroutine multi-core scheduling optimization; the invention designs and realizes an industrial robot operating system library of a lightweight coroutine in order to realize coroutine task scheduling optimization. According to the coroutine library, the lightweight coroutine library which is lower in memory occupation, higher in task real-time performance and higher in CPU utilization rate is designed and realized aiming at the condition that resources are limited in a robot scene, and meanwhile, the coroutine library is introduced into a domestic robot operating system for real-time scheduling adaptation for the first time.

The application discloses a kind of Python function dynamic management method, system and storage medium, the method first receives the function call service request of containing target service identification and target function identification, then based on double hashing register fast positioning target service instance, extract target function object therefrom and analyze its execution attribute to determine the matched asynchronous execution strategy, finally according to the strategy function call is encapsulated as coroutine task or thread / process task to be executed in one step scheduling and return result.

The invention provides a task processing method which can reduce the number of coroutines of a processing core and reduce the coroutine scheduling duration so as to improve the task processing efficiency. The method comprises the steps that after a main coroutine and a standby coroutine are created in a processing core, the main coroutine is used for polling a task queue of the processing core. The invention further provides a storage device, a computer readable storage medium and a computer program product capable of implementing the method.

The application provides a processing method, device, storage medium and system for serial machine communication, and belongs to the technical field of communication. The monitoring method comprises the following steps: storing element information corresponding to a plurality of ports by using a first queue pool; adding elements corresponding to one or more TCP ports in the plurality of TCP ports into a to-be-processed linked list, adding element information corresponding to one or more TCP ports with a cache mark into a preparation linked list, and receiving output information of the TCP ports in the preparation linked list; when the one or more TCP ports are connected, predicting I / O operations generated in a next process, and marking the process by using an asynchronous keyword. The application configures the to-be-processed linked list, the preparation linked list, the cache mark and the asynchronous keyword based on the coroutine technology, realizes processing of asynchronous communication of the serial machine, and does not have a time slice of context switching of the CPU, so that the CPU resource overhead is reduced.

The invention provides an efficient task scheduling method based on a Golang coroutine and multiple channels. The efficient task scheduling method comprises the following steps: constructing a three-level channel scheduling architecture; the method comprises the following steps of: defining a scheduler structural body; priority processing and dynamic load balancing of instructions are achieved through a three-level gradient buffering mechanism; calculating the number of required working coroutines in real time by using a dynamic capacity expansion and contraction algorithm model, and adjusting the size of a coroutine pool in real time; calculating timeout time by utilizing a dynamic timeout formula, and automatically triggering a deadlock prevention mechanism when task execution time exceeds a calculated value; a fault-tolerant scheduling strategy is adopted, a complex task is decomposed into a plurality of independent fragments which can be processed in parallel, and processing results of the fragments are submitted in a result channel non-blocking mode; and meanwhile, when a first effective result is detected by using a quick response strategy, immediately cancelling the remaining unprocessed fragments and returning the result. Through the technical means based on Golang coroutines and multiple channels, efficient, low-delay and high-concurrency task scheduling is achieved, and the requirements of high-concurrency and high-real-time application scenes are met.

The invention relates to a register resource allocation method, computer equipment, a readable storage medium and a program product. The method comprises the following steps: constructing a function group through a calling relationship between functions, wherein the function group comprises a coroutine kernel function and at least one coroutine subfunction; creating a resource record table corresponding to the function group, wherein the resource record table is used for recording register resources allocated to coroutine kernel functions and / or coroutine sub-functions in the function group; and carrying out register allocation on the coroutine kernel function and the coroutine sub-function in the function group based on the resource record table. By adopting the method, the requirements of local variable register resource isolation and shared variable register resource consistency in a collaborative mode can be met, so that the parallel computing efficiency is improved.

The method comprises: obtaining a target code block to be called by a current coroutine and at least one first dependent object relied on by the target code block; storing the at least one first dependent object in a local storage space of the current coroutine; and calling and executing the target code block under the local storage space by using the current coroutine, so as to obtain the at least one first dependent object from the local storage space in the process of calling the target code block. In this way, the dependence on convention and configuration can be reduced, the strong coupling with a specific backend framework is not required, a more intuitive and flexible dependence injection mode is provided, the use of reflection and proxy mechanisms is reduced, and the performance overhead in the code execution process is reduced.

The invention provides a method for obtaining a call stack and computer equipment. According to the method, a stack return statement is added in a code file during running of a Rust programming language, so that control during running is increased. The asynchronous task (or coroutine) is expanded on the thread, and when the execution is in order to obtain the call stack, the task on the thread is returned to the stack, so that the call stack is obtained and recorded. In the execution process, the data and the state of the stack-free coroutine cannot be changed, and the task logic cannot be influenced. According to the method for obtaining the call stack and the computer equipment provided by the invention, the code file cannot be modified in a large range, a large amount of operation overhead cannot be occupied for obtaining the call stack, so that function call or task logic cannot be influenced, the call stack can be conveniently and efficiently obtained, and the user experience is improved. Therefore, the operation condition of the coroutine in the Rust programming language can be accurately judged.

The application relates to the field of artificial intelligence, and provides a code generation method, an electronic device and a storage medium, the method comprising the following steps: obtaining a tensor intermediate representation of a target operator; inserting a synchronization operation in the tensor intermediate representation based on a data dependency relationship of the tensor intermediate representation, so as to obtain a synchronization tensor intermediate representation; automatically splitting the synchronization tensor intermediate representation into a main function and a plurality of coroutine sub-functions, the main function being used for calling each coroutine sub-function, and different coroutine sub-functions corresponding to different cooperative thread bundles; and automatically generating running code of the target operator based on the main function and the plurality of coroutine sub-functions. The method, the electronic device and the storage medium provided by the application realize automatic generation of fine-grained asynchronous parallel code of a complex logic operator, reduce the development workload and development cost of the operator, improve the development efficiency of the operator, and optimize the performance of the operator. Moreover, the method can be used for code implementation of various operators, is not limited by the number and type of operators, and has good generalization and flexibility.

The invention relates to the technical field of computers, and discloses a deterministic time delay coroutine scheduling method and electronic equipment, which are used for controlling the running time of a coroutine and ensuring that the coroutine is executed on time. In the method, the electronic equipment determines operation time information of a first coroutine, and the operation time information of the first coroutine comprises a first expected operation duration and a first expected operation end moment; the electronic equipment determines target time information of the first coroutine according to the running time information of the first coroutine, the target time information of the first coroutine is used for indicating the estimated running time length of the first coroutine, and the target time information of the first coroutine comprises a first estimated starting moment and a first estimated ending moment. Therefore, the electronic equipment can estimate the starting moment and the ending moment of the operation of the first coroutine based on the expected operation duration and the expected ending moment of the first coroutine, so that the operation time of the coroutine can be controlled, the coroutine is ensured to be executed on time, and the time delay problem is avoided.

The invention belongs to the technical field of message processing, and provides a queue message backlog processing method, system and equipment based on a coroutine technology, which are used for monitoring the backlog amount of message queues in real time and dynamically increasing the number of coroutine consumers according to the backlog condition of the message queues; dividing the message queue into a plurality of partitions, and dynamically adjusting partition distribution according to the load condition of each coroutine consumer; coroutine consumers pre-fetch messages from the message queue server in batches, the number of the pre-fetched messages is dynamically adjusted according to the current backlog condition and the processing speed of the consumers, and a local cache queue is constructed at the consumer side to store the pre-fetched messages; and coroutine consumers concurrently process a plurality of messages by using a coroutine, and send receipts to the message queue in combination with an asynchronous receipt mechanism. According to the method, the problem of message backlog of the message queue is solved by utilizing a coroutine technology, and message delay is reduced and the real-time performance and the resource utilization rate of the system are improved through optimization means such as dynamic extension of the coroutine consumer pool, batch prefetching of messages and concurrent processing.

The present invention discloses a method and device for realizing on-orbit operation and autonomous on-orbit operation of a spacecraft, and belongs to the technical field of on-orbit operation of a spacecraft. The method comprises: in response to a control command sent by a ground control terminal, creating a virtual machine in an engine, creating a new coroutine in the virtual machine, using the new coroutine to load an on-orbit control program from an onboard memory into the virtual machine and activating the on-orbit control program, establishing an association relationship among a virtual machine identifier, a coroutine identifier, and an on-orbit control program identifier; adding a coroutine associated with the on-orbit control program to a scheduling queue, and scheduling the coroutines in the scheduling queue according to a preset scheduling strategy, so as to utilize the coroutine to run the on-orbit control program associated with it. In the present invention, the ground control terminal only participates in the preparation process of the on-orbit control program in the early stage, and the operation process of the on-orbit control program is completely autonomously operated by the spacecraft, which can realize flexible adaptation of application scenarios.

The invention discloses a timed task execution method, electronic equipment, a readable storage medium and a program product, and relates to the technical field of computers. The method comprises the following steps: constructing a timer data structure according to a time dimension attribute item and a task dimension attribute item, and correspondingly initializing a data structure element according to a current task execution parameter; and generating a task data structure according to the operation parameter information and the coroutine parameter of the newly added timed task, and inserting the task data structure as a node into a timer data structure. And in the process of checking the expiration of each timed task, if the current parameter value of the task dimension attribute points to the new timed task, transferring the new timed task and the target execution coroutine to respective corresponding to-be-executed task queues. The problem that the coroutine and the timer are not tightly combined in the prior art can be solved, and the coroutine can be efficiently utilized for task scheduling.

The invention provides a timer life cycle management method and device, equipment and a storage medium, a system timer object is created through a timer management instance, a timer callback function is registered in an operating system timed task interface, when a cycle corresponding to a timed cycle field is reached, task logic in a task function field is automatically triggered, and the timed task is automatically called. Therefore, precise scheduling and unified management of the timed tasks are realized. By setting the instance identification field and the running state flag field in the timer management information, each timer object can be uniquely identified and tracked, and the problem of repeated creation or state disorder is avoided. Furthermore, a stop signal is received through a monitoring coroutine in a stop stage, so that the safe termination of a timed task and the automatic release of resources are realized, and the reliable recovery of a timer and the stable operation of the system are ensured.

The present invention discloses a high-concurrency charging pile simulator based on a preemptive scheduling algorithm, which includes: a coroutine encapsulation module under a non-blocking IO model, a preemptive scheduling algorithm module, and a simulator creation and destruction management module. Among them: the coroutine encapsulation module is used to encapsulate the charging pile simulator into a coroutine that can be paused and resumed; the preemptive scheduling algorithm module is used to schedule the execution of the coroutine. When the coroutine encounters a block, it automatically pauses and saves the context. When the block is lifted, the context is reloaded and the execution is resumed; the simulator creation and destruction management module is used to manage the creation, reconnection, and destruction of the simulator. When the simulator goes off the network, it automatically attempts to reconnect, and destroys the simulator resources after the reconnection fails. The present invention uses a non-blocking IO model and realizes high concurrency through coroutines and a preemptive scheduling algorithm, avoiding the waiting time caused by blocking operations.

The present invention provides a process-based network traffic statistics method, comprising the following steps: a coroutine captures the front-end data packet from the packet queue, performs transport layer filtering, network layer filtering, and application layer filtering, calculates the effective data volume of the data packet, pushes the effective data volume value to a data channel, calculates the effective data volume value within the data channel, and continuously obtains the traffic value of the process. The method has the following advantages: 1. It is simple to use out of the box, using a compiled binary executable program, and can be used quickly and cheaply in Linux x86 and ARM environments; 2. Starting from the application layer, it filters traffic based on process and service names, thereby better aligning with business objectives, reducing interference factors, and reducing analysis difficulty. This method effectively reduces the difficulty of observation in scenarios such as port negotiation, where there are many ports and they change dynamically.

The invention discloses a distributed consistency method, device and equipment, a storage medium and a product. Comprising the steps that in the process that a to-be-added node is added into a high-availability cluster, a main node and the to-be-added node exchange remote addresses of remote direct memory access of the main node and the to-be-added node; a two-stage submission protocol is initiated, and a main node encapsulates data sent by a client and writes the data into a remote address of remote direct content access of a newly added node; the newly added node polls and checks that a new distributed consistency sending message exists on a local address by receiving a coroutine of the remote direct memory access request, and then writes a processed reply message into a remote address of the remote direct memory access of the main node; and the main node polls and detects that a new distributed consistency reply message exists on the local address by replying the coroutine of the remote direct memory access request, and then processes the new distributed consistency reply message. The method can effectively reduce the consistency delay.