Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

44results about How to "Reduce allocation time" patented technology

Automobile manufacturing intelligent production scheduling processing method

The present invention discloses an automobile manufacturing intelligent production scheduling processing method. The method comprises the following steps of: receiving order information input from theoutside, and adding the order information into an order material list; combining product series and product models in the order material list and a preset manufacturing material list to generate a manufacturing material list; and combining the automobile product names and the automatic product codes in the manufacturing material list and a preset process material list to generate a production material list. The production material list of required production is automatically generated according to orders. Because the production material list, the assembling pitch time and the logistics pitchtime of each station in the production are calculated; and according to the pitch time of the manufacturing process of each product and the required produced number, and according to the calculation method in the document mentioned above, on the premise of ensuring the market demand, the production organization is performed by the fewest manpower resource so as to achieve the purpose of the benefit optimization production scheduling.
Owner:苏州圣基尚源信息科技有限公司

Method for distributing large continuous memory of kernel

The invention provides a method for distributing a large continuous memory of a kernel. The method comprises the following steps of: acquiring a maximum memory page during distribution of the kernel; calculating a required memory page number N; turning to a step F if determining that the is a negative number; applying the memory according to the if determining that the is not a negative number; reducing the and turning to a step C if the application fails; combining combinable memory blocks to serve as the continuous memory if the application is successful; turning to a step E if determining that a newly combined continuous memory which meets requirement exists; turning to the step C if determining that the newly combined continuous memory which meets requirement does not exist; turning to the step F when determining that the application is successful due to the existence of the memory which meets requirement; jumping to the step C if the memory which meets requirement does not exist; and releasing unused memory. By the method, large continuous memory blocks can be quickly distributed from the kernel; and compared with the conventional distribution method, the distribution time is shortened. The method is mainly guaranteed in two aspects: on one hand, a maximum number of distributable memories is used for applying to the kernel each time; and on the other hand, continuous regions are immediately combined and whether the combined memory meets requirement is immediately determined after the memory is distributed each time, so extra application operation is not required.
Owner:曙光网络科技有限公司

Cloud computing energy consumption optimization method and system based on phase space

The invention relates to the field of cloud computing, and discloses a cloud computing energy consumption optimization method and system based on a phase space, in order to optimize the energy consumption in cloud computing, reduce the task allocation time and improve the task allocation efficiency. The method disclosed by the invention comprises the following steps: obtaining all nodes in a cloudcomputing system, and context environmental information of the nodes, and establishing an energy consumption model; measuring the total energy consumption of all tasks that are being executed of thenodes, and establishing a static energy consumption phase space according to the total energy consumption; predicting the energy consumption required for a newly added task by using the energy consumption model, and establishing a dynamic energy consumption phase space; calculating according to the static energy consumption phase space to obtain an optimal sub-phase space; and predicting the energy consumption of the newly added task in the nodes in the optimal sub-phase space, designing a task scheduling algorithm according to the static energy consumption phase space and the dynamic energy consumption phase space, and determining an optimal task allocation scheme of the newly added task.
Owner:CENT SOUTH UNIV

Flood prevention material rescue distribution method based on non-dominated artificial bee colony

The invention relates to a flood prevention material rescue distribution method based on a non-dominated artificial bee colony. The method comprises: establishing a flood prevention material distribution optimization model based on warehouse material storage capacity constraints, material demand constraints and flood prevention material arrival time constraints; initializing a food source by adopting three methods of large-scale storage warehouse priority, disaster-affected demand priority and random allocation, and proposing a demand fitness value, a material satisfaction rate variance fitness value and a transmission time fitness value of the food source; in the employed bee stage, using a high-dimensional matrix local search method, and the space complexity being reduced through population classification and exclusion elimination; in the bee following stage, updating food sources through cross operation, and expanding the search range of the population; and in the bee reconnaissancestage, selecting a tail food source, a repeated food source and a food source reaching the evolution upper limit frequency to reconstruct. The distribution of flood prevention materials can be optimized, the distribution time of rescue materials is saved, the material distribution of each affected area is balanced, and the overall distribution efficiency of the flood prevention materials is improved.
Owner:ZHEJIANG SHUREN COLLEGE ZHEJIANG SHUREN UNIV

A frequency point distribution method and device under a frequency spectrum sharing mechanism

