81 results about "Polling" patented technology

The invention discloses a task scheduling method and device for attention calculation, a medium, equipment and a product. The method comprises the steps that a loading task of a query block is decomposed into N1 loading subtasks, and a calculation task of a jth attention score block is decomposed into N2 calculation subtasks; decomposing an updating task of a middle accumulation block corresponding to the attention output block in the current iteration round into N3 parallel updating sub-tasks; asynchronously submitting all the subtasks to different task slots of N4 synchronization channels; and performing polling operation on the task slot in each synchronization channel to execute the sub-tasks stored in the task slot, and controlling an execution time sequence among the sub-tasks with the dependency relationship in each synchronization channel by configuring a number threshold value of the uncompleted sub-tasks in the waiting instruction. According to the method, the covering capability and the parallel computing capability of hardware can be improved, and the attention computing efficiency is further improved.

The invention discloses a message issuing speed control method and system based on an AI large model. The method comprises the steps of collecting multi-source data in real time and constructing a multi-dimensional fusion feature vector; based on the BERT-CNN distillation architecture, detecting abnormity and executing hierarchical fusing; based on the fusion feature vector, using a reinforcement learning model to predict message issuing rates of a plurality of time windows in the future and dynamically adjusting priorities; in the offline stage, a mixed integer programming model is adopted to generate minimum cloud resource cost, and in the online stage, a deep reinforcement learning model is adopted to carry out real-time resource fine tuning; based on the node health degree, calculating a traffic allocation weight through a smooth weighted polling algorithm so as to carry out load balancing; different business scenes are adapted through domain adversarial training and multi-task learning, and different languages are adapted through multi-language BERT coding. The message rate is accurately controlled to improve the system stability and the resource utilization rate; low-cost scheduling fine tuning of cloud resources is realized; various business scenes and languages can be quickly adapted, and the development cost and time are reduced.

The invention provides an equipment state switching method and device, electronic equipment, a storage medium and a program product, and is applied to the technical field of computers. In response to the switching of the target device from the interrupt state to the polling state, adjusting the number of data packets subjected to (N-1)-th polling processing based on the state information of the cache queue after the data packets in the cache queue complete the (N-1)-th polling processing to obtain a first number; in response to completion of Nth polling processing on the data packets in the cache queue according to the first number, adjusting the first number again to obtain a second number; under the condition that the second number is determined to be greater than or equal to the number of the data packets in the cache queue after the Nth polling processing, in response to completion of the (N + 1) th polling processing on the data packets in the cache queue according to the second number, switching from the polling state to the interruption state; or switching from the polling state to the interruption state under the condition that the first environment information of the running environment in which the cache queue is located during the Nth polling does not meet the preset condition.

The invention discloses a state polling method and device based on an asynchronous task and cache and a medium, and relates to the field of data processing.The method comprises the steps that in response to receiving of an execution request for time-consuming operation, a unique task identifier associated with the time-consuming operation is generated; starting the time-consuming operation as an asynchronous task; storing an initial state associated with the unique task identifier in a preset cache; returning the unique task identifier and the initial state to a requester executing the request; in response to the received state query request comprising the unique task identifier, retrieving a current state associated with the unique task identifier from a preset cache; and returning the current state to a requester of the state query request, wherein the asynchronous task is used for updating the current state associated with the unique task identifier in the preset cache in the execution process or after the execution is completed. According to the invention, the problem of resource waste caused by long-time occupation of server resources can be effectively solved.

A system and method for using a semi-polling model to monitor a Non-Volatile Memory Express (NVMe) completion queue (CQ). The method, implemented at an interrupt thread, includes receiving an input / output (I / O) request from an application and submitting a submission queue (SQ) entry into an NVMe SQ in response to the I / O request. The method further includes registering for notifications from a polling thread after submitting the SQ entry and receiving, from the polling thread, a notification of the presence of a CQ entry within an NVMe CQ. Additionally, the method involves removing the CQ entry from the NVMe CQ and notifying the application of completion of the I / O request.

