36 results about "Idle time" patented technology

The application discloses an intelligent scheduling control method for an automobile part automatic assembly line, and relates to the technical field of automatic control, which comprises the following steps: obtaining the task instruction response time length value and the node execution action state change value of each execution unit in a current scheduling period, and calculating the response delay value and the state fluctuation value of the corresponding node; generating a response efficiency value according to the response delay value and the state fluctuation value of each node, and generating a feedback control level label in combination with the node task attribute information; judging whether to perform compression processing based on the feedback control level label and the available idle time value of each node in the current scheduling period, and if the compression condition is met, encoding the response delay value and the state fluctuation value into a compressed feedback data frame; and completing the relay transmission of the compressed feedback data frame in a time period that meets the scheduling idle condition, so that the scheduling delay pressure control, task state accurate maintenance and instruction issuing sequence dynamic optimization of the automobile part automatic assembly line are realized.

This invention discloses an automatic computer protection system and method, relating to the field of computer file security protection. The technical solution includes: detecting user idle time; identifying sensitive tabs in the browser when the user is about to leave, and extracting the ORB feature point set of their content area as a content fingerprint; creating a Gaussian blur overlay window when the user has left, tracking the positional changes of the content area through feature point matching and affine transformation, and dynamically adjusting the position and size of the overlay window so that the overlay always follows the movement of the file content; and destroying the overlay window when the user returns, restoring the file to normal display. This invention, through content area tracking based on visual features and progressive blurring, solves the problem of sensitive file content being exposed and background tasks being interrupted when a user is briefly away, achieving fine-grained protection at the file and tab levels, and helping to improve the security of computer files in the office environment.

To provide a system. 【Solution means】 Means for receiving participant information, Means for obtaining schedule information based on the participant information, Means for generating candidate times when all participants are available based on the schedule information, Means for checking the availability of facilities corresponding to the candidate times, Means for presenting the candidate times and the availability of the facilities, Means for analyzing the idle time of public service institutions to efficiently set the schedule of events in the local community, Means for setting a meeting based on the time selected from the presented candidates, Means for sending a notice regarding the set meeting, A system including the above.

A system and method for designing a general-purpose static multi-issue CPU using static pipelining of automatically parallelized code is proposed. A multicore and / or multiprocessor integrated circuit has multiple processing units and / or processing pipelines that simultaneously process instructions for data by executing parallelized processing machine code. The execution of parallelized processing code by a multicore and / or multiprocessor integrated circuit that performs parallel processing involves the occurrence of latency, which is given by the idle time of the processing unit between the time the processing unit processes a particular block of instructions in the processing code for data and sends the data back, and the time the processing unit receives the data necessary to execute a successive block of instructions in the processing code. The parallel pipeline includes means for (i) forwarding by providing data forwarding from the MEM stage as an EX / MEM register to the EX stage as an ID / EX stage register, (ii) exchange by providing result exchange between pipelines by making the Ex-MEM stage register results accessible to the EX stage of the parallel pipeline, and (iii) means for branch pipeline flushing with control hazards by flushing only pipelines that depend on one pipeline that calculates conditions based on branch addresses.

This invention relates to a method and system for improving SPI communication efficiency through dual-keyword approach. The method includes: setting a first feature code for waiting for data to arrive; and a second feature code for feature replacement when a feature code conflict occurs. When the SPI slave's idle time ends, it determines whether to continue sending the first feature code until the data to be sent is ready, based on whether the data to be sent is ready. After the data is ready, it determines whether a feature code conflict has occurred based on whether the first data of the data to be sent is the same as the first feature code. It then determines whether to replace the first data with the second feature code. When the SPI master's idle time ends, it determines whether the data to be sent by the SPI slave is ready based on whether it has received the first feature code sent by the SPI slave. It then determines whether the first data of the data to be sent by the SPI slave needs to be replaced with data identical to the first feature code based on whether it has received the second feature code. This invention effectively improves SPI communication efficiency.