The invention provides a frequency point distribution method and device under a frequency spectrum sharing mechanism, and the method comprises the steps: receiving frequency point use request information sent by a base station, the frequency point use request information at least comprising the frequency point demand number of the base station; And if the number of distributable frequency points in the frequency point group corresponding to the base station is greater than or equal to the required number of the frequency points, selecting the frequency points with the number equal to the required number of the frequency points from the distributable frequency points, and distributing the selected frequency points to the base station. The invention provides a frequency point distribution method under a frequency spectrum sharing mechanism. Frequency points distributed to a management area are multiplexed among different divided areas; The frequency points are divided into the subareas,the subareas are divided into the subareas, the frequency points are grouped in each subarea, each base station corresponds to one frequency point group, the frequency points are selected from each frequency point group and distributed to the base stations, the interference constraint relation between the frequency points is simplified, the frequency point distribution time is shortened, and the system power consumption is reduced.
Owner:POTEVIO INFORMATION TECH CO LTD

Two-way exchange scheduling method

The invention discloses a same-way exchange scheduling method applied to a multi-plane and multi-stage structural network. In a fully-distributed service matrix with the degree as two, line-by-line traversal is performed on elements, the element which is found at the first time and has the nonzero value as one is taken as the starting point, nonzero values as one are searched for respectively in the line direction and the column direction of the elements, the nonzero values as one are searched for respectively from the two found nonzero values as one in the column direction of the same-line nonzero values as one and the line direction of the same-column nonzero values as one, the nonzero values as one are searched for respectively from the two currently-found nonzero values as one in the line direction of the same-column nonzero values as one and the column direction of the same-line nonzero values as one, and analogizing is sequentially performed. When the nonzero value elements are found each time, corresponding elements in a service matrix connected with the matrix are updated until all nonzero value elements in the service matrix are processed. According to the method, two service distribution results can be returned in each step after the step that the starting point is determined, and therefore the distributing time of the service matrix is shortened to be about half of that of an existing single-way ring algorithm.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Binary sort tree-based local-bargaining spectrum allocation method

The invention provides a binary sort tree-based local-bargaining spectrum allocation method. The method comprises the steps of dividing a scanned frequency spectrum into a plurality of signal channels at the initial moment, arranging the signal channels in an ascending sequence from small to large to construct a single-branch binary sort tree, allocating the signal channels to users based on the allocation algorithm to acquire an allocation matrix, updating users at each node of the binary sort tree according to the allocation matrix, updating the binary sort tree according to the variation of the scanned frequency spectrum during the next time period, and simultaneously reallocating the signal channels according to the variation of users that apply for signal channels. The above process is repeated until a command for stopping the frequency spectrum scanning operation is received. According to the technical scheme of the invention, the overall scanning result of frequency bands is in the form of a tree. In this way, the spectrum allocation is realized only through the inserting operation and the deleting operation on the binary sort tree. Therefore, the allocation time is saved. Under the circumstance of the lack of frequency spectrum resources, the spectrum utilization rate is increased and the satisfaction level of users is improved at the same time.
Owner:INNER MONGOLIA UNIVERSITY

Computer placement management method, examination monitoring machine, examinee machines and computer placement management system

The invention discloses a computer placement management method. The method comprises the steps of creating a socket when an examination monitoring machine is in a starting state, using the socket to execute monitoring operation, recording information of M examinee machines in M registering instructions if the M registering instructions sent by the M examinee machines are monitored within a first preset time period, and generating a mapping relation table of the information of the M examinee machines and M seat numbers, wherein M is smaller than or equal to N; sending examination information to the M examinee machines, wherein the examination information comprises the mapping relation table and a seat number displaying instruction; sending an examination client side starting instruction to the M examinee machines to make the M examinee machines execute starting operation according to the examination client side starting instruction and execute the seat number displaying instruction so that seat numbers can be displayed on the M examinee machines. The invention further discloses the examination monitoring machine, the examinee machines and a computer placement management system, seat numbers can be intelligently allocated, and the time for allocating the seat numbers is saved.
Owner:SHENZHEN SEA SKY LAND TECH

Method for distributing large continuous memory of kernel

The invention provides a method for distributing a large continuous memory of a kernel. The method comprises the following steps of: acquiring a maximum memory page during distribution of the kernel; calculating a required memory page number N; turning to a step F if determining that the is a negative number; applying the memory according to the if determining that the is not a negative number; reducing the and turning to a step C if the application fails; combining combinable memory blocks to serve as the continuous memory if the application is successful; turning to a step E if determining that a newly combined continuous memory which meets requirement exists; turning to the step C if determining that the newly combined continuous memory which meets requirement does not exist; turning to the step F when determining that the application is successful due to the existence of the memory which meets requirement; jumping to the step C if the memory which meets requirement does not exist; and releasing unused memory. By the method, large continuous memory blocks can be quickly distributed from the kernel; and compared with the conventional distribution method, the distribution time is shortened. The method is mainly guaranteed in two aspects: on one hand, a maximum number of distributable memories is used for applying to the kernel each time; and on the other hand, continuous regions are immediately combined and whether the combined memory meets requirement is immediately determined after the memory is distributed each time, so extra application operation is not required.
Owner:曙光网络科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products