The embodiment of the invention provides an interrupt transmission method and device, equipment, a medium and a program product. The method comprises the following steps: a universal serial bus (USB) host acquires a polling frame count value corresponding to at least one processing endpoint; determining the minimum count value in the polling frame count values corresponding to the at least one processing endpoint as a target polling frame count value, and determining the processing endpoint corresponding to the target polling frame count value as a target endpoint; when it is determined that the target polling frame count value is matched with the frame count value in the register, transmission is interrupted through the target endpoint and the USB device, and according to the polling interval corresponding to the target endpoint, the polling frame count value corresponding to the target endpoint is updated; the frame count value represents the number of frame start packets sent by the USB host. According to the method provided by the embodiment of the invention, the resource consumption is reduced.

The application discloses a state polling method and device based on an asynchronous task and a cache, and a medium, relates to the field of data processing, and the method comprises the following steps: in response to receiving an execution request for a time-consuming operation, generating a unique task identifier associated with the time-consuming operation; starting the time-consuming operation as an asynchronous task; storing an initial state associated with the unique task identifier in a preset cache; returning the unique task identifier and the initial state to a requester of the execution request; in response to receiving a state query request comprising the unique task identifier, retrieving a current state associated with the unique task identifier from the preset cache; and returning the current state to a requester of the state query request. The asynchronous task is used for updating the current state associated with the unique task identifier in the preset cache during the execution process or after the execution is completed. The application can effectively solve the problem of long-time occupation of server resources, causing resource waste.

Systems and methods for determining and reporting actual utilization of a core of a central processing unit (CPU) of a host. Prior to implementation of aspects of the present disclosure, running a poll querying endpoints of a process for work appears to the host's operating system as busy work (e.g., taking full use of the core for the poll duration). However, only a percentage of the duration of the poll is used to process a task of the process, where the remaining duration of the poll is spent querying the endpoints (idle time) and the core is not performing a task. Accordingly, a core utilization reporting system and method automatically detects the processing time of the tasks of a process, determines actual CPU utilization of the core based on a percentage of the time the core is busy polling (doing effectively no work) versus doing actual work (processing a task).

The invention discloses a monitoring protection expansion system and a monitoring protection method for an RISC-V memory sensitive area and application. The invention discloses a monitoring protection method for an RISC-V memory sensitive area, and the method achieves the monitoring protection through the configuration of monitoring parameters and the polling scanning of the memory sensitive area, the detection of tampering and the processing of abnormity. Comprising the steps that 1, a kernel calls a monitor configuration instruction to configure monitor state parameters and a monitored area; 2, the processor receives and transmits the configuration parameters to the monitor for processing analysis and verification, if the configuration parameters are legal, the configuration parameters are written into the control state register and the exclusive memory space of the monitor, and otherwise, the monitor is closed; 3, the processor calls a monitor to execute a scanning process according to a set instruction interval when an interval condition is met; step 4, the monitor checks the value and address mapping of the monitored area, and performs processing according to a preset exception processing strategy when an error occurs; 5, after the scanning process is completed, the monitor executes ending emptying state operation, and the system program is returned to execute the main process. The invention further discloses a monitoring protection extension system for implementing the method, and the system has wide application value.

The invention relates to the technical field of data processing, in particular to a weighted polling method, a data synchronization method, a manufacturing execution system and equipment. In the weighted polling method, a first operation value is calculated through a first calculation strategy according to the total weight; wherein the total weight is the sum of the weights of all the objects; traversing all objects allowed to be scheduled, and performing bit operation by utilizing the first operation value, the bit mask of the current object and the second operation value until the first operation value is determined to be matched with the bit mask of the current object, and taking the current object as a target object to be scheduled; wherein the second operation value is obtained according to the bit mask of the current object. According to the method, bit operation is used for replacing traditional division, multiplication and modular operation, the calculation complexity is extremely low, and especially in a high-performance distributed environment, the efficiency of data synchronization and object (server) request distribution can be improved. According to the method and the device, extremely low calculation complexity and excellent performance can be provided in a high-performance load balancing scene.