This application provides a dual-resource-pool hierarchical resource scheduling method, apparatus, device, and medium. The method includes: for each GPU basic unit of each node, if the resource pool type of the GPU basic unit is a monthly resource pool, then the GPU basic unit is reclaimed based on idle time and expiration time; if the resource pool type is a packaged resource pool, then the GPU basic unit is reclaimed based on idle time. Based on the number of GPUs, the real-time acquired number of available GPUs of each node, the GPU occupancy type, and node scheduling constraints, a set of selectable nodes is selected from each node. Based on the scheduling priority ranking strategy determined by the number of GPUs and the node GPU utilization, the nodes are sorted for scheduling priority, and the target GPU of the target node is determined. Based on the GPU occupancy type, the resource scheduling method of the target GPU is determined, and the target GPU is scheduled to the container resource request using the resource scheduling method. This achieves differentiated management of GPU resources and improves GPU resource utilization.

The embodiment of the application provides a container resource scheduling method and device based on GPU utilization, equipment and medium, the method is for each GPU in the GPU set, real-time acquisition of GPU utilization and current GPU occupation type of GPU, based on GPU utilization and preset GPU utilization threshold to determine the idle time of GPU; obtain the GPU quantity of container resource request, request GPU occupation type and request time, for each GPU, based on the idle time and the request time to determine the first idle time of the GPU, based on the first idle time and the current GPU occupation type to determine the idle state of the GPU; based on the request GPU occupation type, each GPU utilization and each idle state, each GPU is scheduled and sorted, the scheduling priority is sorted, the GPU quantity of the first GPU in the scheduling priority is sorted as the target GPU set, and the target GPU set is scheduled to the container corresponding to the container resource request based on the scheduling method corresponding to the request GPU occupation type.

A scheduler. In some embodiments, a method includes: scheduling a first task, of a first job, on a first processing element, the scheduling including: calculating a slack in the first processing element, for the first task, based on an expected occupancy time, in the first processing element, of a second task, of the first job, and based on an expected occupancy time, in the first processing element, of a third task, of a second job.

The utility model discloses an integrated qin table and chair, which comprises a supporting unit, a supporting leg, a backrest provided on the supporting leg, and a top beam provided on the backrest; a qin chair adjusting unit, which can be folded and unfolded according to the needs of users, thereby reducing the floor area during idle time; a qin table adjusting unit, which is used for placing a qin during use and can be placed on both sides of the device during non-use, the utility model adjusts the qin chair adjusting unit to a suitable position when the qin table and chair are needed to be used, then adjusts the qin table adjusting unit according to the qin chair adjusting unit, and places the qin on the device after the adjustment is completed, and then the qin table and chair can be used; when the qin table and chair are not used, the qin chair adjusting unit is placed on both sides of the qin chair adjusting unit, then the qin chair adjusting unit is adjusted to the minimum distance, and the storage is completed, thereby reducing the floor area.

This application discloses a message forwarding control method and apparatus, belonging to the field of communication technology. The method is applied to message forwarding nodes in a communication network that forward first and second flows of messages through the same outgoing interface. The method includes: in a first time slot starting at a first time point, allowing the scheduling of messages to be forwarded in the first flow to the outgoing interface; in a first time period starting at the first time point and ending at a second time point, ceasing the scheduling of messages to be forwarded in the second flow to the outgoing interface; the duration of the first time period is shorter than the duration of the first time slot; and from the second time point onwards, allowing the scheduling of messages in the second flow to the outgoing interface. Through this method, when messages in the first flow fail to arrive at the message forwarding node on time, causing the first time slot to be idle, the second flow can contend for the idle time slot to forward messages, thus improving the statistical reuse rate of the message forwarding node's outgoing interface transmission resources.

The present disclosure provides a task processing method, a scheduler, a scheduling system, a device and a medium, and relates to the technical field of computers. The task includes multiple sub-tasks, and the multiple sub-tasks are executed in a pipeline parallel manner by multiple computing units. The method comprises: monitoring the device state of the multiple computing units; in response to determining that there is an idle unit in the multiple computing units according to the device state, determining a target task from all currently executing sub-tasks to be executed based on the next scheduled task of the idle unit; and assigning the target task to the idle unit for execution. The next scheduled task of the idle unit is determined based on a preset binding relationship of the pipeline parallel. The method can reduce the idle time of the idle unit and improve the task processing efficiency.

