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

An uplink resource allocation method is provided for transmitting a control packet on a channel different from a currently connected channel in a wireless communication system for supporting a packet based real-time service. A new format of a grant management subheader is proposed in which a piggyback request conventionally used only for the same connection can be used also for a different connection. A resource allocation request for the different connection can be made using the newly proposed grant management subheader. When the resource allocation request for a new connection is made using the grant management subheader, a resource allocation time can be reduced and loss of resources allocated for an existing connection can be minimized.

The invention discloses label distribution method, device, system and network equipment, and belongs to the field of network communication. The label distribution method comprises generating a first label exchange path to second forwarding equipment for first forwarding equipment, generating an FTN for the first forwarding equipment, generating an ILM for third forwarding equipment, and sending the FTN, the ILM and the first label exchange path for the first forwarding equipment and the third forwarding equipment, wherein the first label exchange path passes through the third forwarding equipment. The label distribution device comprises a path generation module, an FTN generation module, an ILM generation module and a sending module. The label distribution device distributes the same label to all forwarding equipment located on the same label exchange path, and in the data package forwarding process, a middle label exchange router does not conduct label popup / press-in operations any more after receiving a data package but directly forwards the data package, and therefore the effects that label distribution time is shortened and forwarding efficiency is improved are achieved.

The present invention provides a path distribution method and a device thereof to solve the problems of low transmission rate and too long transmission delay. The method comprises the following steps that a source node carries out path detection to generate route table which comprises optional paths and path delay and / or forward hop count corresponding to the optional paths, the source node generates a path distribution rule according to the optional path and path delay and / or forward hop count, when the sending of data is needed, the source node carries out path distribution on the optional paths according to the path distribution rule, and one or more optional paths which are in accordance with the path distribution rule are used as the effective paths for sending data. According to the path distribution method and the device, the transmission delay can be shortened, and the transmission rate is improved.

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.

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.

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.

The invention relates to a cargo collection scheduling method and device, and belongs to the technical field of data processing, and the method comprises the steps: enabling a plurality of collectionaddresses to be converted into latitude and longitude coordinates, and judging whether each latitude and longitude coordinate meets a clustering condition or not; Taking each collection address corresponding to each latitude and longitude coordinate meeting a clustering condition as a clustering center, and generating a polygonal collection area by using each clustering center; When it is monitored that a to-be-collected order exists in the polygonal collection area, judging a clustering center to which the to-be-collected order belongs according to a collection address of the to-be-collectedorder; And judging whether a cargo receiver exists in a preset range of a clustering center to which the to-be-received order belongs, and distributing the to-be-received order to the cargo receiver when judging that the cargo receiver exists in the preset range. According to the method, the cargo distribution time can be saved, and the timeliness of distribution of the to-be-received orders is improved.

The invention provides a method for distributing a register in an embedded system based on an inverse image description, which mainly solves the problems that the conventional heuristic algorithm requires short time for distributing the register but has poor distributing effect, while a hybrid evolutionary algorithm has the good distributing effect but requires overlong time. The method comprisesthe following steps of: (1) taking an inverse image from a mutual interference figure of an intermediate variable to obtain an inverse figure model G; (2) distributing all nodes in the inverse figuremodel to a temporary register; and (3) optimizing the obtained register distribution result by using local search technology, namely a local search platform (LSP). The method has the advantages of introducing inverse figure operation, complete dividing figure operation and maximum complete sub-figure operation, utilizing the relevant knowledge of a graph theory fully, acquiring a very good methodfor distributing the register in the embedded system within a short time, increasing the program compilation efficiency of the embedded system, along with more actual application value.

Dynamic channel allocation (DCA) is adopted in the indention. When new call arrives to system, as long as there is a one vacant channel, mobile control center allocates the channel to the call. After the call is ended, the channel is returned back to central storage area. The invention solves technique issue for quick accessing channel and raises quality of service of mobile communication. Features are: avoiding interference, minimized distance of reusing channel, using wireless resources in high efficiency and increasing system capacity.

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.