The invention discloses a system certainty enhancement method, which comprises the following steps of: S1, defining a core judgment reference: defining a key CPU (Central Processing Unit) and a key real-time task, detecting the ready states of the key CPU and the key real-time task, and if the ready states exist, triggering a periodic forced scheduling mechanism; s2, deterministic transformation of a scheduler: cutting unnecessary paths, simplifying a user mode preemptive path, and providing an SMP forced scheduling mechanism and a silent background thread; step S3, real-time interrupt processing: key interrupt is set as a high priority, a key CPU is isolated, the bottom half part is limited, and a periodic forced scheduling mechanism is activated; step S4, protocol stack determinacy transformation: optimization is carried out from four aspects of NAPI polling, congestion fragmentation, Qdisk delay and filtering rules; step S5, priority signal processing; and step S6, deterministic transformation of the container: releasing CGroup limitation, binding a key CPU, forbidding NAT and port mapping, using a native IO and closing a non-core daemon process.

The present application relates to the technical field of data pushing, in particular to a method for pushing and real-time previewing and updating of stream file operation based on SSE, which comprises the following steps: collecting a cursor associated sequence, performing comparison, extracting density characteristics, matching and determining a threshold interval, determining length, establishing a pushing load, merging a ratio quota, generating a cursor latching instruction, monitoring an instruction state, grabbing a character bottom layer code, comparing a preset escape sequence, obtaining a truncation identifier, extracting a pre-node end code, combining a full-zero state span value, performing numerical operation, and generating a view rendering signal.In the present application, the transmission slice length is dynamically controlled by frequency comparison combined with interval threshold to construct the load, the quota is compared by table lookup to prevent resource exhaustion and blockage, the bottom layer storage bit XOR span analysis is used to accurately locate the truncation boundary to trigger cross-section rendering, and fixed polling redundant communication overhead and server connection waste are eliminated, thereby ensuring low-latency delivery of batch stream file change data and smooth redrawing and rendering of the front-end page.

The invention discloses a CAN bus hybrid scheduling and fault-tolerant communication method and system for multi-module equipment, and the method comprises the steps: receiving and confirming an instruction of an upper computer in real time through a hardware interruption mechanism, and endowing the instruction with the highest priority through an event-driven task; serial polling communication is executed on a plurality of lower computer modules based on the state machine model, and different fault-tolerant strategy parameters including the maximum number of retry times and timeout are called according to instruction types; in a response receiving stage of the lower computer module, establishing an application layer session verification mechanism based on a two-factor session verification mechanism of an identifier and a data field; and under the condition that the lower computer module has no response, fault isolation is realized by adopting a limited number of retry and fault node skipping strategy, and system-level communication blockage is prevented. Compared with the prior art, the real-time performance, the certainty and the robustness of multi-device CAN bus communication are remarkably improved, and the method is suitable for the fields of power supply control, embedded systems and the like.

The invention relates to a verification method and device, electronic equipment, a storage medium and a program product, and relates to the field of chip verification, the method comprises the following steps: using a to-be-verified model to carry out arbitration operation, and outputting a first result; calling a target reference model, and simulating an arbitration behavior of the to-be-verified model through queue polling by taking an arrangement sequence of request channel numbers in a first queue of the target reference model as a polling sequence to obtain a second result; and comparing the first result with the second result, and determining a verification result. According to the embodiment of the invention, complex time sequence level modeling is avoided, the target reference model takes the arrangement sequence of the request channel numbers in the first queue as a polling sequence, and the arbitration behavior of the to-be-verified model is simulated through queue polling, so that the to-be-verified model is fully verified, and the verification complexity and investment cost are greatly reduced.

