194 results about "Group scheduling" patented technology

A system for scheduling time intervals for a plurality of users comprises a database associated with one or more server means for storing a profile for each potential invitee of the system. Each invitee profile comprises user profiles that have information regarding available and unavailable times for that user and the electronic mail address for the user and resource profiles having information about the available times for a particular resource such as a room or equipment. A request generator connected over a network to the one or more server generates a request for allocation of a time interval for one or more of the plurality of invitees. The system then provides a busy time determination device that gathers the profiles for the plurality of invitees that were requested by the request generating means and that are available in the databases and determines whether those invitees are available during the time interval requested by the request generating means. For all available invitees, the electronic mail address in the profile is used to send each available requested invitee an invitation to attend at the requested time interval.

A system, interface and method provide for agenda based meeting management that enables an agenda to be determined and utilized for managing one or more meetings that may include locally located participants, remote participants or both. Various embodiments enable meeting management to be conducted in an independent manner or in a composited manner with a conferencing or other meeting or support application or application data. Embodiments further provide for responding to user modification of a meeting or agenda item or group scheduling by automatically re-scheduling the meeting uncompleted agenda items or both according to the user modification. A management UI embodiment further provides a progress bar including a progress indicator and agenda indicia that may be disposed proximate to the progress indicator with spacing of the indicia being proportional to current agenda item scheduling. A more specific embodiment enables the progress bar to be used for tracking, controlling or modifying agenda portions.

A system, method and computer program product for managing computer resources in a computer system running an operating system and a plurality of processes grouped into at least two groups. A set of resource limits corresponds to the processes. A scheduler of resource allocation allocates resources to each process such that total resource allocation to a group to which that process belongs remains constant. The resources comprise, e.g., network bandwidth, number of network connections, I/O bandwidth for peripheral devices, number of operations in a period of time for service operation with countable requests for service, number of operations in a period of time for a daemon with countable requests for service, permission for execution of operation, number of security descriptors, and number of terminals. The scheduler reallocates the resources based on a predictive algorithm, or based on process priority, or based on relative weighting of the processes. The scheduler can adjust an increase and a decrease of the resources available to a particular process. The scheduler is capable of increasing a resource allocation restriction to one process by and by waiting for that resource to become available. The scheduler is capable of increasing a resource allocation to one process by reducing allocation restriction to other processes in the same group on a basis proportional to their current use of that resource. The scheduler can reduce a resource allocation to a particular process based on a history of consumption of the resource by that process and a history of consumption of other resources by that process.

A DRAM command scheduling algorithm is presented that is designed to alleviate various constraints imposed upon high performance, high datarate, short channel DDRx SDRAM memory systems. The algorithm amortizes the overhead costs of rank-switching time and schedules around the t_FAW bank activation constraint. A multi-rank DDRx memory system is also presented having at least two ranks of memory each having a number of banks and at least one memory controller configured for performing the hardware-implemented step of DRAM command scheduling for row access commands and column access commands. The step of command scheduling includes decoupling the row access commands from the column access commands; alternatively scheduling the decoupled row access commands to different ranks of memory; and group scheduling the decoupled column access commands to each bank of the number of banks of a given rank of the different ranks of memory.

A method and apparatus of signaling radio resource allocation in a wireless communication system includes establishing groups of mobile stations which monitor a shared group scheduling bitmap; transmitting a group scheduling bitmap to the mobile stations, wherein the group scheduling bitmap contains a mobile station presence bitmap and an SDMA bitmap, wherein the SDMA bitmap is used to divide the group members into two or more subgroups; and transmitting packets to the mobile stations or receiving packets from the mobile stations using the radio resource which is derived from the value indicated in the group scheduling bitmap.

A method and apparatus for scheduling multiuser terminals in a communication system is provided. A receiver receives feedback information from a plurality of user terminals. A user grouping unit selects terminals having a maximum Signal to Interference plus Noise Ratio (SINR) among terminals having the same beam index and beam subset index, from among the plurality of user terminals, and generates terminal groups using the selected terminals, each terminal group including terminals having the same beam subset index. A group scheduling unit calculates a throughput of each of the terminal groups to determine which terminal group has the maximum throughput. A random precoding unit generates random beam vectors corresponding to terminals included in the terminal group determined to have the maximum throughput, and transmits data for user terminals, included in the terminal group determined to have the maximum throughput, over the generated random beam vectors.

