25 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 provides a queuing and calling method and device, equipment, a storage medium and a program product, and relates to the field of artificial intelligence. According to the method, when a queuing machine generates a queuing number for a target user of a to-be-handled service, pedestrian features of the target user are extracted based on a pedestrian re-identification model according to an authorized image corresponding to the target user, and target features are obtained; when it is determined that the predicted waiting time corresponding to the target user is smaller than or equal to a preset threshold value, whether the target user is in a target area or not is determined based on a pedestrian re-recognition model according to the target features; wherein the target area comprises a business handling area and a waiting area; if the target user is not in the target area, delaying the queuing number of the target user, and sending prompt information to the target user; wherein the prompt information is used for prompting the target user to return to the target area, so that continuous waiting for the target user is avoided, time is saved, and service processing efficiency is improved.

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.

The present invention relates to blockchain technology in the field of financial technology and discloses a blockchain-based transaction polling method, comprising: obtaining real-time transaction data, and when the total number of transaction data in an initial transaction data queue meets a preset queue number threshold and the number of abnormal transaction data in the initial transaction data queue is less than a preset abnormal number threshold, collecting historical polling information of the initial transaction data queue, obtaining real-time blockchain information of the real-time transaction data, calculating optimized polling information of the real-time transaction data based on the real-time blockchain information and the historical polling information, and performing transaction polling on the real-time transaction data based on the optimized polling information to obtain a transaction polling result. The present invention also proposes a blockchain-based transaction polling device, electronic device, and readable storage medium. In the financial field, when a large amount of digital resources are polled for transactions through blockchain, the polling accuracy and efficiency are low. The present invention can improve the efficiency of transaction polling.

The present invention discloses a low-resource flow control method based on an FPGA, which is applied to a network flow control system. The system includes: a descriptor management module, a token flow control module, and a rate calculation module. The method comprises: the descriptor management module parses the descriptor corresponding to a data packet to be sent, obtains a first queue number and the length of the data packet to be sent, and then sends a flow control query request to the token flow control module; the token flow control module queries the number of first tokens in the corresponding sending queue based on the first queue number and generates a flow control decision result; the token flow control module periodically sends a token injection request to the rate calculation module, the token injection request including the second queue number of any sending queue; and the rate calculation module calculates the number of second tokens to be injected into the token flow control module based on the sending rate corresponding to the second queue number. The present invention eliminates the need to track the sending rate status of each sending queue in real time, thereby reducing hardware resource consumption on the FPGA.

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 provides a queuing and calling method and system, and relates to the technical field of queuing and calling. The method comprises the following steps: inputting an interval duration from a current moment to a starting moment of a business handling time period and a pre-recorded reserved number of people in the business handling time period into a first number of people prediction model, and predicting a first reserved total number of people in the business handling time period; inputting the actual reservation number of people and the number of people change characteristics in the business handling time period in the latest N days into a second number of people prediction model, and predicting a second reservation number of people in the business handling time period; according to the first appointment total number of people and the second appointment total number of people in the business handling time period, predicting the final appointment total number of people in the business handling time period; and inputting the final reservation total number of people and the proportions of the businesses of the business types into a first waiting time length prediction model, and predicting the business handling waiting time length which needs to be waited after the user signs in the handling site of each sign-in time slice in the sign-in time period corresponding to the business handling time period.

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.

The present application relates to the technical field of computers, and discloses a data transmission method and apparatus, a device, a storage medium, and a computer program product. The method comprises: when there is a data transmission requirement, acquiring a target network card queue number from a first in first out cache; on the basis of the target network card queue number, applying for queue information of a target network card queue, and, on the basis of the queue information, applying for a descriptor from the target network card queue, so as to perform data transmission by using the descriptor; determining a scheduling mode, and determining whether the target network card queue satisfies a principle for continuing application corresponding to the scheduling mode; if the target network card queue satisfies the principle for continuing application corresponding to the scheduling mode, re-entering the step of applying for the queue information of the target network card queue on the basis of the target network card queue number; and, if the target network card queue does not satisfy the principle for continuing application corresponding to the scheduling mode, re-adding the target network card queue number into the first in first out cache, and re-entering the step of acquiring the target network card queue number from the first in first out cache. The present application increases the flexibility of multi-queue scheduling.