The application discloses a kind of interrupt fault tolerance and acceleration response method under heterogeneous platform, including, in interrupt service program, response accelerator message signal interrupt, read the first interrupt state indicating data transmission completion and the second interrupt state of user logic interrupt request, if both are no interrupt, be identified as user logic interrupt, increment kernel state interrupt count value, if second state has interrupt request, also increment count value, if the first state shows data transmission completion, then handle as data transmission interrupt;In application layer thread, obtain kernel state interrupt count value, compare with application layer processing count value, if kernel state count value is greater than application layer count value, send data to accelerator and increment application layer count value, if equal, thread hibernates first preset duration and retry, the application cooperates with application layer, solves interrupt loss problem, uses IOCTL polling acceleration response, and ensures system stability by intelligent hibernation.

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 invention discloses a method for realizing polling. The method comprises the following steps: receiving triggering of polling trigger configuration; aPI request configuration information and polling rule configuration information are received. The API request configuration information is used for configuring an API request needing to be sent during data polling, and the polling rule is used for configuring attributes related to polled data; based on the API request configuration information and the polling rule configuration information, a polling trigger is generated, and the polling trigger is used for achieving a data polling function corresponding to the API request configuration information and the polling rule configuration information. By means of the scheme, if a user hopes to achieve the polling function for the data, software codes do not need to be written manually, the user only needs to trigger the polling trigger configuration operation and input the API request configuration information and the polling rule configuration information, and the efficiency of achieving the polling function is improved.

The invention discloses a process-level power consumption analysis method and device, electronic equipment and a storage medium, and relates to the technical field of computers.According to the process-level power consumption analysis method and device, due to the fact that an event-driven monitoring mechanism deployed in an operating system kernel is adopted to achieve accurate capture and time metering of process execution events, the process-level power consumption analysis efficiency is improved; therefore, delay and sampling omission caused by a polling mechanism are avoided, extra overhead caused by frequent system calling is remarkably reduced, and therefore the technical problems that an existing process-level power consumption monitoring method is poor in real-time performance and large in data updating delay, and short-life-cycle processes are omitted in a sampling interval can be solved. The technical effects of high real-time performance and high-precision monitoring of process energy consumption and meeting of the requirements of edge computing and other scenes for refined management of system energy efficiency are achieved.

Examples described herein provide a computer-implemented method that includes generating an extended hot line table that tracks cross-core contended cache lines for multiple processors of a processing system based on cache requests, the extended hot line table storing at least metadata for a cross-core contended cache line. The method further includes polling, using firmware, the extended hot line table in each of the multiple processors of the processing system to identify contention information. The method further includes aggregating the contention information from each of the multiple processors to generate aggregated contention information. The method further includes processing subsequent cache requests using the aggregated contention information.

The invention relates to the technical field of API (Application Program Interface) data processing and machine translation, and discloses a precise translation and asynchronous blocking processing method for API response body content, which comprises the following steps that: a tree path encoder identifies a field to be translated by utilizing a reflection mechanism; and generating task metadata containing a path vector of the to-be-translated field in the JSON nested structure according to a path coding formula. The identifier generator and the serializer generate a global request serial number and task snapshot data and distribute asynchronous tasks. A regular cleaner generates a cleaned text, and a semantic compensation extraction algorithm executes logic truncation and splices a semantic compensation window to generate a to-be-translated input sequence. And the thread pool concurrently schedules a third-party engine to obtain translation blocks, and the structure reconstruction engine executes in-situ backfilling to generate a translated response body after eliminating redundant translation contents. And the exponential backoff retry device processes the exception, and the callback polling module adopts a double-track delivery strategy to deliver the result. The problem of context deficiency is solved, and translation continuity is guaranteed.