A wireless communication network (100) wherein information is communicated in frames comprising multiple sub-frames, including grouping a terminal in first and second groups, assigning the first and second groups to less than all sub-frames in a frame, assigning a control channel of at least one assigned sub-frame to the first and second groups

The invention provides an optimized scheduling method of a semiconductor production line based on a Petri net and immune algorithm. The method utilizes the Petri net for carrying out modeling to the semiconductor production line, comprising a path scheduling model, an equipment group scheduling model and an equipment scheduling model; and the immune algorithm is embedded in the Petri net model as the scheduling strategy. By the Petri net model, all possible acts of the semiconductor manufacturing system can be described, such as work-piece processing, equipment failure, batch processing, defected wafer rework and the like. The chromosome of the immune algorithm can be directly structured out of search nodes of the Petri net model, and each gene of each chromosome records the scheduling strategy of each equipment group. A better chromosome is obtained by the simulation of the Petri net model, and therefore a sub-optimal scheduling strategy is generated. The optimized scheduling method has the advantages of reducing the complexity of the model and improving the reusability of the model and the scheduling algorithm.

A method for managing a thread group of a process is provided. First, a group scheduling module is used to receive an execution permission request from a first thread. When detecting that a second thread in the thread group is under execution, the group scheduling module stops the first thread, and does not assign the execution permission to the first thread until the second thread is completed, and till then, the first thread retrieves a required shared resource and executes the computations. Then, the first thread releases the shared resource when completing the computations. Then, the group scheduling module retrieves a third thread with the highest priority in a waiting queue and repeats the above process until all the threads are completed. Through this method, when one thread executes a call back function, the other threads are prevented from taking this chance to use the resource required by the thread.

The invention discloses an intelligent roadbed and pavement roller compaction system which comprises a quality detection system, an intelligent decision making system, an unmanned roller compaction system and a remote monitoring center. The quality detection system is used for detecting the compaction quality of various filled layers of roadbeds and pavements; compaction quality data can be analyzed by the intelligent decision making system, and roller compaction construction parameters of next procedures or new roller compaction construction regions can be obtained by the intelligent decisionmaking system; the unmanned roller compaction system can be combined with a single unmanned roller compaction machine or a group of unmanned roller compaction machines according to the roller compaction construction parameters, so that construction operation can be synergistically accomplished; real-time communication service, operation region planning, navigation routes and group scheduling service can be provided by the remote monitoring center, field operation conditions can be displayed by the remote monitoring center, and operation data can be stored by the remote monitoring center. Theintelligent roadbed and pavement roller compaction system has the advantages that the compaction quality of the different filled layers and different filling materials of the roadbed and the pavementscan be detected by the intelligent roadbed and pavement roller compaction system in an online manner, roller compaction construction operation can be controlled by means of machine decision making, accordingly, influence of human factors can be prevented, detection, analysis, decision making and control cycle can be implemented in a closed-loop manner, and the intelligent roadbed and pavement roller compaction system is particularly applicable to all-weather roadbed and pavement roller compaction construction operation scenes in hazardous regions or under extreme conditions.

The invention discloses a method supporting hierarchical queue scheduling and flow shaping. The method comprises the following steps that: a message is received and an internal priority is mapped for the message; the message is sent into a buffer queue and a buffer queue WRED algorithm is utilized to carry out distinguishment on a responsive flow and a non-responsive flow; with regard to the responsive flow and the non-responsive flow, different drop thresholds are configured, so that an object that the non-responsive flow is dropped in advanced and the responsive flow is protected on the network congestion condition is achieved; the message is sent into the buffer queue and flow shaping is carried out by a three-layer flow shaper; and after service group scheduling and port level scheduling are carried out on the message in the buffer queue, the message is sent out from the queue; and editing is carried out on the message and the edited message is sent out from a destination port. According to the realization method for hierarchical flow shaping and queue scheduling in the invention, the structure is flexible and the hardware cost is low; besides, an access-gathering-core hierarchical network topology is reflected really and an actual demand on H-QoS deployment by the network is met.

The invention discloses a group scheduling method adopted in the wireless LAN based on a back-off system. The group scheduling method includes a first competition back-off phase and a second competition back-off phase which are respectively provided with a corresponding competition window. The competition window for the first competition back-off phase has a broader range (1023 as the maximum value) while the competition window for the second competition back-off phase has a smaller range (255 as the maximum value). The nodes cannot visit the channels unless the data groups complete the two back-off phases in order. The group scheduling algorithm for the invention is characterized in that when the two nodes in the network are connected by using RTS/CTS frames, other nodes in the network detect the CTS frame. At the same time, the back-off timers which are not zero in the nodes during the first competition phase continue to back off. The invention includes two back-off phases, while the transmission of data groups and competition back-off are carried out simultaneously. Therefore, the utilization ratio of channels in the highly loaded network system can be greatly increased.

