16 results about "Queue time" patented technology

The invention provides a network communication device and method with a dynamic packet transmission sorting mechanism. The packet classification circuit sets each low-latency packet as a selected low-latency packet for storage in a corresponding selected low-latency queue circuit. The transmission sorting circuit calculates a queue time parameter for the selected low-delay packet to sort the selected low-delay packet with other low-delay packets so as to update a sorting list. Wherein the queue time parameter is the proportion of the total queue time of the selected low-delay packet stored in the selected low-delay queue circuit exceeding the dynamic service time threshold value set corresponding to the selected low-delay queue circuit. The communication circuit sequentially transmits the low-latency packets according to the sorting list. The dynamic adjustment circuit calculates the difference between the total packet transmission time of the selected low-delay packet and the target delay threshold value so as to dynamically adjust the dynamic service time threshold value according to the difference.

The embodiment of the invention discloses a congestion control method and system for real-time audio and video transmission of a cloud terminal. Comprising the following steps: a receiving end accurately predicts a bandwidth and a queue time delay gradient by using an improved Kalman filter which stably reduces gain by adjusting a process noise covariance matrix in stages, and determines a first target sending rate candidate according to the bandwidth and the queue time delay gradient; the sending end determines a second target sending rate candidate based on the packet loss rate, and performs a big or small decision on the two candidate rates according to the level of the packet loss rate so as to determine a final sending rate; in addition, when the packet loss rate exceeds a threshold value, the source end data flow is actively interrupted to prevent user misoperation. According to the method, the bandwidth prediction precision is improved, misjudgment speed reduction when the network condition is good is avoided, and the user experience in a severe network is improved.

The application relates to the fields of CAE simulation technology and distributed architecture, and discloses a service-oriented CAE simulation platform micro-service architecture construction method and system, which comprises the following steps: constructing a micro-service architecture, wherein the micro-service architecture comprises a core micro-service cluster, a unified service bus, a dynamic resource scheduling center and a distributed data layer; data generated by each micro-service is stored through the distributed data layer; the distributed data layer cuts unstructured data into data shards and stores the data shards in the form of multiple copies into an object storage cluster, stores structured data into a relational database, stores business metadata into a cache cluster, listens to change logs of the relational database by using a change data capture technology, and synchronizes change events to the cache cluster. The traditional monomer platform needs 3 hours to complete the same task, the application only needs 1 hour and 30 minutes, the efficiency is improved by 50%, and the task queuing time is shortened from 1 hour to 10 minutes.

In a method of processing a substrate having a copper line in the substrate wherein an Ru metal cap layer is formed on a copper line disposed in the substrate and an ashless carbon oxygen barrier layer is deposited on the Ru metal cap layer to provide a substrate having a protected capped copper line. The substrate having the protected capped copper line is queued before carrying out subsequent process steps, and the ashless carbon oxygen barrier layer is removed before carrying out subsequent process steps. Protecting the capped copper line in this manner provides greater flexibility in managing substrate processing operations by permitting longer queue times before subsequent substrate processing steps are carried out, without fear that the copper line will be adversely affected by oxidation during the queue.

The application discloses a task processing method based on a quantum-classical hybrid architecture, a server for the quantum-classical hybrid architecture and a task processing system based on the quantum-classical hybrid architecture. The method comprises the following steps: establishing a session connection with a client through a preset communication protocol, and setting a session identifier; receiving a first task processing request sent by the client; determining session computing power resources according to the first task processing request; associating the session computing power resources with the session identifier; and processing the first task processing request according to the association between the session identifier and the session computing power resources to obtain a first task processing result. In this way, the session computing power resources are associated with the set session identifier, so that the session computing power resources cannot be used by other clients before the session connection is ended, and are only used for processing the task request sent by the client, thereby reducing the queuing time of the to-be-processed tasks and improving the overall efficiency of the quantum-classical hybrid architecture.