This application discloses an electric cylinder control method, system, and storage medium, belonging to the field of electric control technology. The electric cylinder control method includes establishing a three-level hierarchical architecture of host computer-controller-driver, which completes a closed loop from instruction issuance and logic processing to power execution; dividing the CPU's runtime of the host computer into several fixed time slices and configuring the time slices; using a timer to enable the controller to generate a reference clock and configuring the reference clock; based on the three-level hierarchical architecture, performing time slice polling scheduling according to the reference clock and the time slices to achieve control of the electric cylinder by the driver; by adopting time slice polling scheduling, without relying on an expensive real-time operating system, and due to the matching of the reference clock and the time slices, it effectively ensures the stable switching of the driver's cyclic start, run, and stop state machines, as well as the real-time performance of multi-task concurrent processing in actual use.

The invention discloses a polling arbitration method and device supporting access of multiple master control peripheral devices, and the method comprises the steps: monitoring an access request of the master control devices to a target resource, judging whether the target resource can be arbitrated or not according to an arbiter enable signal when the access requests of the multiple master control devices to the target resource are detected at the same time, and if yes, judging whether the target resource can be arbitrated or not; if the target resource can be arbitrated, determining an arbitration mode according to the mode selection signal, selecting a corresponding arbiter to arbitrate the plurality of main control devices according to the determined arbitration mode so as to enable the main control devices to access the target resource according to an arbitration authorization sequence, ending and exiting; otherwise, not authorizing access to all the main control devices. The arbitration mode can be determined through the mode selection signal, fusion of multiple arbitration modes can be achieved, the effect of the multiple arbitration modes is achieved, the arbitration modes and the arbiter can be expanded according to needs, and the advantages of being good in expansibility and high in flexibility are achieved.

The application relates to a request arbitration method and an arbitrator, and belongs to the technical field of data processing. The request arbitration method comprises the following steps: acquiring a first array representing input requests of each input channel at a current time, the number of elements in the first array being consistent with the number of input channels; and arbitrating an input request with the highest current priority according to the first array and a preset two-dimensional array representing priority relationships of each input channel, wherein the priority relationships of each input channel in the two-dimensional array are configurable, the number of elements in each row or each column of the two-dimensional array is consistent with the number of elements in the first array, and each row or each column of the two-dimensional array represents a priority comparison result of a specified input channel and each input channel. The application no longer adopts a polling mode, but performs arbitration based on the two-dimensional array with the configurable priority relationships of the input channels, so that the defect that the polling method cannot be dynamically changed during polling after the priority is determined is improved.

The application provides a tool software running method, device, equipment and medium, whether the front and background task scheduling of tool software appears abnormal situation is detected, if the front and background task scheduling appears abnormal situation, the state information of system task is read, whether the scheduling condition of task function is met is judged according to the first running interval and the first execution period, if the scheduling condition of task function is met, the task function is called. That is, when the front and background task scheduling appears abnormal situation, the task function is called to avoid the situation of always executing a certain task, thereby ensuring the stability of software running. At the same time, the process of calling the task function belongs to the time slice polling mode, the execution time of CPU can be divided into blocks, and the execution state time is short enough, so that the effect of multitasking can be realized, the CPU single running occupation time is reduced, and the software running efficiency is greatly improved.

The invention relates to the technical field of resource management, in particular to a software resource dynamic management method and system. According to the method, a multi-dimensional physical performance evaluation system is established by fusing the frequency of the central processing unit, the bandwidth of the disk and the state of the network buffer, so that the integrating degree of a resource allocation decision and an actual load of underlying hardware is greatly improved; a fluctuation residual set is constructed by using response delay jitter, verification integrity and instruction period deviation, and an information entropy quantization algorithm is introduced, so that the disorder degree and the uncertainty risk of the operation behavior of the storage node are accurately captured; a dynamic security reference line is determined by referring to a cluster whole deviation degree mean value, so that an outlier sub-health server can be effectively identified, state identification overturning is executed, and a penalty factor and a deviation multiplying power reciprocal are combined to generate a weight adjustment factor to endow a storage cluster with a Byzantine fault self-repairing capability. And a software resource scheduling weight and decline polling assignment mechanism ensures that the high-reliability and high-performance node bears a core service request.