This invention provides a database cluster streaming replication method and related products based on shared storage. The method includes: monitoring the continuous idle time of the master database node; in response to the continuous idle time exceeding a first threshold, the master database node generates auxiliary write-ahead log data at a preset period and sends it to the slave database; in response to the continuous idle time exceeding a second threshold, the master database node stops generating auxiliary write-ahead log data and sends a state transition log to the slave database. The solution of this invention, by periodically generating auxiliary write-ahead log data and filling the leaf nodes of the paired heap within the first threshold, ensures that the leaf nodes of the slave database are always active, avoiding the problem of slave database replay blocking due to a node having no business logs for a long time. By stopping the generation of auxiliary write-ahead log data after the continuous idle time exceeds the second threshold and removing the corresponding leaf node from the paired heap, the waste of storage space and I / O resources is eliminated.

An arithmetic unit idle time measurement device (100, 100A, 100B) is for measuring, in arithmetic units that execute arithmetic processing for an application A (31), an active time during which the processing is executed and an idle time during which the processing is idle, and comprises: a task execution time information acquisition part (110) that acquires, from a task management part (21) which performs task management for allocating a task to the arithmetic units, task management information including task execution time information; and an arithmetic unit operation status derivation part (120) that derives active or idle information of each of the arithmetic units associated with the application on the basis of the acquired task execution time information.

A resource scheduling method and a server are provided, the method including: acquiring, at target scheduling time, an idle time point corresponding to respective virtual network element of the multiple virtual network elements, wherein the idle time point corresponds to a time point at which no load task is polled by a worker thread in the virtual network element; determining load status of the multiple virtual network elements based on time differences between the target scheduling time and the idle time point corresponding to respective virtual network element of the multiple virtual network elements; determining computational resource scheduling information of the multiple virtual network elements based on the load status of the multiple virtual network elements; sending the computational resource scheduling information to a kernel of the server to perform, through a schedule-class function in kernel mode, resource scheduling processing corresponding to the computational resource scheduling information.

This invention provides a method and system for dynamic power consumption control of industrial terminals based on load prediction. The method includes: determining idle time periods based on the execution time information of each task in the task queue of the industrial terminal; if no tasks are being executed, determining candidate power-off power domains based on the target functional modules dependent on the last task before the idle time period and the first task after the idle time period, combined with the affiliation relationship between functional modules and power domains; performing islanding region analysis based on the electrical relationships between candidate power-off power domains to obtain target power-off power domains, and generating a power-off strategy for each target power-off power domain based on the duration of the idle time period and the recovery energy cost of each target power-off power domain; controlling the corresponding target power-off power domain to enter a power-off state based on the power-off strategy of each target power-off power domain, and maintaining its power-off state during the duration of the idle time period. This invention achieves fine-grained control of power consumption of industrial terminals.

This invention discloses a control method for fully automated silo relocation in feed mills, comprising a control system. The control system includes a silo relocation plan creation module, a silo relocation plan submission module, and a silo relocation plan execution module. The silo relocation plan creation module is pre-configured with information on each production line, silos requiring relocation within each production line, material information in each silo, a pre-set runtime for the silo relocation operation, and a set idle time for the auger in each silo. After the silo relocation plan is created through the silo relocation plan creation module, it is submitted as a task order to the silo relocation plan execution module through the silo relocation plan submission module. The silo relocation plan execution module then performs the corresponding operation based on the retrieved scenario. This invention enables fully automated silo relocation in feed mills, exhibiting a high degree of automation and intelligence, and is applicable to various scenarios under multiple operating modes.

The present disclosure relates to a communication module comprising: a first communication interface, a second communication interface, and a processing unit, wherein the first communication interface is configured to receive an instruction message according to a first communication protocol, wherein the instruction message represents a predefined reference instruction, wherein the communication module is configured to detect an uninterrupted idle time during which the communication module does not receive a message via the first communication interface, and wherein the processing unit is configured, in response to the idle time exceeding a predefined dead time, to control the second communication interface such that the second communication interface transmits a command message according to a second communication protocol, wherein the command message represents the reference instruction. The present disclosure also relates to a communication system, which includes the communication module, and a method for the communication module.

The application belongs to the technical field of artificial intelligence, and particularly relates to a method for accelerating file reading based on Kubernetes, which comprises the following steps: obtaining a training task; adding a data set of the training task to a cache file system; increasing the reference times of files in the data set of the cache file system and updating the latest time dynamics; mounting the cache file system to a POD container; reading the data set by establishing a script in the POD container and performing task training on the read data set; reducing the reference times of files in the data set after training; and judging the reference times of the files in the data set after training, and cleaning the corresponding files when the reference times are lower than a preset number threshold or the idle time is greater than a preset time threshold. The application mainly solves the problem of slow data reading caused by low-speed storage in the model training process.