The invention discloses a dynamic group scheduling method based on a wireless sensor network, comprising the steps: using Kalman filtering waves to predict and trace a target track; using a new dynamic group method to select the range of the next task sensor node; selecting the next sensor node as a task node according to the average energy consumption and the prediction precision in a sampling period, and selecting different sampling intervals according to energy and precision requirements. When the mode satisfies the precision requirement, the energy most-saving factor is considered to select the sampling intervals; when the node can not satisfy the precision requirement, the precision and energy consumption is comprehensively considered, and a weighted-average method is adopted to select the next task sensor node. The dynamic group scheduling method adopts a dynamic group to search the range of the next task sensor node in a limiting mode, shortens the scheduling time of the sensor node, is beneficial to the real-time target trace of the wireless sensor network, adopts variable sampling intervals, maintains the precision and is beneficial to saving energy simultaneously.

The invention provides a service-quality-sensitive 802.11e multimedia data grouping scheduling method, which comprises the following steps: aiming at the unfair problem of the multimedia data scheduling by an enhanced distributed channel access (EDCA) mechanism in 802.11e, combining with time delay sensibility of quality of service (QoS), calculating the emergency degree of data grouping in a plurality of media service flows in real time, regulating the parameter of alternating current (AC) arrays according to the emergency degree, and changing the priority of the AC arrays, so that emergency service flows have more chances to compete the signal channel access right, thus ensuring the signal channel competing fairness of the emergency service flows relatively to service flows with high priority. Experiment results prove that the bandwidth requirements of the emergency service flows in the emergency service flow grouping scheduling scheme is ensured.

The present invention relates to a mobile communication technology, and discloses a transmitting method and system which are used for enhancing scheduling information in private channel and are capable of making a base station node execute grouping scheduling on E-DCH according to the latest SI report. In this invention, the RSN transmitted by the E-DPCCH is employed to determine that whether the received data from the base station node is transmitted by the first time or not, and if the result is yes, the base station node records arriving time of the data transmitted by the first time through saving connection-frame signals and sub-frame signals which correspond to the TTI of the data. When receiving the data containing the SI, the base station node determines that whether the arriving time of the data transmitted by the first time is posterior to the memorized receiving time the latest SI, and if the result is yes, the scheduling is executed with basis of the SI in the data and updates the memorized receiving time the latest SI with the arriving time of the data transmitted by the first time; and if the result is not, the SI in the data is ignored.

The invention discloses an SDN (Software Defined Networking) controller classifying network flows through a DPI (Deep Packet Inspection) data package. According to the SDN controller classifying the network flows through the DPI data package, a DPI module which adopts a parallel processing mode is added to the existing SDN controller; the DPI module comprises a message header removing module, a package-flow conversion module, a grouping thread scheduling module, a plurality of thread modules and a flow table construction module; the flow table construction module comprises a protocol table and a flow table which exist in tabular forms; the data package is obtained by modifying an OpenFlow protocol to achieve communication between the controller and a network switch; follow-up data package forwarding is controlled through grouping scheduling of flow connection and issuing of the data package into a processing thread and issuing of the flow table to the switch through regex match. The SDN controller classifying the network flows through the DPI data package can achieve well DPI deployment under the SDN network, reduces the data package processing speed and improves the handling capacity.

The invention discloses a layered energy optimization scheduling method of an active power distribution network, belongs to the field of intelligent power distribution networks, and particularly relates to a layered energy optimization scheduling method of an active power distribution network considering environmental benefits. The method comprises the steps as follows (1) a distributed unit which directly participates in active power distribution network optimization scheduling is divided into a distributed power unit, a distributed energy storage unit, a load and a microgrid group comprising a plurality of microgrids, and optimization scheduling is carried out in three layers; (2) an active power distribution network scheduling center collects and gathers relevant output information reported by distributed power supplies, an energy storage device and a microgrid group scheduling center and interaction electrovalence of the power distribution network and a superior power grid, and first layer optimization scheduling is carried out by combining loads connected to the power distribution network; and (3) middle layer optimization is optimization of the microgrid group scheduling center on the basis of upper layer optimization; and (4) bottom layer optimization is optimization scheduling of various microgrids in the microgrid group on the basis of middle layer optimization.