The invention discloses a physical cell identification distribution method based on fuzzy hierarchical clustering, and belongs to the field of communication networks. In order to solve the quality problem of network service communication in a user dense area, the invention provides a physical cell identification method based on fuzzy hierarchical clustering based on the activeness attribute of a cellular network base station. According to the invention, an "activeness" attribute concept of a cellular cell base station is introduced; solving the similarity of different cellular cell base stations by adopting an Euclidean distance method; A fuzzy hierarchical clustering algorithm in pattern recognition is adopted, so that allocation and multiplexing of physical cell recognition (PCI) are carried out on a cellular cell base station group with relatively high degree of activity preferentially. According to the method, the network service quality (Quality of Service, QoS) of the user and the distribution efficiency of the PCI are effectively improved. The invention discloses a physical cell identification and distribution method for a cellular network cell base station.

The invention discloses an automatic case distribution system and method, a storage medium and computing equipment, and the system receives an auditing request of a to-be-audited case through a receiving module, and obtains the case attribute information of the to-be-audited case; a queue selection module selects a target case queue from a plurality of project case queues based on the case attribute information, and adds the to-be-audited cases to the target case queue; and finally, a first target auditor matched with the target case queue is obtained through an allocation module, and the to-be-audited case is allocated to the first target auditor for auditing. Based on the automatic case system provided by the invention, when the auditing request is received, the auditor matched with theauditing request is selected to automatically distribute the case, so that the case distribution time is saved. Moreover, in the case allocation process, the auditing role, the allocated case quantity, the online state and the like of auditing personnel are combined, so that the fairness of case allocation is ensured.

The invention discloses a virtual machine distribution method in a data center with minimized communication delay. The method comprises the following steps of S1, judging whether virtual machine colonies which can communication with one another and of which the scale is more than that of data nodes exist in a certain threshold of the communication delay; and S2, if yes, finding a complete subgraph composed of virtual machines under such threshold by using an efficient backtracking method or an improved greedy algorithm, and then adopting a Hopcroft-Karp algorithm to distribute the virtual machines in the complete subgraph to the data nodes; and if no, repeating the step S1. According to the virtual machine distribution method of the invention, solution space can be effectively reduced, and the virtual machine distribution time can also be reduced.

The invention provides an intelligent management system for a dormitory, and the system comprises: a user management unit which is used for building a personnel organization architecture, adding a user to the personnel organization architecture, and setting the authority of the user; an attendance management unit which is used for carrying out face information auditing on the to-be-approved accesscontrol personnel through face detection equipment and access control system management and controlling the access control system to open the approved access control personnel; a dormitory monitoringunit which is used for acquiring dormitory information by receiving the infrared sensor signal, the smoke detector signal and the fire alarm signal; an information statistics unit which is used for carrying out statistics on sanitation examination records and teacher duty records; and a hydroelectric management unit which is used for collecting hydroelectric consumption and controlling on-off. The entrance guard safety is improved, strangers are prevented from entering, strangers are prevented from following to enter, and the system is not limited to dormitory distribution and attendance andalmost covers all functions of dormitory daily management work and safety management work.

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.

The invention discloses a multi-user authority distribution method. The method comprises the following steps of setting a multi-user authority distribution service component; using the multi-user authority distribution service component to automatically generate a corresponding calling program according to the application name, the component name, the plug-in name and / or the software and hardwareequipment name, wherein the multi-user authority distribution service component comprises a default authority and a user-defined authority, and the authority is automatically distributed to each calling program; and if a certain application, component, plug-in and / or software and hardware equipment needs to be accessed, accessing by loading a corresponding calling program. According to the invention, the distribution workload of users and authorities can be simplified, the distribution time is saved, and the effect is more obvious especially when the number of application or hardware equipmentfacilities is large.

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.

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.

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.

The invention discloses a user ID distribution method based on a global equipment unique number identifier. The user ID distribution method comprises the following steps: an Internet of Things terminal sends an access request to a service provider gateway, and the access request comprises the global equipment unique number identifier; and the service provider gateway verifies the global device unique number identifier, and allocates a user ID to the Internet of Things terminal based on the global device unique number identifier and a service provider to which the Internet of Things terminal belongs after the verification is passed. Based on the unique identifiers, the user ID distribution method based on a global equipment unique number identifier can effectively prevent access of illegalusers, and meanwhile can conveniently distinguish and manage group users.

The invention discloses a label distribution method, device, system and network equipment, belonging to the field of network communication. The label allocation method includes: generating a first label switching path for the first forwarding device to the second forwarding device, the first label switching path passing through the third forwarding device; generating an FTN for the first forwarding device; generating an FTN for the third forwarding device Generate an ILM; send the FTN, the ILM, and the first label switched path to the first forwarding device and the third forwarding device. The label distribution device includes a path generation module, an FTN generation module, an ILM generation module and a sending module. The present invention distributes the same label to all forwarding devices located on the same label switching path, and in the process of data packet forwarding, the intermediate label switching router does not perform label pop-up / press-in operation after receiving the data packet, but It directly forwards the data packets, which reduces the label allocation time and improves the forwarding efficiency.