Embodiments of the invention provide an MPP cluster exception handling method and apparatus, and a storage medium. The method comprises the steps of obtaining a to-be-executed job; when the to-be-executed jobs are dominant faults, whether the queuing time of the to-be-executed jobs exceeds a first threshold value or not is judged, and if the queuing time of the to-be-executed jobs exceeds the first threshold value, the jobs are submitted and removed out of a to-be-distributed job queue; if the first threshold value is not exceeded, the to-be-executed job is queued continuously; when the to-be-executed job is a hidden fault, whether the queuing time of the to-be-executed job exceeds a second threshold value or not is judged, and if the queuing time of the to-be-executed job exceeds the second threshold value, the to-be-executed job is submitted and removed out of the queuing queue; if the number does not exceed a second threshold value, judging the number of job instances which are associated with the metadata cluster in the to-be-executed job and are in operation, and if the number of the job instances does not exceed a third threshold value, submitting the to-be-executed job and removing the to-be-distributed job queue; and if so, continuing to queue the to-be-executed jobs. According to the method, invalid scheduling submission is reduced, and the automation level is improved.

The invention discloses a deadline-oriented mobile edge computing task joint scheduling and unloading method, and relates to the technical field of mobile edge computing. In a system comprising a plurality of terminals and edge servers, the method is realized through end-side cooperation: each edge server maintains a queue in an ascending order according to absolute deadline, operates a maintenance algorithm, and deletes a task with the maximum processing duration when accumulated processing time is overtime, so that a feasible execution sequence with the minimum overtime task number is maintained; the server periodically broadcasts queue state summary information containing queue head task absolute deadline and processing duration to the terminal; the terminal carries out feasibility judgment and queuing time estimation on each server through a simulation insertion and early stop mechanism based on the information; and the terminal screens a feasible server set, selects the server with the minimum total experience as an unloading target according to a predefined cost function and a lexicographical order optimization principle, and completes a decision in combination with a jitter suppression strategy.

The embodiment of the invention relates to a model scheduling method and device, equipment and a medium, and the method is applied to a model scheduling server, and comprises the steps: obtaining at least one first model node address in an idle state in response to obtaining a model calculation request sent by a model user; performing occupation operation on the at least one first model node address by using the centralized memory to obtain a second model node address which is successfully occupied; sending a model calculation request to a corresponding target model node based on the second model node address, so that the target model node calculates through a target model in the graphics processor to obtain a calculation result; and obtaining a calculation result, and returning the calculation result to the model user. According to the embodiment of the invention, the request is processed by the model in the idle model node as far as possible, the queuing time of the request is reduced, the fluctuation of response time sensed by a model user is reduced, and the load fluctuation of graphics processors of different model nodes is further reduced.

This invention discloses a method, apparatus, and system for determining queuing time. The invention divides a battery swapping station into sequentially connected vehicle entry, battery swapping, and vehicle exit areas. Probe components are deployed in each area of ​​the battery swapping station. A central control device acquires vehicle data collected by multiple probe components. Based on this vehicle data, it determines the passing vehicle records corresponding to the vehicle entry, battery swapping, and vehicle exit areas. Upon receiving a queuing time query request, it determines and feeds back the target queuing time based on the passing vehicle records. The passing vehicle records are used to record the vehicle identifiers of battery swapping vehicles located in the corresponding battery swapping station areas at different times. Therefore, this invention can provide queuing time query services without requiring data reporting from the user side.

This invention provides an attack detection method, apparatus, and electronic device, applied in the field of vehicle network security technology. The invention acquires anchor messages configured with deadlines, collects the number of arbitration failures, queuing time, and actual transmission time during the transmission process, calculates the queuing waiting time, and generates a deadline violation indicator based on the deadline. Multiple transmission samples are aggregated within a specified sliding window, and a fingerprint vector reflecting the bus resource contention status is generated based on the above parameters. This fingerprint vector is compared with a pre-built adaptive baseline to obtain an anomaly score. When the anomaly score exceeds a preset threshold, a disguised high-priority flooding attack is identified. This invention improves the accuracy and robustness of attack detection by monitoring underlying resource contention characteristics and accurately identifying anomalies caused by disguised high-priority attacks.

The invention provides a check-in queuing model index calculation method based on backlog carry-over stability approximation, and relates to the technical field of check-in services. Firstly, in each time period of check-in queuing time, the passenger arrival rate and the service efficiency of each business are calculated, the business overstock rate is obtained based on the passenger arrival rate and the service efficiency, and the actual total arrival number of the time period is calculated by using the calculated overstock rate of the previous time period and the new arrival number of the current time period; and further calculating the total expected waiting time and the expected waiting queue length of the time period on the basis of the actual number of people accumulated in the previous time period and the handling efficiency, and finally configuring and adjusting check-in service resources according to the prediction indexes. According to the technical scheme, a dynamic and refined resource allocation mechanism is realized, the instantaneous arrival rate is considered, and the influence of historical backlog on the current queuing state is also considered, so that the service capability and the actual passenger flow fluctuation can be more accurately matched, the check-in service resource allocation is convenient to optimize, and the service quality is improved.