This invention discloses a method, apparatus, and related media for synchronous execution of multiple modules in an instrument. The method includes parsing the step information of tasks to be executed by each module of the instrument to obtain a module status table and a list of steps to be executed. After sequentially performing pre-dependency verification, priority sorting, resource usage and conflict verification, and interleaving impact verification, the final executable steps are sent to the target module for execution, and the execution status is monitored and the module status table is updated. This invention constructs a multi-module collaborative scheduling process by sequentially performing pre-dependency verification, dynamic priority sorting, resource usage and conflict verification, and interleaving impact verification on the steps to be executed. Combined with real-time updates to the module status table, it achieves dynamic monitoring and feedback of the execution status of each module. This allows each module to dynamically adjust its execution order according to task priority and real-time resource status, utilizing idle time to interleave execution steps, thereby improving the overall operating efficiency of the instrument and shortening process time.

1. Name of the product in this design: Graphical User Interface for Resource Scheduling and Management of Small Model AI Platform for Electronic Devices. 2. Intended use of this design: for use in an electronic device. 3. The key design features of this product are: the graphical user interface content that displays information. 4. The image or photo that best illustrates the design points: Interface change state diagram 2. 5. Purpose of the graphical user interface: This graphical user interface is used for resource scheduling and management of the small model AI platform. The main view is the login interface for the small model AI platform. In the main view, after the user enters their account, password and verification code, they can click the "Log in Now" button to enter the interface change state diagram 1, which displays the small model AI middleware video integrated management interface. In Interface Change State Diagram 1, when the user clicks the "Resource Scheduling Center" button, they enter Interface Change State Diagram 2, which displays the Resource Scheduling Center interface. In the interface change state diagram 2, the user clicks the "Scheduling Strategy" item in the "Scheduling Strategy" column on the left to enter the interface change state diagram 3, which displays the scheduling strategy interface. In the interface change state diagram 3, the user clicks the "Idle Time Scheduling" button to enter the interface change state diagram 4, which displays the idle time scheduling interface. In the interface change state diagram 4, the user clicks the "Priority Preemption" button to enter the interface change state diagram 5, which displays the priority preemption interface.

The present application relates to the technical field of intelligent manufacturing and production scheduling, in particular to a multi-variety variable-batch flexible job shop intelligent scheduling method based on enhanced genetic algorithm and dynamic time window, comprising the following steps: step S1: obtaining a production order list to be scheduled, workshop resource information and a current material inventory state, splitting the order into a work order set with process constraints according to the process route of the order product, and performing a material completeness pre-check on the split work order; step S2: constructing a machine idle time period management model based on a dynamic time window, and maintaining available time segments of each production device in real time through a multi-value mapping data structure; step S3: taking the minimization of the maximum completion time, the maximization of the weighted average device utilization rate and the maximization of the material completeness just-in-time start rate as optimization objectives; the present application realizes accurate maintenance of the device idle time period by introducing a dynamic time window management mechanism, and significantly improves the time efficiency in the decoding process of the genetic algorithm.

The present application relates to the field of rail transit technology, and provides a running interruption adjustment method, device and medium, comprising obtaining emergency information of a rail transit line and judging an approach interruption type; in the case of the approach interruption type being a one-way operation interruption, determining a target section where the one-way operation interruption occurs; obtaining position information of at least two blocked trains in the target section through a cloud service platform, and constructing the at least two blocked trains as a virtual dynamic consist when a position deviation between the at least two blocked trains is within a preset position range; issuing a car release instruction to a rear car in the consist through the cloud service platform, so that the rear car reuses a movement authorization of a front car, and controlling the virtual dynamic consist to perform reverse running within an idle time window of an opposite track in a non-interruption direction. Thus, the multiple blocked trains can be as a whole consist to pass through the opposite track in a needle-threading manner without physical coupling, effectively relieving the backlog of the blocked trains and reducing the waiting time of passengers.

This invention discloses a method, apparatus, storage medium, and electronic device for determining ordering time. The method includes: establishing a wireless communication connection with a home appliance and acquiring log data sent by the home appliance based on the wireless communication connection; predicting a first set of idle times for a target user based on the log data, and determining a target idle time period that meets preset conditions from the first set of idle times, wherein the first set of idle times includes multiple time periods; determining the target user's ordering time period based on the target idle time period and the average food delivery time, and sending the ordering time period to the target user's mobile terminal so that the mobile terminal can execute preset ordering instructions within the ordering time period, or instruct the target user to order food on an ordering application within the ordering time period. This technical solution solves the problem of users needing to set aside time to wait for food delivery, resulting in wasted time.