An embodiment of the present invention provides a traffic management chip control method, chip, and storage medium, belonging to the field of traffic management technology. The method includes: obtaining a multi-queue message flowing into the traffic management chip, wherein the multi-queue message includes multiple queue numbers, and the multiple queue numbers are determined according to business needs; when it is determined that there is no queue in the multi-queue message that is not stored in the management queue of the traffic management chip, controlling the traffic management chip to send the multi-queue message outward. The technical solution of the embodiment of the present invention reduces the number of times multi-queue messages enter and exit the chip by managing and controlling the multi-queue messages, thereby reducing the impact on chip performance and improving the speed of data processing.

A system is described having one or more processing devices that execute a requestor thread and a doorbell ringing thread. The requestor thread includes receiving a prompt from an application, in response to the prompt, generating a work queue entry (WQE), and after generating the WQE, atomically incrementing a first counter. The doorbell ringing thread includes monitoring a value of a first index, detecting a change in the value of the first index, in response to the change in the value of the first index, generating a control (ctrl) segment using at least one of the value of the first index and a queue number, and ringing a doorbell (DB) by writing the ctrl segment to a control address.

The invention is suitable for the technical field of processors, and particularly relates to a vector register write-back device and method based on out-of-order execution and a storage medium. The vector register write-back device comprises a dispatching module, a scoreboard module, a transmitting queue module, a reading module, a register file module, an execution module and a write-back module. The transmitting queue module is used for applying for distributing a corresponding second entry to the write-back module according to the received to-be-executed instruction, the second entry is used for recording a destination register number corresponding to the to-be-executed instruction, and the write-back module sends a corresponding write-back queue number to the transmitting queue module after the second entry is distributed. Compared with the prior art, the method has the advantages that huge area power consumption caused by introduction of a renaming mechanism is effectively avoided, a lot of circuit areas and power consumption resources are consumed due to the fact that a large number of physical registers are not needed, and compared with a scheme which does not support out-of-order execution, the parallelism degree of instruction execution is improved, and the performance of the vector processor is effectively improved.

A Deterministic Traffic (DT) transmission method and device is provided. The method includes: in a case where it is determined that a received packet belongs to a DT, and the packet does not carry Cycle Specified Queuing and Forwarding (CSQF) domain schedule information, determining a target time slot number corresponding to an arrival time of the packet; according to the target time slot number, querying a time slot schedule cycle mapping table at an egress interface for the packet, and determining a target cycle schedule queue corresponding to the target time slot number, where the time slot schedule cycle mapping table is determined based on intra-node jitter at the network node, and is used to record a mapping relationship between a time slot number and a cycle schedule queue number; scheduling the packet to the target cycle schedule queue at the egress interface for the packet.

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.

The application is suitable for the field of processor technology, and particularly relates to a vector register write-back device based on out-of-order execution, a method and a storage medium. The vector register write-back device comprises a dispatch module, a scoreboard module, a launch queue module, a read module, a register file module, an execution module and a write-back module; the launch queue module is used for applying for allocating a corresponding second entry to the write-back module according to a received to-be-executed instruction, the second entry is used for recording a destination register number corresponding to the to-be-executed instruction, and the write-back module sends a corresponding write-back queue number to the launch queue module after completing the allocation of the second entry. Compared with the prior art, the application effectively avoids the huge area power consumption caused by the introduction of the renaming mechanism, does not need a large number of physical registers to consume many circuit areas and power consumption resources, and improves the parallel degree of instruction execution compared with the scheme without supporting out-of-order execution, thereby effectively improving the performance of the vector processor.

A system is described having one or more processing devices executing a requestor thread and a doorbell ringing thread. The requestor thread includes receiving a request from an application, generating a WQE (Work Queue Entry) in response to the request, and atomically incrementing a first counter after generating the WQE. The doorbell ringing thread includes monitoring a value of a first index, detecting a change in the value of the first index, generating a control segment (ctrl) based on the value of the first index and / or a queue number in response to the change in the value of the first index, and triggering a DB (doorbell) by writing the ctrl segment to a control address.

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.