In a method of processing a substrate having a copper line in the substrate wherein an Ru metal cap layer is formed on a copper line disposed in the substrate and an ashless carbon oxygen barrier layer is deposited on the Ru metal cap layer to provide a substrate having a protected capped copper line. The substrate having the protected capped copper line is queued before carrying out subsequent process steps, and the ashless carbon oxygen barrier layer is removed before carrying out subsequent process steps. Protecting the capped copper line in this manner provides greater flexibility in managing substrate processing operations by permitting longer queue times before subsequent substrate processing steps are carried out, without fear that the copper line will be adversely affected by oxidation during the queue.

The invention provides an intelligent queuing and global touring planning method and system based on real-time people flow monitoring, and the method comprises the steps: S1, receiving a virtual queuing sign-in request of a user terminal for a target touring item, and adding a user into a virtual queue; s2, calculating the dynamic queuing time of a target item corresponding to the user in real time and the dynamic travel time from the real-time position of the user to the target item; s3, judging whether a preset positive time constant is met or not, and if yes, sending a departure notice and an optimal path to the user terminal; s4, after the user departs, continuously monitoring the road condition and the position of the user, and if a better path exists, dynamically re-planning the path and updating a navigation instruction; and S5, receiving a plurality of target items selected by the user, calculating the continuous playing feasibility and generating a global touring plan. The problems that a traditional static reservation system is insufficient in flexibility and single queuing time prediction lacks navigation connection are solved, and efficient cooperation of the user, the park and the system is achieved.

The invention relates to a port distributing and setting method based on a port arranging time dynamic prediction model, and the method comprises the steps: obtaining the daily average total processing capability of a port in a situation that all types of berths are compatible with corresponding ship types, constructing a predicted queuing time model according to the daily average total processing capability of the port, and introducing a buffer fluctuation factor, the optimization module is used for optimizing a predicted queuing time model; and by using the optimized predicted queuing time model, obtaining the predicted queuing time of port diffusion and port determination. According to the method, a dynamic evolutionary model is taken as a core, data is taken as a drive, the arrival time of the ship and the port operation capability are analyzed in real time for each candidate port before the port is expanded and fixed, the predicted queuing time after the ship arrives at each candidate port is scientifically and dynamically estimated, and the optimal port is selected for port expansion and fixed. Therefore, the port queuing congestion risk is avoided as much as possible, the operation efficiency is improved, and the cost is saved.

The application relates to a queuing management method and device, computer equipment and a computer readable storage medium. The execution speed of the current task of each queue is determined based on the task execution data of each queue in a preset queuing area. The task execution data of each queue in the preset queuing area is obtained from a video collected for the preset queuing area. The current queuing quantity of each queue is determined, and the current queuing waiting time of each queue is determined according to the current queuing quantity of each queue and the execution speed of the current task of each queue. The number of queues that need to be adjusted and the corresponding number of objects that need to be adjusted are determined according to the current queuing waiting time of each queue, and the queues that need to be adjusted are instructed to make corresponding adjustments. The queuing situation of all queues is automatically analyzed and managed based on a video monitoring technology, the queuing time of each queue is balanced, the queuing time of a certain queue is prevented from being too long, and thus the experience of individuals in the queuing process is effectively improved.

This invention provides a method and system for task offloading in a vehicle-mounted computing network based on dynamic identity conversion, relating to the field of vehicle-mounted computing network technology. First, a vehicle-mounted computing network is constructed; then, an identity conversion mechanism is established, and vehicles in the vehicle-mounted computing network that meet preset identity conversion conditions are dynamically converted according to the mechanism, resulting in vehicles with converted identities; next, a vehicle-mounted computing network priority factor is calculated, and priority compensation is provided to the vehicles with converted identities using this priority factor. This invention, through the identity conversion mechanism and the vehicle-mounted computing network priority factor, improves the determinism of the vehicle-mounted server as a computing node, enhances system stability, reduces the overall task processing time and average task queue length, and effectively reduces the communication time and queuing time of tasks in the queue.