44results about How to "Fast scheduling" patented technology

The invention provides a task scheduling method and a system and aims at solving the problem of limitation of a system in task scheduling. The task scheduling method includes the following steps. Firstly, a task which is mature based on a set time are selected and designated as a postposed task. Plan performing time of a preposed task is calculated through a task scheduling reliance dimension table of the postposed task and a task sequence number of the preposed task is read from the task scheduling reliance dimension table. A performing state of the preposed task in a task scheduling operation result list is found out according to the task sequence number and the plan performing time of the preposed task. If performing is successful, the postposed task is lined up in a task queue and waits for scheduling performing. Under all circumstances, as long as a postposed task is confirmed, a preposed task can be found out and the postposed task can be performed as the preposed task is successfully performed so that the task scheduling system is modified. Scheduling time is shortened, scheduling efficiency is improved and fault rate is reduced.

This invention discloses a weight minimum joint number dispatch server load balancing method. The technique scheme of the invention are the following: to preset the state representing each server current connection information in the server group, wherein, the said state is represented by data structure with at least one data item comprising data representing the current load states of each server; the said current server load states is represented by the first data item in at least one data item; when load is evenly dispatched, it goes through all first set data items representing current server load states ; it selects server relevant to minimum first preset data set to switch in and at the same time to alter the data item.

The invention discloses an urban traffic dispatching system and method based on image fusion in severe weather. The system comprises a traffic dispatching center, a synthetic aperture radar and an optical remote sensing radar, wherein the synthetic aperture radar and the optical remote sensing radar are carried on a satellite. The traffic dispatching center comprises an image processing sub-center used for processing real-time images to obtain real-time traffic flow levels of roads and an information issue sub-center used for issuing the real-time traffic flow levels of the roads to vehicle groups. The method includes the steps that image sequences of SAR images and PAN images of a city are shot through the satellite in real time; the images are transmitted and preprocessed; the SAR images and the PAN images are fused; the traffic flow levels of the roads are divided; road information is issued. According to the urban traffic dispatching system and method based on image fusion in severe weather, through image fusion, urban road traffic conditions are recognized and the traffic flow levels of all the roads are evaluated, information is broadcast to vehicles through the traffic dispatching center in real time, and thus urban traffic dispatching is achieved, and traffic jams caused by severe weather can be effectively prevented.

The method comprises: NodeB calculates the desired stack and current stack of current MAC-D-QUE queue, and decides if the current stack is within the preset control range of initiation traffic; if yes, NodeB subtracts the current stack from the desired stack to get stack difference; according to the ratio of stack difference to the desired stack, and the output speed of transmitting HSDPA data from MAC-D-QUE queue to UU port, the NodeB calculates the input speed of transmitting data from RNC to MAC-D-QUE queue through Iub, and according to the input speed, calculates the relevant traffic control parameter; according to the parameter, forming the capacity allocation control frame that is sent to RNC; according to the capacity allocation control frame, RNC adjusts the HSDPA data transmission speed from Iub port to the base-station.

The invention discloses a device and method for task processing and belongs to the technical field of wireless communication. The method includes: a task processing device obtains one to a plurality of configured tasks, and a scheduled task is selected in one to the plurality of tasks; the scheduled task is processed according to control parameters of the scheduled task to obtain a processing result, the processing result of the scheduled task is output, and a primary task processing device is scheduled according to the control parameters of the scheduled task to process the scheduled task. After the task processing device selects the scheduled task from one to the plurality of the configured tasks, the scheduled task is processed in real time according to the control parameters of the scheduled task so as to achieve that each task processing device performs task scheduling processing independently. In addition, through mutual scheduling of the task processing devices, centralized scheduling through an independent scheduler does not need, distributed scheduling of task processing is achieved, and the device and method for the task processing has the advantages of being rapid in scheduling speed and high in task processing efficiency.

The invention provides a sea area large-scale antenna planar array beam selection and user scheduling method, and relates to the technical field of sea area scheduling. The method comprises the stepsas follows: R1, a shipborne AIS system performs information interaction with a shore-based base station equipped with a large-scale antenna planar array, and acquires position information of each user; and then height information of the shore-based base station and height information of a ship terminal are acquired via a height indicator; R2, a sea area range covered by beams corresponding to thelarge-scale antenna planar array is divided according to the user position information, and the height information of the shore-based base station and the ship terminal acquired in the step R1, and each user is divided into each corresponding beam; R3, the user with the highest priority is selected from each beam, and sequentially put into the set of users to be served; and R4, in each schedulingperiod, the user in the set of users to be served is scheduled according to a system weight and rate maximization criterion for service, and the unused beams are closed. According to the method provided by the invention, the beam selection and user scheduling speed is fast, and the algorithm complexity is low.

