13results about How to "Efficient scheduling" patented technology

This utility model discloses an intelligent three-dimensional storage rack that is easy to schedule, including a support frame and multi-layer placement plates arranged between the support frames. Side frames are respectively arranged on the front sides of the support frame, and a top plate is arranged between the tops of the side frames. A lifting screw is arranged inside the side frame, and a lifting gear is arranged at the top of the lifting screw. A belt is arranged between the two lifting gears. A mounting plate is arranged on the top of the side frame, and a lifting motor is arranged on the mounting plate. A pair of slide rail grooves are arranged on the moving base. The traverse motor is powered by an external power supply. A moving gear and a fixed gear are arranged inside the moving base. A support plate is arranged above the moving base. This storage rack achieves efficient positioning and scheduling of goods through precise mechanical linkage design. This layered positioning mechanism significantly improves the accuracy and efficiency of goods scheduling, facilitates subsequent goods picking operations, and reduces the risk of manual goods handling.

The invention discloses a computing power resource dynamic slicing and isolation method for an artificial intelligence target range, and the method comprises the following modules: S1, business feature perception and dynamic resource slicing: carrying out the analysis and modeling of an artificial intelligence attack and defense task through a mechanism, and mapping a task demand into a corresponding computing power slicing specification; s2, a driving-level video memory firewall, which monitors the video memory usage behavior of the virtual instance in real time on a driving layer of an execution node, and prevents attack behaviors such as abnormal occupation of the video memory; and S3, carrying out atomized rollback based on the model state of the shared memory. According to the mechanism, rapid recovery of the environment is realized through page table resetting. The method is oriented to an artificial intelligence target range, and the problems of static low efficiency, insufficient safety and isolation, lack of a quick recovery mechanism and the like of resource scheduling are solved through the mechanisms.

The application relates to a dynamic distributed short-term scheduling method and system for short-term precipitation prediction, which comprises the following steps: inquiring whether new radar echo data is received in a preset storage folder; if the new radar echo data is received in the storage folder, the new radar echo data is segmented, and a plurality of calculation units are obtained after the segmentation; the segmented calculation units are stored, and the stored calculation units are dynamically allocated to each precipitation prediction processing machine; precipitation prediction is performed on the calculation units based on a preset space-time prediction model, and precipitation prediction results of the calculation units are respectively generated; the precipitation prediction results are combined and precipitation prediction data is generated. The application realizes efficient scheduling of multiple machines for dynamic distributed short-term scheduling.

The utility model provides a bank outlet delivery machine control system. The bank outlet delivery machine control system comprises a client, a delivery total device, a dispatching center and an outlet terminal. Data communication connection is established between the client and the delivery total device; and data communication connection is established between the delivery total device and the dispatching center and the network terminal. Wherein the delivery total device comprises a delivery middleware and a delivery transaction cloud, and the delivery middleware adopts an intelligent picking-up cabinet.

This application relates to the technical field of resource scheduling, and in particular to a task scheduling method, apparatus, and computer device. The method is applied to a scheduler and includes: in response to a task acquisition request reported by a computing container, determining a target task instruction from an instruction queue; wherein the instruction queue contains task flows of received tasks to be executed, and each task flow includes at least one task instruction; the computing container includes multiple threads, and the task acquisition request is generated by the computing container in response to the determination of an idle thread, where the idle thread is a thread in an idle state; generating an allocation instruction containing the target task instruction, and feeding the allocation instruction back to the computing container; the allocation instruction is used to instruct the computing container to call an idle thread to execute the target task instruction. The solution of this application can improve hardware utilization.

The application discloses a transmission line, wherein the transmission line comprises a first outer linear stator, a first bifurcated stator, a first inner linear stator, a cross stator and a first power line; the first outer linear stator transmits a mover in a first direction; the first bifurcated stator comprises a first confluence end, a first and a second bifurcation end, the first confluence end is spliced with the first outer linear stator; the first inner linear stator is spliced with the first bifurcation end and transmits a mover in a second direction perpendicular to the first direction; the cross stator comprises a first splicing end, a second splicing end, a third splicing end and a fourth splicing end arranged in sequence and perpendicularly, the first splicing end is spliced with the first inner linear stator; the first power line connects the first outer linear stator, the first bifurcated stator, the first inner linear stator and the cross stator in sequence. The technical scheme of the application can simplify the wiring mode of the transmission line.

