69 results about "Coroutine" patented technology

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 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 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.

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 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 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 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 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 invention relates to the technical field of computer programming, in particular to a priority-based pop-up window management method and system, electronic equipment and a medium. The method comprises the following steps: importing related classes; constructing a suspended function as a corresponding popup task for the popup, and instantiating the asynchronous result container as a decision result container corresponding to the popup task; acquiring the priority of the pop-up window task, and adding the pop-up window task into a pop-up window task queue based on the priority of the pop-up window task through a queuing method of a pop-up window queue manager; starting a coroutine in the coroutine action range, executing the pop-up window tasks in the pop-up window task queue according to the sequence, executing the pop-up window tasks, and obtaining a result value in a corresponding decision result container; if the result value is the preset value, executing the next pop-up window task in the pop-up window task queue in sequence; and if the result value is not the preset value, stopping executing all follow-up window popup tasks. According to the method, interface conflicts and memory leakage risks can be avoided, and the maintainability and reusability of codes are improved.

The application discloses a QuickJS multi-interface collaborative optimization method and system of embedded equipment, relates to the technical field of JS multi-interface optimization, and comprises the following steps: S1, collecting interface task data, performing data preprocessing, identifying control difference and state change before and after the task; S2, setting a basic frame budget, constructing a task frame time consumption model, outputting a predicted frame time consumption, and comparing the current frame actual time consumption with the basic frame budget; S3, calculating the interface task priority, performing real-time sorting and scheduling, and establishing an asynchronous coroutine and task splitting and sticking mechanism; S4, outputting a structured rendering command, evaluating the redundancy of the control, and taking control adjustment measures; S5, constructing an error description vector, quantifying the deviation degree of the actual rendering result, and taking a rollback recovery measure; the problems that interface response depends on an event loop in the interaction between QuickJS and the underlying UI system, and that multiple JS interface tasks are simultaneously activated, resulting in abnormal interface rendering, are solved.

The invention discloses an Internet of Things equipment simulation online test method, system and equipment and a medium. The method comprises the steps that information of equipment to be tested is collected and then imported into a database through a data information issuing platform; an equipment simulation module pulls written equipment information from a database to create an event cycle based on syncio, an independent simulator is instantiated for each piece of Internet of Things equipment, an exclusive asynchronous coroutine is created for each simulator, each simulator creates an independent MQTT client side through aiomqtt to monitor a message channel of an instruction issued by an Internet of Things platform, and the message channel is sent to the Internet of Things platform; and analyzing and processing the arrangement task, constructing equipment attributes and event data, and reporting the equipment attributes and event data to the Internet of Things platform. According to the method, a simulator is adopted to replace real equipment for testing, multi-coroutine concurrent scheduling in a single thread is realized through an asycio asynchronous programming architecture and in combination with an aiomqtt asynchronous MQTT client, the thread switching overhead of a traditional synchronous architecture is avoided, a single server can support parallel simulation of more equipment, and the method is simple and convenient to operate. And the online test requirements of massive equipment can be met while the test efficiency is improved.

Embodiments of the present application provide an object counting processing method and device, computer equipment, computer readable storage medium and computer program product, belonging to the technical field of network data processing. The method comprises: obtaining an incremental request of a target room, the incremental request carrying a room identifier and an incremental value of the target room; determining a room heat level of the target room, the room heat level being used to represent the order of magnitude of the number of objects in the target room; determining a target counter structure corresponding to the target room from a plurality of counter structures according to the room heat level, wherein different counter structures differ in at least one of the number of operation channels, the number of processing coroutines and the buffer level; routing the incremental request to the target counter structure based on the room identifier; and performing counting processing on the target room based on the incremental value through the target counter structure. The above scheme can reduce the risk of resource occupation or processing bottleneck caused by the mismatch between the unified counter structure and different room loads.

The invention discloses a method and a system for realizing a timed task, electronic equipment and a medium, and relates to the technical field of task processing, a coroutine in a user mode can schedule coroutine tasks according to a task scheduling queue, and meanwhile, before any coroutine task is scheduled, the task scheduling queue is started; the coroutine drives the time wheel to rotate according to the time difference between the current time and the historical time, determines the current expired timed task according to the rotation condition of the time wheel, adds the expired timed task into the task scheduling queue, and triggers the expired timed task, so that timed management of tasks in a server system is realized, and the task scheduling efficiency is improved. Therefore, the trigger can be carried out at a specific time. Task scheduling and driving of a time wheel are both achieved through a coroutine, the time wheel is driven before task scheduling to achieve management of timed tasks, single-thread task distribution and lock-free operation of task scheduling queues are achieved, and efficient management of delay tasks in a high-concurrency scene is achieved by means of the user mode lightweight scheduling advantage of the coroutine.