The invention provides a scheduling method based on a bottleneck procedure. The scheduling method includes the long-term programming stage and the short-term scheduling stage. The long-term programming stage includes the steps of establishing a mathematical model according to a linear programming algorithm with yield maximization of product orders during a first preset time period serving as the scheduling target and the current capacity serving as the resource, solving the scheduling amount of the bottleneck procedure of the product orders during the preset time period, and adding production lines if the product orders can not be completed according to the solved scheduling amount of the bottleneck procedure. The short-term scheduling stage includes the steps of establishing a mathematical model according to a linear programming algorithm with yield maximization of product orders during a second preset time period serving as the scheduling target and the current capacity and the current completion number serving as the resource, solving the scheduling amount of the bottleneck procedure of product orders in each day, and conducting scheduling on the product orders in each day according to the solved scheduling amount of the bottleneck procedure of the product orders in each day. By means of the scheduling method based on the bottleneck procedure, scheduling can be rapidly and accurately conducted on the product orders, and the manufacturing cycle of electronic products is shortened.

The invention discloses a two-layer economic optimizing and scheduling method for calculating embedded transmission losses of a resistor. The method aims to change the current situation that in current power system scheduling, transmission loss influence is ignored, or the transmission losses cannot be considered accurately, a two-layer power system unit combination model based on embedded transmission losses of Benders decomposition is provided based on the method of calculating the modified direct-current tides of the resistor, the upper-layer decision (master problem) does not consider network safety to carry out unit combination, the lower-layer decision (sleeve problem) is based on the provided method of calculating the modified direct-current tides of the resistor, network safety is verified, meanwhile, the system embedded transmission losses can be optimized, and the embedded transmission loss method improves the precision and speed of the system for considering the transmission losses. Refinement and efficiency of power system scheduling are achieved.

The invention relates to a user scheduling method based on dynamic clustering of a densely distributed wireless network. Firstly, a central processing unit collects long-time channel information of users, each user utilizes the long-time channel information to select an RAU (Remote Access Unit) with the minimum large scale fading, then a ratio of the large scale fading of the users among the RAUs is calculated, the RAUs are merged to form a plurality of cooperation clusters, and each cooperation cluster includes a plurality of adjacent RAUs; and then short-time channel information is utilized, and each RAU cooperation cluster schedules a user set in parallel according to a sum data rate maximum criterion. According to the user scheduling method disclosed by the invention, clustering is carried out by using the users as the center; the user scheduling method can be suitable for variations of user mobility in a real system; spectrum utilization efficiency of the system is improved; and moreover, the user scheduling method has the advantages of low algorithm complexity and low cost of the required channel information.

The invention discloses a Qos (Quality of Service) implementation method based on clustering design, which relates to the field of congestion management of network switching chips, and comprises the following steps: generating a plurality of cluster layers, wherein each cluster layer comprises a plurality of ordered clusters, each cluster in the previous cluster layer is used as a node, and a plurality of different continuous clusters in the next cluster layer are mapped; and allocating a to-be-scheduled layer of queue in the existing Qos / Hqos structure framework to a bottom cluster layer according to a mode that a plurality of queues correspond to one cluster, and modifying whether the cluster has qualification and priority according to whether the to-be-scheduled queue has qualificationand priority; scheduling the queue according to the priority: from the bottom layer to the top layer, performing dynamic weighted cycle (DWRR) / cycle (RR) scheduling on a plurality of clusters corresponding to the same node, and performing strict priority (SP) scheduling on the clusters with different priorities corresponding to the same node. According to the Qos implementation method based on clustering design, complex scheduling linked list management is avoided, the data flow can be controlled more finely, and the network service quality is higher.

The present application relates to a data scheduling processing method, an apparatus, a computer device and a storage medium based on a multi-core processor. The method comprises the following steps of: creating a temporary storage area for storing the operation data information to be migrated generated by a plurality of kernels; sending the running data information stored in the temporary storagearea to the kernel, and the kernel processes the running data information to obtain feedback information; according to the identifier of the feedback information, deleting the corresponding operationdata information in the temporary storage area, and sending the feedback information to the corresponding kernel according to the identifier of the feedback information; the occupied capacity of thetemporary storage area is detected, and when the occupied capacity is greater than the first threshold value, all the cores are controlled to stop generating the running data information. The method is used for orderly controlling the scheduling of the running data information among the cores, avoiding the problem of data accumulation, fast scheduling speed, and stable data sharing among the cores.

A method for transmitting message on packet ring includes setting up source node queue with different priority level on each node of packet ring according to different source node address and priority level , storing on node message from packet ring and message of the node separately to corresponding source node queue according to source node address and priority level of each message , dispatching source node queue in the same priority level to a corresponding priority level output queue separately and transmitting priority level output queue to packet ring according to preset mode .