The present application provides a method for processing requests, a system on chip and a public cloud management component. The method is performed by a system on chip. The system-on-chip is contained in a bare metal server. The bare metal server also includes a processor. The bare metal server is included in a distributed storage system. The distributed storage system also includes a public cloud management component. The method includes: the system-on-chip receives a volume-hanging request sent by the public cloud management component, and the volume-hanging request includes a system volume identifier; the system-on-chip saves the system-volume identifier according to the volume-hanging request, and , the identity of the system volume is used by the bare metal server to determine the system volume, and the operating system of the bare metal server is started according to the system volume, and files for starting the operating system of the bare metal server are stored in the system volume. The method for processing requests in the embodiment of the present application helps to quickly allocate bare-metal servers, and improves efficiency and user experience.

An apparatus and method for network address allocation are provided, in which an interface module performs wireless communications through an antenna, and a protocol controller performs wireless communications using a predetermined protocol and performs a network address acquisition procedure during network entry.

The present invention provides a path allocation method and device to solve the problems of low transmission rate and long transmission delay. One of the path allocation methods includes: a source node performs path detection to generate a routing table, where the routing table includes: optional paths and path delays and / or forwarding hops corresponding to the optional paths; and / or forwarding hops to generate path allocation rules; when data needs to be sent, the source node performs path allocation on the optional paths according to the path allocation rules, and one or more optional paths that conform to the path allocation rules as a valid path for sending data. The invention can shorten the transmission delay and improve the transmission rate.

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 elements of two nonzero values as one which are found at the first time and are arranged on the same line are taken as the starting point, the nonzero values as one are searched for respectively in the corresponding column direction, the nonzero values as one are searched for respectively in the corresponding line direction of the two found 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, and therefore the distributing time of the service matrix is shortened to be half of that of that of an existing single-way ring algorithm.

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.

According to the resource allocation method, device and equipment and the computer readable storage medium provided by the embodiment of the invention, flexible configuration of resource allocation strategies of various types of cases can be realized through the case configuration interface; flexible configuration of the distribution parameters of the sub-mechanisms of each level in each receiving mechanism can be realized through the mechanism distribution parameter configuration interface;based on flexibly configured allocation parameters of sub-mechanisms of each level in each receiving mechanism and resource allocation strategies of the cases of each type, the to-be-processed cases of the receiving mechanism are automatically allocated to each level in the receiving mechanism, so that multi-level flexible and intelligent resource allocation in each receiving mechanism is realized, the resource allocation time is greatly shortened, and the resource allocation efficiency is improved.

The invention relates to the field of cloud computing, and discloses a cloud computing energy consumption optimization method and system based on phase space, so as to optimize energy consumption in cloud computing, reduce task allocation time, and improve task allocation efficiency; the method of the invention includes obtaining cloud Calculate all nodes in the system and their context information, and establish an energy consumption model; measure the total energy consumption of all tasks being executed by the node, and establish a static energy consumption phase space based on the total energy consumption; use the energy consumption model to predict new The energy consumption required by the task, and establish the dynamic energy consumption phase space; calculate the optimal sub-phase space according to the static energy consumption phase space; predict the energy consumption of each node in the optimal sub-phase space for the new task, and calculate the Phase space and dynamic energy consumption Phase space design task scheduling algorithm, and determine the optimal task allocation scheme for new tasks.

The service chain grouping and reorganization method of mobile edge computing includes the following steps: step S1, establish a mobile edge computing system; step S2, the hash group manager of the edge node judges whether the edge node can provide the received user equipment The service functions of the required service chain; step S3, all service functions in the service chain are configured on edge nodes; step S4, part of the service functions in the service chain are configured on edge nodes, and the remaining service functions are configured on core network nodes; step S5 , all service functions in the service chain are configured on the core network nodes; Step S6, reorganize the group nodes. In this solution, user equipment requirements are grouped. A group only needs to configure a set of service chains, and users in the group share this service chain. Therefore, the usage of flow entries when configuring service chains is reduced, and the possibility of group table overflow is reduced. Reliability, as well as the number of information exchanges between edge nodes and core network nodes, thereby reducing the delay in the control layer.