The present disclosure provides for a system (100) and method (250) that facilitates a robust and effective solution to an entity or an organization by enabling ingestion and processing of a set of data packets corresponding to large streaming and batched data in a big data eco-system that may be fast and may provide optimal throughput, rate control, throttle and embedded fault tolerance. The system (100) is equipped with a data ingestion module (110) to receive the set of data packets and extract a set of attributes pertaining to the nature of data from the set of data packets received and then poll a plurality of second computing devices (104) based on the set of attributes extracted; and, upon establishing polling, store the set of data packets in the plurality of second computing devices (104).

The invention discloses a database blocking event processing method and device, equipment, a medium and a product, relates to the technical field of data processing, and aims at solving the problem that a blocking event processing suggestion is unreasonable and inaccurate due to the fact that a timing polling mode is large in delay. The method for processing the database blocking event comprises the following steps of: subscribing a lock and an original transaction event on an instance side in real time, and sequentially writing the lock and the original transaction event into an additional buffer area by adopting a local timestamp of an instance to form a continuous lock event sequence; dividing the continuous lock event sequence into a plurality of time slices by a sliding time window with a first time length, and constructing a three-layer space-time lock graph in each time slice; and on the basis of the three-layer space-time lock graph, a graph neural network is combined with heuristic search to generate a processing suggestion of the blocking event.

The invention provides a distributed lock control method and device, equipment, a medium and a product, relates to the technical field of computers, and can consider saving of computing resources and keeping of data consistency. According to the specific technical scheme, a plurality of service threads aiming at a target resource service are obtained; and adding a distributed lock to the target thread, and starting a monitoring thread configured for the distributed lock. And polling the completion condition of the target thread according to the polling interval duration of the monitoring thread, and prolonging the validity period of the distributed lock under the condition that the target thread does not complete service resource processing. And releasing the distributed lock of the target thread and ending the monitoring thread on the basis of the prolonged validity period under the condition that the target thread completes service resource processing. On one hand, the validity period and the polling interval duration are adjusted according to the service load rate to save computing resources, and on the other hand, the validity period of the distributed lock is automatically prolonged to keep data consistency.

The invention relates to the technical field of distributed database middleware, and particularly provides a sequential-control single-library sub-table dynamic management method and device.Firstly, cross-service timed task sequence control is achieved through state marking and polling check, preferential execution of newly-added sub-table operation is achieved, then a ShardingSphere node dynamic refreshing mechanism is triggered, and a sub-table dynamic refreshing function is achieved; the routing rule is ensured to take effect in real time; then, bypassing a ShardingSphere routing engine through a Dynamic-Data assembly to realize physical isolation, and annotating a direct connection target library to execute a DDL operation by using an (at) DS; and finally, dynamically updating the configuration file in which the ShardingSphere configuration information is stored, and realizing increment sub-table range writing during operation. Compared with the prior art, a dynamic updating mechanism of the configuration file can be realized, and the condition that the fragmentation rule is consistent with the running state after the service is restarted is ensured.

The invention provides a supercomputing task execution method, a control device, a storage medium and a cluster system, and belongs to the technical field of supercomputing. The method comprises the following steps: based on an established communication mechanism, a workstation requests a server side to obtain all resource information of the supercomputing cluster; the server side responds to the request information of the workstation and replies all resource information of the supercomputing cluster; the work station calculates a resource polling table and a resource arbiter which accord with the supercomputing cluster and synchronizes the resource polling table and the resource arbiter to the server side; the server side receives the information and confirms the information; and after the supercomputing cluster enters a ready state, the workstation issues supercomputing task execution requests in batches according to application requirements, and the server side executes corresponding supercomputing tasks according to the resource polling table and the resource arbiter. According to the method, the reasonability of resource selection can be ensured through the resource polling table and the resource arbiter, so that all server resources of the supercomputing cluster can be reasonably distributed.