124 results about "Polling" patented technology

A mechanism for managing data communications is provided. A circularly arranged set of buckets is disposed between input buffers and output buffers in a networked computer system. Connections among the system and clients are stored in the buckets. Each bucket in the set is successively examined, and each connection in the bucket is polled. During polling, the amount of information that has accumulated in a buffer associated with the connection since the last poll is determined. Based on the amount, a period value associated with the connection is adjusted. The connection is then stored in a different bucket that is generally identified by the sum of the current bucket number and the period value. Polling continues with the next connection and the next bucket. In this way, the elapsed time between successive polls of a connection automatically adjusts to the actual operating bandwidth or data communication speed of the connection.

The invention discloses a kernel integrity detection method based on Xen virtualization. According to the method, a kernel integrity detection system is utilized to detect kernel integrity of a virtual machine operation system which is operated on a Xen virtualized platform; a memory mapping part, an information acquisition part and a safety detection part are arranged on a Dom 0 of the system, wherein the memory mapping part provides an interface for acquiring machine byte data of a hardware level of a Dom U; the information acquisition part deploys the machine byte data, acquired by the interface provided by the memory mapping part, of the hardware level of the Dom U, and converts the machine byte data of the hardware level into information of the level of the operation system according to the version of the operation system in the Dom U; the safety detection part calls kernel key data, acquired by the information acquisition part, of the operation system in the Dom U in a polling mode, and judges whether kernel integrity of the operation system in the Dom U is damaged or not according to safety policies of the system. According to the method, the detection system is deployed outside a monitored system, and therefore the safety of the detection system is guaranteed, and meanwhile kernel integrity of the monitored system is detected.

The invention provides a task scheduling processing system and method for an embedded real-time operating system. The system comprises a processor, a timer, an interrupt controller, a scheduler and anSVC switching module, wherein the timer, the interrupt controller, the scheduler and the SVC switching module are arranged in the processor. The scheduler comprises a priority scheduler and a time slice polling scheduler; according to the invention, a scheduling mode based on priority preemption is adopted; the right to use of the CPU is always allocated to the currently ready task with the highest priority; the tasks with the same priority are scheduled according to a first-in first-out sequence; and meanwhile, a time slice polling scheduling mode is adopted as a supplement of a priority preemption scheduling mode, so that the problem that the real-time performance of a processor system is reduced due to the fact that a plurality of ready thread tasks with the same priority share a processor can be coordinated, and the problem of task processing of a plurality of ready threads with high priorities is improved.

A method, system and product for detecting firmware vulnerabilities, including, during a testing phase of a firmware of a device, continuously polling states and activities of the device, wherein said polling is at a testing agent that is functionality separate from the firmware; correlating between at least one event that is associated with the states or the activities of the device and test results of the testing phase; based on said correlating, determining for the firmware one or more normal events and one or more abnormal events; and after the testing phase, providing indications of the one or more normal events and one or more abnormal events from the testing agent to a runtime agent, whereby said providing enables the runtime agent to protect the firmware from vulnerabilities associated with the one or more abnormal events.

A segmented subsystem, for use within an automated test platform, includes a first subsystem segment configured to execute one or more instructions within the first subsystem segment. A second subsystem segment is configured to execute one or more instructions within the second subsystem segment. The first subsystem segment includes: a first functionality, a second functionality, and a status polling engine. The status polling engine is configured to: determine a first status for the first functionality and a second status for the second functionality, and generate a consolidated status indicator for the first subsystem segment based, at least in part, upon the first status for the first functionality and the second status for the second functionality.

The invention discloses an MEC-oriented distributed service scheduling method, which comprises the following steps of: for any service in a service set, determining M MEC servers closest to the service according to a shortest route algorithm, adding the M MEC servers into an available MEC server set; for any service in the available MEC server set, determining, by using a polling mode, whether the jth computing resource on each server is idle or not at an i moment; if the jth computing resource is idle, allocating the computing resource to the service; and in the same way, performing the same process on the j+1th computing resource to the Jth computing resource, obtaining the resource allocated to the service on each MEC server, namely the size of task segmentation, determining the starting time and the ending time of the service, and calculating the completion time of all the services. According to the method, the service segmentation problem and the MEC resource allocation problem are fused together for joint optimization, the computing resources of the servers are fully utilized, the load between the servers is balanced, and the queuing waiting time of the terminal is reduced.