This invention discloses a cloud workflow scheduling method with dynamic deadlines and reliability constraints, comprising: Step 1, obtaining the task set, workflow deadlines, and workflow reliability constraints of the workflow; Step 2, calculating the upward sorting value of each task in the task set, arranging the tasks in descending order according to the upward sorting value, and generating an initial task scheduling sequence; Step 3, determining the dynamic deadlines of the tasks to be scheduled based on the initial task scheduling sequence; Step 4, determining the target reliability constraints of the tasks to be scheduled based on the initial task scheduling sequence; Step 5, arranging the virtual machines in descending order to form a candidate queue; traversing the virtual machines and their idle time slots in the candidate queue, and assigning the tasks to be scheduled to the idle time slots; Step 6, determining whether there are any unscheduled tasks. If so, returning to Step 3 and repeating the process; if not, adjusting the task scheduling sequence based on the variable neighborhood descent algorithm and the simulated annealing algorithm to complete the cloud workflow scheduling.

A rendering display system (1) includes a rendering display device (10) having a rendering processing section (11) that performs rendering processing, a rendering processing idle time detecting section (12) that detects an idle time generated in the rendering processing, and a firmware update processing section (13) that performs update of firmware, and a nonvolatile memory (20) having a first storage area (21) that stores the firmware and a second storage area (22), respectively. The rendering processing section (11) performs the rendering processing by acquiring program codes from the first storage area (21) and executing the acquired program codes. The firmware update processing section (13) performs access to the second storage area (22) related to the update of the firmware based on idle time information indicating the detected idle time.

Embodiments of the present application relate to a storage task scheduling method and a computing device. The method comprises: obtaining storage tasks in a storage system, and dividing the storage tasks according to priorities; monitoring an IO pressure index of the storage system; when the IO pressure index is greater than a preset pressure threshold, reducing resource allocation to low-priority storage tasks in the storage system, so as to guarantee resource requirements of high-priority storage tasks in the storage system; and when the IO pressure index is not greater than the preset pressure threshold, driving execution of the low-priority storage tasks based on a system idle event. In this way, when the storage system is overloaded, resources are tilted to storage tasks with higher priorities, which can avoid problems that may be caused by directly suspending low-priority storage tasks, such as long-term stagnation of system background tasks. When the storage system is in an idle time, low-priority storage tasks can be processed, so that the long-term health and stability of the storage system can be maintained.

This application discloses a method, apparatus, device, and system for driving multiple processes in drawing files, belonging to the field of drawing tool technology. The method includes: obtaining a task queue to be executed by the drawing tool, the task queue including a first transaction and a second transaction; while driving the first process of the drawing tool to execute the first transaction, executing the second transaction by driving the second process of the drawing tool during an idle time period, the idle time period being the idle time period during the execution of the first transaction by the first process. In this way, by driving one process to execute one transaction while driving another process to execute another transaction during an idle time period, it is possible to simultaneously drive multiple processes to execute transactions in parallel, fully utilizing the idle time period of the drawing tool itself, thereby reducing the total execution time of multiple transactions and improving the design efficiency of drawing files.

A technique for using radio resources in fixed frame periods, FFPs, (500) on a channel for radio communication in a radio network comprising a first node (100) and a second node (200) is described. Each of the FFPs (500) comprises an idle time, IT, (502) for clear channel assessment, CCA, (506) of the channel and a maximum channel occupancy time, M-COT, (504) for occupying the channel depending on the CCA (506). As to a method aspect of the technique performed by the first node (100), a method (300) comprises the step of selectively monitoring (302) the radio resources in the FFPs (500) on the channel. The selective monitoring (302) comprises refraining from monitoring a first set (602) of the radio resources, which is allocated to a first message of the second node (200) and which is partially or completely in the IT (502). Alternatively or in addition, the method (300) comprises the step of selectively transmitting (304) on the radio resources in the FFPs (500) on the channel. The selective transmitting (304) comprises refraining from transmitting on a first set (602) of the radio resources, which is allocated to a first message of the first node (100) and which is partially or completely in the IT (502).