The application discloses a kind of based on the write optimization scheduling method of key-value storage system of coroutine, task scheduler and key-value storage system, by encapsulating write request as coroutine task, avoid operating system kernel context switching storm;Second, by introducing the queue state perception scheduling strategy for three queues, efficient overlap of processor execution phase and disk execution phase is realized, the resource utilization of processor and disk is significantly improved, and the scheduling strategy is according to the order of I / O task completion queue priority highest, post task queue second, write request queue lowest, so that the key processing path after disk persistence completion can be executed preferentially, and the next batch of write request is awakened in time, so as to reduce the overall waiting time of write request and system write delay;Third, the completion state is detected by independent I / O polling task, instead of using interrupt or callback mode, avoid the kernel state and user state switching overhead caused by interrupt processing.

The application provides a DAG-based swarm intelligence task scheduling method and system, which comprises the following steps: a leader intelligent agent analyzes production instructions to generate an initial directed acyclic graph task list; a deep-first traversal algorithm is used to calculate the predecessor node set of each process node and to cache, identify and eliminate the transitive redundant dependent edges in the initial DAG; a topological sorting is performed on the reduced task DAG based on the Kahn algorithm to generate a hierarchical execution plan; and the intelligent agent executor calls sub-intelligent agents through asynchronous coroutine groups in an isolated edge computing sandbox to drive industrial execution mechanisms for parallel operation. In addition, the system realizes cooperative cancellation and working condition continuation based on JSON checkpoints through thread-safe event flags. The application eliminates physical dependence redundancy and process hierarchical scheduling, significantly improves the production rhythm of flexible manufacturing, and guarantees hardware pose safety in a multi-machine cooperative environment through a cooperative cancellation mechanism.

The application discloses a shared resource access method and device, equipment, medium and product, relates to the technical field of efficient concurrent control and resource management in a computer system, and adopts a hybrid structure combining a lock-free ring queue and a double-ended queue. A load prediction unit is used to analyze queue data and predict a load trend, and then the queue capacity and a migration threshold are dynamically adjusted. The lock-free ring queue is preferentially used in daily use to improve access efficiency. When the queue approaches the upper limit of the capacity or triggers the migration threshold, the migration and expansion of the waiting coroutine are automatically realized through the double-ended queue, which guarantees the processing performance under high concurrency and meets the dynamic capacity demand, finally solves the technical problems that the performance and capacity of a single queue are difficult to balance under a high concurrency scenario and the single queue cannot adapt to dynamic loads, and realizes efficient scheduling of shared resources in a coroutine environment.

The application relates to a method for solving traffic spikes, comprising the following steps: S100, data receiving and basic processing; S200, threshold presetting; S300, real-time monitoring of queue state; S400, when it is monitored that the current data length of the local queue is greater than or equal to 0.9 times of the reference threshold, the exceeding multiple of the current queue length relative to the reference threshold is calculated, the number of new coroutines to be created is determined according to the exceeding multiple, a corresponding number of new coroutines are created and are put into a preset coroutine management array for unified management and control, and the new coroutines and the resident coroutine group jointly consume data in the local queue; and S500, coroutine elastic scaling: when it is monitored that the current data length of the local queue is less than or equal to 0.8 times of the reference threshold, the new coroutines in the coroutine management array are gradually closed according to a preset gradual closing rule, and only the resident coroutine group is reserved to execute a queue data consumption operation.

The present application relates to computer technology field, disclose a kind of event stream processing method, comprising: creating the scope that running coroutine code can be implemented, the scope is put into atomic operation class and is saved, so that the shared scope is held in the atomic operation class;When starting the processing instruction of event stream in message queue, according to the processing instruction, the shared scope corresponding to the current coroutine code is extracted from the atomic operation class;In the shared scope corresponding to the current coroutine code, the event in message queue is executed coroutine consumption processing, and when executing coroutine consumption processing, it is judged whether the number of events of coroutine consumption processing exceeds preset concurrency value;If not, then through the shared scope, asynchronous coroutine consumption port is generated to the event of executing coroutine processing, and the synchronous processing of event is executed using the asynchronous coroutine consumption port.The present application can avoid that system resource is occupied too high, improve the processing efficiency of event stream.

The application discloses a report efficient processing method based on RPA, and belongs to the technical field of report efficient processing of RPA, and comprises the following steps: S1: automatic login; S2: query; S3: cache; S4: processing; and S5: coroutine.The report efficient processing method disclosed by the application utilizes the coroutine technology, realizes the report continuity query function based on RPA, and after the production end module submits a query, does not need to wait for report return data, but directly queries the next report; the waiting time during the query report is utilized, the production end module continues to complete the query operation in the waiting time period, the efficiency of report query processing is improved, after multiple reports are processed, the return data is switched to the consumption end module for processing, and the continuity work of threads is realized.