The invention discloses a read-write balanced blocking queue implementation method and device, and relates to the field of computer software programming. The method comprises the following steps that N data are added to a queue, and a synchronous lock of the queue is tried to obtain; whether the N data can be added to a synchronous blocking queue or not is determined, and wait is continued if the queue exceeds the maximum setting range after the N data are added until the queue allows N records to be added; the queue throws exception if the N exceeds the maximal length of the queue; after the N data are added to the synchronous blocking queue, the procedure of data adding is completed, and the synchronous lock of the queue is released; addition is continued or given up to complete the procedure of the addition; continuous addition is given up, and the addition procedure is finished. According to the read-write balanced blocking queue implementation method and device, sudden, non-continuous and non-quantitative large scale data processing pressure can be released effectively, the call logic of data queue can be simplified, risks of multithreading polling data are removed, and the stability of application programs for processing sudden large data volumes is improved.

The invention discloses a workflow scheduling method, and the method comprises the following steps: if a scheduling request is detected, determining a management server corresponding to the schedulingrequest, determining a workflow to be executed corresponding to the scheduling request based on the management server, and inserting the workflow to be executed into a preset polling table; and determining a target actuator, and obtaining and executing a target workflow from the preset polling table based on the target actuator. The invention further discloses a workflow scheduling device and system and a computer readable storage medium. According to the invention, the scheduling function of the management server is issued to the actuator; when a scheduling request is detected; the corresponding management server inserts the workflow to be executed corresponding to the scheduling request into a polling table; according to the invention, the complexity of the management server is reduced,the target executor actively obtains and executes the target workflow from the polling table, and the management server does not need to cache a series of data, thereby achieving the lateral extension of the management server, and improving the scheduling intelligence.

The invention discloses an equipment restarting method and device, equipment and a medium, and the method comprises the steps: triggering a restarting command for the equipment, and transmitting the restarting command to a BMC; when the BMC receives the restart command, triggering GPIO interruption in a CPU through the BMC, and then sending a cleaning start signal to an upper application through acorresponding interruption service; and when the upper-layer application receives the cleaning starting signal, executing a system cleaning operation before restarting, and then restarting the equipment. The GPIO interrupt is triggered through the BMC, so that the cleaning starting signal can be sent to the upper-layer application through the interrupt service, the effect of quickly cleaning thesystem is achieved, the situation that in the prior art, repeated polling needs to be conducted in the restarting process is avoided, occupation of system resources is reduced, and high real-time performance is achieved.

The invention relates to a dynamic weight load balancing method based on Nginx. The method comprises the following steps: acquiring hardware performance of each back-end server node in a no-load state; calculating a hardware influence weight; solving the weight of each server node in a no-load state according to the hardware performance and the hardware influence weight, and taking the weight as the initial weight of a dynamic weight load balancing algorithm; periodically acquiring load information of each back-end server and calculating the use ratio of each piece of hardware; calculating a hardware average performance reference according to the hardware performance; calculating the residual load of each node according to the use ratio of each hardware and the average performance benchmark of the hardware; solving a final weight; allocating a corresponding load to the server according to the final weight; according to the method, the dynamic weight load balancing algorithm based on the weighted polling algorithm is established, so that the dynamic change of the weight is realized, and the problem that the traditional load balancing algorithm cannot change the weight according to the load of the back-end server to cause load imbalance is solved.

The embodiment of the invention discloses a method and a device for realizing load balancing. A specific embodiment of the method comprises the following steps: acquiring a server information list; responding to the received access request, and determining a target area from the at least one area; based on the target area, executing the following polling steps: polling a plurality of nodes in thetarget area according to a balance tree corresponding to the target area, and determining whether the target area comprises available nodes or not; in response to determining that the target area comprises available nodes, taking the obtained first available node as a target node; sending the access request to a server corresponding to the target node; and in response to determining that the target area does not include the available node, determining a new target area according to the server information list, and continuing to execute the polling step. According to the embodiment, the forwarding delay is reduced, and the forwarding efficiency is improved.