The invention provides a machine group dispatching method on the basis of a processing capability characteristic model, belonging to the automatic control, information technique and advanced manufacture field. The machine group dispatching method is characterized in that on the basis of the dispatching time machine group information and the information of the dispatched workpiece which are obtained by a dispatching information hardware collecting system, the machine group dispatching software on the basis of processing capability characteristic model establishes a machine group dispatching model based on the processing capability characteristic model by taking the total minimum workpiece delay time as a dispatching object, further, a genetic algorithm based on the workpiece characteristic is adopted to carry out the optimum machine group dispatching and obtain a optimum machine group dispatching proposal based on the workpiece group sorting, and dynamically correct the original optimum machine group dispatching proposal on the basis of the workpiece releasing time disturbance information so as to deal with the problems that the original optimum machine group dispatching proposal performance is reduced or non-feasible due to workpiece releasing time disturbance. The dispatching method of the invention can carry out effective integrated optimum dispatching to the machine group of the traditional dispatching mode, which is difficult to directly assign the workpiece to the specific machines.

The invention relates to an embedded operating system task scheduling method for an energy collecting system. While task instantaneity is guaranteed, tasks are scheduled in a grouping manner by setting the maximum energy threshold value and the minimum energy threshold value of a battery. The embedded operating system task scheduling method for the energy collecting system has the advantage that energy consumption of the tasks and energy restriction of the battery are considered in a task scheduling process, and task execution interruption caused by insufficient energy of the battery can be avoided; and on the basis of the energy consumption of the tasks and the energy restriction of the battery, the grouping scheduling strategy is adopted, and the using frequency of the battery in a shallow charging and shallow discharging mode is reduced when a task load is high, so that the total energy transfer quantity of the battery and the energy service efficiency are improved.

The invention discloses a distributed-type video cooperation scheduling method based on a wireless sensor network, and collaborated cooperation of a plurality of video nodes is adopted. Scheduling is conducted in a dynamic and self-adaptive mode, and an appropriate video sensor node is selected to carry out present video transmission. In a state without invasion, a system works in a static state scheduling state, and the nodes enter semi-activation states by turns according to the time assigned by a system scheduling server. When an invasion state occurs, and an invasion area is determined firstly according to dynamic group scheduling, and nodes in other areas maintain in dormancy states; and redundancy nodes are made to enter the dormancy states according to a CPNS algorithm. Acquisition transmission nodes are in activation states, and other nodes in the area enter the half-activation states. According to the method, a centralized type scheduling method and the distributed type scheduling method are combined, and through the provided method, problems in the aspects such as node energy consumption, energy equalization and transmission management of video acquisition transmission nodes are preferably solved, and the rationality and the energy equalization of video transmission in the wireless sensor network are raised.

The invention belongs to the technical field of solving of multi-objective optimization scheduling models of cascade reservoir groups, and discloses a solving method of a cascade reservoir group scheduling model based on a multi-objective optimization algorithm, which comprises the following steps of of firstly, collecting power station basic data and hydrological data of a cascade reservoir group; secondly, establishing a scheduling target according to specific requirements, and adding the scheduling constraint conditions; taking the water level at each moment in the scheduling period as a decision variable, and solving the established cascade reservoir group scheduling model by adopting an R dominated improved moth fire-fighting multi-objective optimization algorithm (R-NSIMFO); and finally, obtaining a corresponding scheduling scheme set according to a solving result. The solving method is improved from two aspects of an evolutionary algorithm and a multi-objective mechanism, can obtain a non-inferior scheduling scheme set with excellent convergence and distribution, and plays a crucial role in realizing the maximization of the comprehensive benefits of the whole cascade reservoir group.

The invention discloses a firefly algorithm-based cascade reservoir group scheduling optimization method. The method comprises the following steps of 1: by taking maximum generated energy of cascade reservoirs in a scheduling period as an optimization target, and taking waterpower constraints and electricity constraints of the cascade reservoirs as constraint conditions, building a cascade reservoir optimization model; and 2: performing optimization calculation on the cascade reservoir optimization model obtained in the step 1 by adopting an improved firefly algorithm to obtain the maximum generated energy and an optimal reservoir water level corresponding to the maximum generated energy, and outputting the optimal reservoir water level. The firefly algorithm-based cascade reservoir groupscheduling optimization method has important practical significance and application values for enriching cascade reservoir group optimization scheduling methods, improving the joint operation level ofa cascade reservoir group and improving comprehensive utilization benefits of water resources and economic benefits of power generation enterprises.