14 results about "Queue number" patented technology

1. Name of the product in this design: Intelligent Queue Number Dispenser. 2. Purpose of this design: For self-service queuing and number taking in the lobby. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: 3D rendering 1.

This invention relates to the field of data security technology and discloses a method, apparatus, computer equipment, and storage medium for data destruction. The method includes: acquiring the number of a first destruction queue from the previous period, the number of undestroyed data blocks, the identification information of the undestroyed data blocks, the real-time resource utilization rate of the processor, and the real-time resource utilization rate of memory; determining whether to regenerate the destruction queue based on multiple elements selected from the number of undestroyed data blocks, the real-time resource utilization rate of the processor and memory, the theoretical resource utilization rate of the processor, the theoretical resource utilization rate of memory, and a preset floating threshold; when it is determined to regenerate the destruction queue, determining the number of a second destruction queue based on the number of the first destruction queue and a preset adjustment queue number; and regenerating multiple destruction queues based on the number of the second destruction queue, the number of undestroyed data blocks, and the identification information of the undestroyed data blocks to destroy data on the target volume. This invention can improve data destruction efficiency.

The application discloses a kind of real-time database monitoring methods based on ordered queue, including according to system design throughput and machine configuration, set initial parameter respectively set working thread and distribution thread number and memory capacity alarm threshold, according to the number of working thread adjustment shunt storage queue number ensure that thread queue number match, management node starts, start receiving heartbeat request, and according to preset hash algorithm is shunted storage, new received heartbeat request is stored in ordered double linked list queue head, then according to host IP information to hash table inquires whether heartbeat record exists, if the new received heartbeat record does not exist, for new online client, client information is stored to hash table then triggers new online event and persists to client database table write-in process ends.The application solves the problem that a large amount of data heartbeat information detection detection complexity rises exponentially with data volume rising by hash and double linked list structure.

This invention discloses a dynamic optimization method for network switch port WRR scheduling resources based on convex optimization modeling. Applied to the field of switching equipment scheduling and control, it addresses the problem that existing scheduling weight configurations cannot adapt to environmental changes, resulting in unstable forwarding performance of switching equipment. This invention establishes constraint functions based on port bandwidth, token resources, and queue number, collects the arrival probability distribution of data packets in each queue within the switch port to establish a distribution model, and combines the constraint functions and the collected model to construct a convex optimization problem for switch port queue resource allocation. The objective of the optimization problem is defined as minimizing the sum of queuing probabilities of the switch queues. The problem is solved using an existing convex optimization solver, and the results are configured as the weights of each port queue based on the Weighted Round Robin (WRR) scheduling algorithm. This invention solves the problem of adaptive resource allocation during dynamic network traffic exchange, enabling network switching equipment to provide stable network performance under different service loads.

1. Name of the product in this design: Queue Dispenser. 2. Purpose of this design: For use in business locations where queuing is required, allowing users to obtain a number independently. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: 3D view 1.

The invention discloses a task processing method and device of a website and a computer program product. Relates to the field of artificial intelligence, and the method comprises the steps that a website collaboration graph of M websites of a financial institution is determined, M is a positive integer, the website collaboration graph is constructed by related data of the M websites, the website collaboration graph comprises various types of nodes and edges, and the nodes comprise at least one of website nodes, problem nodes and operation and maintenance nodes; under the condition that a website task is received, a target feature vector associated with the website task is extracted from the website collaboration map, and the website task comprises at least one of website queuing number prediction, problem occurrence probability prediction and solution recommendation; and inputting the target feature vector into the target model to obtain a processing result of the network task. Through the method and the device, the problem of low task processing efficiency of websites in related technologies is solved.

1. Name of the product in this design: Queue Number Machine. 2. Intended use of this design: for use in business halls, exhibitions, etc. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: a 3D model.

A bandwidth control device is disclosed. The bandwidth control device includes analysis circuitry to determine a user identifier (ID) associated with each of a plurality of data packets and determine a queue number each of the data packets based on the user IDs and bandwidth control circuitry to insert each of the plurality of data packets into one of a plurality of queues based on the queue numbers, generate weight information for each of the plurality of queues based on a weight value associated with each of the plurality of queues and schedule the plurality of packets to be transmitted based on the weight value each of the plurality of queues.

The invention provides a thread pool management system and method.The system comprises a collection module, a decision module, an updating module and a management module; wherein the management module comprises a construction unit, an application global unit and a state unit; and the decision module comprises a thread number calculation module and a queue number calculation module. According to the thread pool management system and method, parameters such as the core thread count, the maximum thread count and the queue number of the thread pool can be adaptively adjusted according to the load condition of the thread pool, and the management efficiency of the thread pool is improved.

The application provides a queuing simulation processing method and device, which can be used in the financial field or other technical fields. The method comprises the following steps: obtaining the arrival time and service time of a preset number of customers; performing queuing simulation according to the arrival time and service time of the preset number of customers to obtain the queuing waiting time of each customer under different queue numbers; obtaining the screening value corresponding to the different queue numbers according to the queuing waiting time of each customer under the different queue numbers and the waiting time threshold; wherein the screening value is the proportion of customers less than the waiting time threshold or the proportion of customers greater than the waiting time threshold; and obtaining the optimal queue number according to the screening value corresponding to the different queue numbers. The device is used to execute the above method. The queuing simulation processing method and device provided by the embodiment of the application improve the efficiency of determining the appropriate queue number.

The invention relates to the technical field of virtualized network acceleration, in particular to a high-performance virtualized network data plane acceleration method based on DPDK and SR-IOV, which comprises the following steps: recording VF channel interruption time, queue number and buffer area state, calculating interruption interval to identify high-frequency interruption, acquiring polling frequency and thread number to judge whether overload occurs or not, and executing the step of executing the step of executing the step of executing the step of executing the step of executing the step of executing the step of executing the step of executing the step of executing the step of executing the step of executing the step. According to the method, the interrupt triggering information is recorded and the interrupt frequency is analyzed, so that the high-frequency interrupt state is dynamically identified, the interrupt monitoring relation is reconstructed and the forwarding path is updated to map, and the interrupt monitoring relation and the forwarding path are updated to configure a redirection thread identifier. The dynamic adjustment of a data forwarding structure is completed, the efficient cooperation of interrupt response and data processing is ensured, the throughput and processing stability of a network in a high-concurrency scene are improved, the resource scheduling flexibility is enhanced, and the data plane performance in a virtualization environment is optimized.

The invention relates to a data migration method and device, electronic equipment and a storage medium. The method comprises the steps of obtaining a to-be-migrated database marked with a to-be-migrated label; constructing a migration task queue, and sequentially adding the to-be-migrated data into the migration task queue according to a preset priority; generating an encryption key according to the queue number of the to-be-migrated data in the migration task queue, and encrypting the to-be-migrated data by using the encryption key; determining a target database corresponding to the to-be-migrated database and a target storage area corresponding to the target database, and transmitting the encrypted data to the target database, so that the target database decrypts the encrypted data by using the encryption key; and storing the decrypted to-be-migrated data to a target storage area corresponding to the target database. Effective migration of the data is achieved, the problems that when an existing local storage database container is migrated, the data is lost and depends on a specific synchronization mode are solved, and higher universality and flexibility are achieved.

1. Name of the product in this design: Intelligent Queue Number Dispenser. 2. Purpose of this design: For self-service queuing and number taking in the lobby. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: 3D view 1.

1. Name of the product in this design: Queue Dispenser. 2. Purpose of this design: For self-service ticket retrieval in public places such as hospitals, banks, and government offices. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: 3D view 1.