The invention discloses a Java automatic code issuing method based on a Struts2 frame. The method comprises the following steps: S1) firstly collecting online files and catalogues to be issued; S2) executing the automation incremental backup through host polling; and connecting the host through the iteration, and executing an application engineering backup script on the host to realize the total backup of the engineering application on the remote host; S3) uploading the newly issued online file from the local to an application catalogue of a remote server, and realizing the incremental synchronous production; and S4) while the uploading of all host files is over, restarting a remote application by calling a script file on the remote host. The provided Java automatic code issuing method based on the Struts2 frame is capable of realizing the automation of an issuing link through using a Java program, effectively preventing the mis-uploading and the uploading leakage of an online process,and greatly reducing the working strength.

The invention discloses an edge computing scheduling algorithm and system. The edge computing scheduling algorithm comprises the following steps: acquiring X computing tasks and determining the priority of each computing task; distributing the X computing tasks to queues with different priority levels according to the priority levels to form Y ready queues with different priority levels; executingthe tasks in the priority ready queues for different optimal level queue execution time Ty, pausing the tasks if the tasks are not completely executed in the Ty, putting the tasks at the tails of thepriority ready queues to queue again, and selecting n optimal edge computing nodes when each task is executed. Tasks with different priorities are located in different queues and are executed in a polling mode, and the tasks cannot be blocked for a long time, thus guaranteeing that all the tasks are normally executed. According to the edge computing scheduling algorithm and system, the service capability of the edge computing nodes is quantified, and it is guaranteed that the user task selects the optimal node to be executed.

The invention relates to a kafka-based stacked data consumption method, terminal equipment and a storage medium, and the method comprises the steps: carrying out the polling calculation of a difference value between a latest offset and a current offset of a topic under each partition in each unit time, storing the difference value, and judging whether the topic is in a delay state or not, and carrying out the marking; when a consumption request for the topic is received, judging whether the topic is in a delay state or not, if so, creating a plurality of downstream topics, and averagely distributing the accumulated data to be consumed to all the downstream topics; and according to the total thread count and the number of the partitions, after the remaining non-consumed offset of each partition is averagely segmented according to the total thread count, the remaining non-consumed offset is allocated to each thread for consumption. According to the method, the number of the top partitions can be flexibly increased, and the data throughput in the service peak period can be increased.

The invention relates to the technical field of computer information, provides a configuration separation device based on a galaxy framework and an implementation method, and aims to solve the time problem of the manual intervention stage. The main scheme comprises the following steps: defining a timed polling method G, and obtaining an environment variable E containing a path and a file name of a stored configuration file D by the method G; using the method G to obtain a comparison result by comparing the value of the historical modification time T1 of the configuration file with the modification time T2 of the stored configuration file D, synchronizing the information of the configuration file D to the local cache file F according to the comparison result, calling and starting the script method B after the local cache file F is refreshed, obtaining the information of the latest local cache file F by the script method B, updating the information of the latest local cache file F, and further loading the configuration file information in the local cache file F into the system A, and completing cache file refreshing of the configuration file.

A method is implemented by a network device for orchestrating execution of a polling thread of a software-based switching program on a heterogeneous multicore processor. The method includes causing the polling thread to be executed on a first processing core in a first cluster of a plurality of clusters of processing cores, determining a value indicative of a number of active processing cycles used by the polling thread, determining whether the value is higher than a high threshold associated with the first processing core or lower than a low threshold associated with the first processing core, and if so causing the polling thread to be moved to a second processing core in a second cluster of the plurality of clusters, where the second processing core has a different processing capacity than the first processing core.

A system for polling components is disclosed that includes a plurality of processors and a control system configured to interface with each of the plurality of processors, and to 1) poll each of the plurality of processors using a first polling loop and 2) transfer one of the plurality of processors to a second polling loop if the one of the plurality of processors is non-responsive to the poll.

The invention discloses a batch task processing method and device and a computer readable storage medium. The method comprises the steps that at least one target task is triggered in a centralized mode in a preset mode, the preset mode comprises one of a polling mode and a timing mode, the polling mode is a mode of executing task triggering every preset period, and the timing mode is a mode of executing task triggering according to task triggering time points preset according to service requirements; the at least one target task is analyzed to obtain an execution mode of the at least one target task, and the execution mode comprises one of a concurrent mode and a non-concurrent mode; and executing at least one target task based on the execution mode. The technical problem that the task processing efficiency is reduced due to the fact that centralized timing scheduling under multiple nodes cannot be supported at the same time in the prior art is solved.