The invention discloses an intra-regional electric vehicle charging scheduling method based on a game theory. The method comprises the following steps: 1) designing a new electric vehicle allocation criterion based on user charging cost; 2) giving an optimization problem of each intelligent charging station in the region by taking charging station income and ideal automobile capacity of the charging station as a comprehensive target; 3) according to the proposed optimization problem, modeling a competitive relationship among the multiple charging stations by utilizing a game theory; 4) demonstrating the existence of pure strategy equilibrium points of the game model defined in the step 3), and giving definition of Nash equilibrium and existence conditions of pure strategy Nash equilibrium;and 5) solving Nash equilibrium by combining an iterative search method and a particle swarm algorithm. According to the invention, the constraint of the ideal capacity of each charging station is considered while the profit of each charging station is satisfied for the intelligent charging station with relatively strong networking communication capability and calculation capability, the scheduling speed is high, the real-time performance is good, the problem of malicious competition among the charging stations is solved, and the balanced utilization of charging resources is achieved.

The invention relates to a bottom-up distributed scheduling system and method, and the system comprises a global scheduler, which stores and identifies child nodes of enough resources with task request types in a distributed cluster, and receives scheduling task requests forwarded by local schedulers from all child nodes, and makes a scheduling decision according to the load of each child node andthe constraint of the task; local schedulers, used for arranging the tasks locally for processing, and if the local schedulers do not meet the scheduling requirements, the local schedulers can forward the tasks to the global scheduler; and a global control storage unit, used for storing the information of the tasks forwarded by the local scheduler. According to the system, a scheduling mode withlocal scheduling priority and global scheduling as assistance is set, the characteristic of task isomerism in reinforcement learning is met, and the scheduling speed of isomerism tasks is high; extension is very convenient, task assignment and task scheduling are completely separated, and delay minimization is achieved.

The invention relates to an order scheduling method. The method comprises the steps of determining a bill of materials of an order through order data of a client; determining the process path of the order product and the production flow of the product according to the bill of materials; based on a production process of products, determining processing equipment required to be used by each order ineach production process; prior to an order delivery date, for the equipment to which each order is applied, carrying out sequential production sorting on each order; determining the production starting date and the production ending date of each order. The sequential production sequence of the orders is determined according to the equipment occupation condition, the equipment occupation time in each order is reasonably distributed, the production execution efficiency of each order is improved, and the mode avoids the waiting and overdue of order production caused by equipment occupation; andmeanwhile, rapid scheduling of each order can be realized rapidly, so that convenience and high efficiency are realized.

This invention discloses one HSMAC adjusting method based on dispatched pattern, which comprises the following steps: entering 2MS dispatching and if firstly entering one new frame dispatching circle to initiating current frame public materials codes, HS-SCCH signal materials codes and dispatching pattern data, current frame dispatching HARQ and its belonged dispatch frame position mask; if front frame materials code is not zero, selecting one HARQ dispatching process to get position coordinate and to repair HARQ and its sub frame position mask, HS-SCCH signal material codes, public signal materials codes to enter next dispatching signal materials to wear out remaining data block of zero.

The invention discloses a scheduling method and system of a diagnostic program and a diagnostic apparatus. The scheduling method of the diagnostic program includes the steps of scanning the information of diagnostic process after loading FAT file system, and displaying the information of diagnostic process on a screen for users to choose; ensuring a target diagnostic program according to the choice of users; loading the target diagnostic program to an internal storage and scheduling the target diagnostic program. According to the method, the loading of the operating systems such as WINCE is not needed when the diagnostic apparatus starts, and therefore the system is quick to start; in scheduling the diagnostic program, the scheduling speed is fast and the instantaneity is high due to the single task execution.

The invention discloses an intelligent production scheduling system based on a genetic algorithm. The method at least comprises the following steps: 1, randomly generating a population with a certainscale, wherein individuals in the population are composed of two chromosomes, the gene of the chromosome 1 is a random sequence combination of all tasks and optional equipment, the gene of the chromosome 2 is the daily working time of overtime equipment, and the working time is randomly generated; step 2, randomly selecting two parents from the population to perform gene recombination; step 3, adding the filial generation individuals generated by recombination into the population; step 4, randomly selecting part of individuals from the population for gene variation; step 5, adding individualsgenerated by variation into the population; step 6, calculating the production starting and ending time of the task; 7, calculating a target function value; step 8, screening out all non-dominated individuals; 9, eliminating advantages and disadvantages; and step 10, carrying out evolutionary iteration. The intelligent production scheduling system is short in production scheduling calculation time, high in efficiency and capable of rapidly dealing with abnormal conditions for production scheduling.