The invention provides a timed task processing method and device, equipment and a medium, which are applied to the technical field of computers, and the method comprises the following steps: obtaining a to-be-executed target timed task which is not allocated with a scheduler instance; judging whether the target timed task is within the executive capability range of the current scheduler instance or not; and if the target timed task is within the execution capability range of the current scheduler instance, allocating the target timed task to the current scheduler instance, and starting a coroutine through the current scheduler instance to execute the target timed task at the multiple target physical nodes. Through the embodiment of the invention, the timed task is allocated according to the execution capability of the scheduler instance, the flexible scheduling of the timed task is improved, the coroutine is started through the scheduler instance, and the timed task is executed in parallel at a plurality of target physical nodes, so that the actual execution of the timed task does not block the main cycle of the scheduler instance, and therefore, high concurrency is realized, and the scheduling efficiency is improved. And the scheduling efficiency of the timed task is improved.

The application discloses a kind of coroutine pool scheduling management method, system, device and storage medium.The method creates corresponding coroutine task according to the service demand of application program;Then, the coroutine pool of host thread is established and initialized;Subsequently, the host thread is controlled to obtain hosting core, to start the host thread;And the coroutine task in the host thread is executed by task scheduling function.The method generates corresponding coroutine task according to the service demand of application program, and allocates hosting core for host thread according to coroutine task, can effectively distinguish the demand of different data processing tasks, implement more targeted and more fine-grained coroutine scheduling and execution control, realize the isolation of host thread and non-host thread, implement differentiated scheduling control, for multi-core processor architecture, realize the global unified resource allocation management of multiple coroutine pool.The application can be widely applied in the field of communication technology.

Embodiments of the present application provide a high-concurrency network file processing system, method, computer device and storage medium. The system comprises a DPDK data plane module configured to receive network data packets from a network card transceiver queue and store the network data packets in an MBUF memory pool; a coroutine scheduling module configured to preprocess the network data packets based on an event loop and generate corresponding files; a task dispatching module configured to add a file writing task to a task queue and assign the task to a target file cache shard according to system load conditions; a file cache module configured to receive and cache data segments of the writing task and reorder the data segments according to offset information; and an asynchronous I / O module configured to submit the reordered data to a storage device interface in an asynchronous manner. The introduction of the DPDK enables user mode direct access to the network card transceiver queue, avoids the overhead of system calls and kernel protocol stacks, and significantly improves network I / O performance.

The invention provides a multi-coroutine control method for a precise air conditioning system of a data center, which comprises the following steps: on the basis of monitoring data of each partition of the data center, constructing a continuous change characterization quantity reflecting the migration trend of cold and hot loads among the partitions; dynamically constructing and judging a mapping stable interval for each coroutine based on the continuous change characterization quantity so as to decide to maintain the current mapping or allow reconstruction; if it is judged that the current mapping is maintained, gradual cooperative adjustment is conducted on the temperature and the air volume set value of the air conditioner controlled by the corresponding coroutine in the corresponding coroutine; if it is judged that reconstruction is allowed, controlled coroutine mapping relation adjustment with minimization of system disturbance as a target is executed; the control instruction obtained through adjustment is executed, verification and closed-loop connection are conducted based on the system feedback state after the instruction is executed, and the method can adapt to a rapid load migration scene so that control jitter can be restrained on the premise that control responsiveness is guaranteed, and smooth and stable temperature control and air volume adjustment can be achieved.

This application provides a firmware boot method applicable to the field of computer firmware technology. It includes: in response to a firmware boot command, executing a first coroutine task in a coroutine task queue; upon detecting that the execution of the first coroutine task has been paused by calling a blocking interface, saving context data determined during the execution of the first coroutine task to a first stack space corresponding to the first coroutine task; determining a second coroutine task in a paused execution state from the coroutine task queue; resuming the execution of the second coroutine task based on the context data stored in a second stack space corresponding to the second coroutine task; and determining the firmware state as booted based on the execution results of multiple completed coroutine tasks. This method utilizes cooperative coroutines to concurrently execute multiple hardware initialization tasks within a single thread, and achieves non-intrusive yielding by intercepting blocking interfaces, significantly shortening firmware boot time.

The application provides a non-blocking distributed scheduled task scheduling method based on JVM, which solves the problems of too many threads and idle threads in the distributed mode on the basis of realizing the original functions completely. In order to achieve the above-mentioned purpose, the application adopts the following technical scheme: a non-blocking distributed scheduled task scheduling method based on JVM is applied to a Jvm virtual machine configured with a Kotlin language library and a coroutines coroutine library, and comprises a distributed scheduled task framework and a distributed coordination component; a general non-blocking add-delete-update-retrieve interface is arranged in the distributed coordination component as a non-blocking asynchronous callback interface of a client where the distributed coordination component is located; the non-blocking asynchronous callback interface of the distributed coordination component is encapsulated through a coroutine, and a non-blocking loop listener is arranged to realize continuous listening; and finally, a local node cache is realized based on the encapsulated coroutine non-blocking API. The performance is significantly improved through the non-blocking modification.