This invention proposes a method for monitoring network signal operation. By deploying a centralized management service in a cloud computing environment, it performs threshold judgments on aggregated signal data, dynamically acquires additional cloud resources to support monitoring, and simultaneously constructs a cloud-based signal monitoring dashboard to update remote signals in real time, identify abnormal patterns, and integrate them into the network monitoring system. For anomalies related to resource scheduling, it obtains optimized paths, enhances dashboard functionality, and ultimately adjusts management services based on communication feedback data. This method achieves efficient aggregation of signal data, accurate identification of anomalies, and intelligent resource scheduling, significantly improving the reliability and response speed of cross-regional communication monitoring and providing stable support for multi-regional network operation.

This invention relates to the field of task scheduling technology, specifically to a method for unloading and scheduling interactive tasks and resources in intelligent terminals based on edge-side state awareness. The method includes the following steps: collecting CPU utilization, GPU utilization, and communication latency data; smoothing communication latency to form an edge-side state indicator set; calculating a suitability index based on the edge-side state indicator set and task characteristics; generating a priority ranking table by scoring and fusing according to rules; selecting the first-ranked path; analyzing computing power and latency to construct an execution strategy; invoking dynamic resource scheduling; monitoring latency and providing feedback to adjust weights to generate resource scheduling instructions. In this invention, by collecting CPU and GPU utilization and communication latency in real time, using a sliding window to smooth and optimize scheduling, weighting the maximum tolerable latency with data size to match edge-side state and generate priorities, and dynamically adjusting resource allocation to match execution paths and network latency, this method avoids resource waste and task delays caused by static rules, thereby improving performance and utilization.

This application applies to the field of mining technology, providing a method, apparatus, and computer device for multi-objective optimization scheduling of mining equipment based on digital twins. The method includes: acquiring mining operation parameters and mining equipment parameters, and inputting these parameters into a multi-objective optimization model to obtain a set of candidate scheduling schemes. For each candidate scheduling scheme, the scheme is input into a target simulation model constructed based on digital twin technology to obtain equipment operation data. Based on the equipment operation data corresponding to the multiple candidate scheduling schemes, a target scheduling scheme is determined from the set of candidate schemes. The target scheduling scheme is used for optimal scheduling of mining equipment during the mining operation. This application achieves scientific, efficient, and highly robust scheduling of mining equipment through a closed-loop combination of multi-objective optimization and digital twin simulation.

The application discloses a multi-agent collaborative scheduling method and system for scientific and technological information analysis, relates to the technical field of scientific and technological information analysis, and comprises the following steps: a task publishing layer outputs a standardized task description by performing task demand element analysis; an intelligent coordination and scheduling layer performs closed-loop collaborative decision after receiving the standardized task description and outputs a task allocation instruction; and a professional agent execution layer drives a data acquisition agent group to acquire scientific and technological information data through a data access adapter of a data resource layer and execute a scientific and technological information analysis task, and outputs a structured processing result, which is visually presented to a user through the task publishing layer. The application solves the technical problem that a scientific and technological information processing system in the prior art lacks intelligent task allocation, leading to low information processing efficiency, achieves four-layer architecture closed-loop collaboration and efficient scheduling of a professional agent group for scientific and technological information analysis tasks, and improves the technical effects of task allocation accuracy and information processing efficiency.

This invention discloses an adaptive router and its routing method based on a three-dimensional on-chip network with irregular inter-layer interconnections. It utilizes the vertically connected topology of the three-dimensional on-chip network, a healthy TSV (Through Silicon Via) location mechanism, and a congestion propagation network to adaptively reconstruct routing paths based on congestion level, injection rate, and TSV availability. By designing healthy TSV information tables, healthy TSV distance information tables, healthy TSV congestion information tables, a routing decision module, and healthy TSV propagation and congestion awareness mechanisms, it achieves collaborative operation between distance-based and congestion-based routing algorithms to reduce performance losses caused by congestion and failures. This invention uses relatively low hardware overhead, enhances the reliability and adaptability of three-dimensional on-chip network routing, and effectively reduces the average packet latency in the presence of irregular vertical interconnections and dynamic network traffic changes, significantly improving the overall performance and robustness of the system under fault and congestion environments.

This invention relates to a custom time-delay message processing method based on a distributed message queue, belonging to the field of distributed message queue technology. The method includes: a client receiving an arbitrary delay duration specified by the user, calculating a target Unix timestamp based on the client's current system time, and sending a message carrying that timestamp to a message broker layer; the message broker layer storing the message in a delay queue and inserting it into the corresponding time slot of a hierarchical circular time wheel according to the target Unix timestamp; the hierarchical circular time wheel consists of multiple levels of circular arrays, connected by an overflow mechanism; the message broker layer advances a global pointer at fixed time intervals, scans the messages to be scheduled in the time slots, and transfers expired messages from the delay queue to a regular queue for consumer consumption. This achieves flexible support for arbitrary delay durations and achieves task scheduling with O(1) time complexity through the hierarchical circular time wheel.