The invention relates to an online shop big data processing method and device, equipment and a storage medium. The method comprises the following steps: reading commodity data in an Hbase through a Spark program, and generating an elastic distributed data set RDD; converting the RDD into the DataFrame; filtering data in the DataFrame through an online shop website ID and shelve-unshelve conditions; converting the DataFrame with data filtered into the RDD again; matching each piece of data of the reconverted RDD with a pre-configured acquisition scheme and an acquisition task through a MapPartitions operation of the RDD, and generating an optimal scheduling item; and pushing the generated optimal scheduling item into different link pools according to the task frequency. According to the technical scheme provided by the invention, the scheduling speed of the commodity data is greatly improved, the volume of the scheduled commodity data is stable, and the situation of reading failure of partition data is greatly reduced.

The invention relates to a vehicle pusher, which belongs to engineering machinery. The vehicle pusher in the technical scheme comprises a vehicle body and a cab, two moving wheel sets are arranged atthe lower part of the vehicle body, the front moving wheel set is a steering wheel, the rear wheel set is a moving wheel set, the cab is arranged on the vehicle body above the front moving wheel set,an engine is arranged on the vehicle body above the rear moving wheel set, automatic vehicleriage connectors are arranged on the front portion and the rear portion of the vehicle body respectively, and cameras are arranged on the front side of the cab of the vehicle body and the rear portion of the vehicle body respectively. The vehicle pusher has the advantages that the vehicle pusher can be directly used for pulling and pushing a rail locomotive or a vehicleriage on a railway dispatching site, the dispatching speed is high, and the working efficiency is high; the connector of the device canbe operated manually and automatically, is suitable for connection of various rail vehicleriages, and is convenient to use.

The multi-dimensional transfer robot for the three-dimensional parking equipment comprises a base and a frame, the top of the base is fixedly connected with the surface of the frame, vertical lifting assemblies are fixedly connected to the two sides of the middle of the top of the base correspondingly, and fixing blocks are fixedly connected between the two vertical lifting assemblies correspondingly; and the tops of the two fixing blocks are fixedly connected with a bearing plate. According to the multi-dimensional transfer robot for the three-dimensional parking equipment, vehicles can be dispatched more conveniently and more simply in a multi-area space, operations such as lifting, rotating and translation can be completed at a time only by moving the vehicles to proper positions, the positions of the vehicles can be dispatched conveniently and accurately, and the working efficiency is improved. The space of the position where the vehicle is located in the dimension space is fully utilized, so that the situation that the vehicle is stacked and congested is not prone to occurring, perfect utilization of the space can be guaranteed, overall transfer is more convenient, and people can use the vehicle conveniently.

The invention discloses an intelligent calculation application and method based on assembly line production in the small household appliance industry. The method comprises the following steps that after an order is received, the order is put into an order pool; the orders are taken out from the order pool, and splitting schemes are arranged for the taken-out orders; judging whether machines in the currently arranged scheme meet the minimum starting-up amount or not, and if not, repeating the previous step; whether all the orders are split or not is judged, and if sorting is not completed, the previous operation is repeated; and starting production according to the splitting scheme. The invention belongs to the technical field of computers, and particularly provides a multi-production-line optimal processing production line which is not disordered in scheduling, capable of automatically achieving order splitting, easy to achieve small-batch and multi-variety rapid scheduling, simple and flexible in operation, capable of achieving rapid identification of bottleneck procedures and capable of automatically completing multi-production-line optimal processing. And the intelligent calculation application and method based on the assembly line production in the small household appliance industry can simplify the production schedule.

The invention provides a mimicry OpenStack component and a mimicry OpenStack cloud platform, the mimicry OpenStack component comprises a first input agent distribution module, a second input agent distribution module, a plurality of heterogeneous actuators, a first decision output module, a second decision output module and a feedback scheduling module, and each heterogeneous actuator comprises anAPI interface, a rabbitmq module and at least one sub-service module; the API interface is respectively connected with the first input agent distribution module and the rabbitmq module, the rabbitmqmodule is respectively connected with the sub-service module, the second input agent distribution module and the first decision output module, and the feedback scheduling module is connected with thefirst decision output module and the second decision output module.

The invention discloses a schedule arranging method and a system. The method comprises the steps of 1, turning objects to be scheduled to nodes so that all logics in schedule arranging are in the nodes; 2, performing idle / occupation presenting on each node through proofing a time dimension; and 3, connecting the nodes which are associated in a certain time period, thereby forming a subgraph in a time dimension; adding interpreting system between user operation interactions, and converting a language which is described by a user to a code language through the interpreting system. The schedule arranging method and the system have advantages of high schedule arranging speed, easy visualization, convenient report table generation and high suitability for multiple service scenes.