75 results about "Round-robin scheduling" patented technology

A multithreaded data processing system performs processing using resource circuitry which is a finite resource. A saturation signal is generated to indicate when the resource circuitry is no longer able to perform processing operations issued to it. This saturations signal may be used to select a scheduling algorithm to be used for further scheduling, such as switching to scheduling from a single thread as opposed to round-robin scheduling from all of the threads. Re-execution queue circuitry is used to queue processing operations which have been enabled to be issued so as to permit other processing operations which may not be blocked by the lack of use of circuitry to attempt issue.

A load balancing technique uniformly distributes data transmitted by a server over a plurality of underlying physical links of a virtual interface or aggregate within a computer network. According to the invention, the unit of data granularity is preferably a datagram, rather than an Internet protocol (IP) fragment or packet. The load balancing technique implements a round robin scheduling policy among the links based on an identifier (ID) associated with each datagram. As a result, the technique ensures that all fragments of a datagram are forwarded over the same physical link of the aggregate on the basis of a similar IP ID.

The invention relates to a CTC station autonomous controlling machine with a self-learning system. The station autonomous controlling machine comprises a central communication module, an operation processing module, a schedule receiving and storing module, a round-robin scheduling module, a code bit processing and bus number tracking module, an automatic routing decision module, an interlocked logic check output module and an acquisition/output module, wherein the central communication module is connected with the operation processing module and the schedule receiving and storing module respectively; the operation processing module, the round-robin scheduling module and the code bit processing and bus number tracking module are all connected with the automatic routing decision module; the automatic routing decision module is connected with the interlocked logic check output module, and the interlocked logic check output module is connected with the acquisition/output module; and the acquisition/output module is connected with the code bit processing and bus number tracking module. The CTC station autonomous controlling machine with the self-learning system has improved automation, certain artificial intelligence, and improved accuracy and efficiency during use at a station of a busy mainline.

A SYN packet bandwidth Distributed Denial-of-Service (DDoS) attack is defended against by intercepting and identifying SYN packets in a “DDoS gateway” advantageously positioned at the edge of the network to be protected (e.g., one hop upstream from the protected link), and by queuing these intercepted SYN packets in a separate queue from other TCP packet queues. Edge per-flow queuing is employed to provide isolation among individual TCP connections sharing the link. A fair scheduling algorithm such as round robin scheduling is used to ensure that SYN packets (such as those generated as part of a SYN bandwidth attack) cannot overwhelm the egress link in the presence of other TCP packets.

The invention relates to a wireless Mesh network MAC layer resource scheduling strategy based on standard of IEEE802.16d, which solves the problems of fairness in single service resource scheduling and the quality of service (QoS) during multi-service resource scheduling to certain extent. When only the single service exists in the network, every node establishes two types of queues, namely, a request queue and an authorization queue; round-robin scheduling towards each queue ensures fair resource occupation of each type of service flow, which comprises bandwidth request/authorization mechanism, scheduling mechanism, time slot distribution mechanism and compensation mechanism; under the circumstance of multi-service, different priorities can be set to various different service flows according to the differences of service real-time request so as to distribute bandwidth dynamically and improve the throughput of the system as far as possible with the premise of meeting the quality of service (QoS) of each type of service flow, which comprises classification mechanism, bandwidth reservation mechanism and degrading mechanism.

The invention discloses a complete-vehicle control method and a complete-vehicle controller of an intelligent vehicle. The method includes the steps that after a BSP is initialized and a system is initialized, a main task of the system is created; after system parameters are initialized, unit sub-tasks are created in the main task of the system; according to the priorities of the unit sub-tasks, time slice round-robin scheduling is performed; a time slice comprises a preset mode and/or a user-defined mode. Different task priorities can be distributed among the unit sub-tasks of the vehicle according to the importance of events, time slice round-robin scheduling is adopted for circulation, operation time of all the tasks is reasonably distributed, the requirement for real-time performance is met, in addition, the multi-task performance can be used for integrating part of intelligent unit modules into the complete-vehicle controller, in this way, the cost of each unit module is lowered, space inside the vehicle is saved, and communication faults among the modules are reduced.

A scheduling method for providing multimedia service and packet data service efficiently. The scheduling is a Round-Robin scheduling in an MQC (Multiple Quality Control) protocol structure. A transmitter in a base station transmits or retransmits TUs from different streams in a PLP using priority queues by the scheduling.

A scheduler for use in a computer network system which provides an order 1 level of complexity, while maintaining proportional fairness and a constant normalized worst-case fair index to create short term and long-term fairness among backlogged flows. The scheduler utilizes an intra-class scheduling algorithm to obtain the benefits of a round robin scheduler and an inter-class scheduling algorithm to obtain the benefits of timestamp based scheduler.

The invention relates to a low-feedback multi-user scheduling method in cooperative multicast MIMO transmission. The method comprises the following four schemes: (1) NUS, (2) Large Scale, (3) Local-NUS and (4) Local-Large Scale; and the four schemes are respectively based on different channel feedback information and have a unified executive process. The method is a scheduling method for selecting a plurality of service users in the spatial domain, and ensures the fairness among different users by combining an opportunistic round-robin scheduling method on a time domain; the scheduling process is as follows: 1. initialization, the user with best channel condition is selected as a first user according to the feedback information; 2. a scheduling user set is iteratively selected from the rest users based on the selected user until the given stopping criterion is met; and 3. the selected user is eliminated based on the opportunistic round-robin scheduling method, and the step 1 and the step 2 are repeatedly carried out. Compared with the cooperative scheduling method based on the complete channel information, the method has no high performance loss but remarkably reduces the feedbackquantity of the system; and compared with the non-cooperative system, the invention can greatly improve the system performance.

The invention discloses a hybrid scheduling bus arbiter and an arbitration method. A circuit implementation mechanism enabling multiple devices with fixed priority and round-robin scheduling to access a bus simultaneously is implemented. According to the technical scheme, the hybrid scheduling bus arbiter is provided with a round-robin scheduling module and a fixed priority module. The round-robin scheduling module comprises a state register and a round-robin scheduling state machine, the state register stores request signals of each device, and the round-robin scheduling state machine performs arbitration judgment on the request signals of the current device according to a round-robin scheduling sequence. The fixed priority module comprises a register pile and a fixed priority state machine; the register pile stores the request signals of each device according to the sequence from a high significant bit to a low significant bit, and the fixed priority state machine performs arbitration judgment on the request signals of the current device according to a fixed priority sequence.

The present invention relates to embedded system process scheduling field for providing an embedded type SRAM operation system process priority scheduling implementation method. It contains recording state of a process, according to processor clock rate defining one suitable time span as time slice, dividing processor time into multiple equal time slice, progress grade dividing, travel time slice distribution, processor distribution and retrieve processor. Said method easy realizes, is in favor of respectively processing to different progress, at the same time said method has high response speed process scheduling to SRAM when progress has higher cpu use rate. Said invented method can prevent peripheral equipment progress occupying processor for long time.

The invention discloses a many-core network processor and a micro engine message scheduling method and a micro engine message scheduling system thereof. The method comprises the following steps: when there is a message input, applying for a free pointer for the message; saving the message to a position to which the pointer points in a shared cache and saving the pointer to a corresponding stream queue, wherein stream queues are scheduled by means of round-robin scheduling; when the pointer in the stream queue is scheduled, looking for a micro engine corresponding to the pointer in order to map the message corresponding to the pointer to the micro engine; and when no micro engine corresponding to the pointer is found, saving the pointer to the corresponding stream queue again.

The invention relates to a data scheduling method used in an EPON terminal system and based on absolute priority. The EPON terminal system is a point-to-multipoint network system, comprises three parts: an end OLT, a terminal ONU and a passive optical divider, and is characterized in that: a. FIFOs used for data caching are added in the terminal ONU, and the number of the FIFOs is determined by the current priority number for data discrimination; b. address spaces are allocated in an external memory according to the priority; c. the terminal ONU transmits data to the end OLT, a transmission time slot for report frames used for bandwidth application is reserved at the tail part of a transmission time slot, and the number of data remained in the current system and to be transmitted can be accurately calculated when every time slot transmission is ended; d. when a higher priority comes, the current transmitted data is confirmed to be consistent with the data applied to be transmitted; and e. when end OLT allocates bandwidth more than the applied bandwidth to the terminal ONU, absolute priority scheduling can be selected or round-robin scheduling is selected to equally allocate the excessive bandwidth. Through practical operation and testing, the invention has the advantages that the effect is good, the bandwidth utilization ratio is high and the data transmission requirement of the EPON system is satisfied.

The invention discloses a multicell self-adaption cooperative transmission method on the basis of delayed feedback. The cooperative transmission method is carried out according to the following steps: firstly, an average movement speed of users in a plurality of cells which take part in cooperation is researched, a corresponding doppler frequency offset is calculated and a channel delay correlation coefficient is obtained; then one user is selected from each cell by round-robin scheduling to wait for data transmission and a codebook known by a base station end is generated for the user; the user estimates channel information and a path power attenuation factor by receiving a pilot signal sent by a base station and feeds back the information to the base station; and finally, the base station determines an adopted cooperative transmission mode according to the information fed back by the user and information of the calculated channel delay correlation coefficient and the like, completes precoding in a corresponding mode and carries out data transmission. The multicell self-adaption cooperative transmission method can be effectively applied to actual scenes and the reachable transmission speed and the frequency spectrum utilization rate of a system can be improved.

The invention discloses a method for partition scheduling in a Windows operating system environment, and the method is used to solve the technical problem that an existing partition scheduling method is low in practicality. The technical scheme is that by using affinity setting of the Windows system, CPU (Central Processing Unit) resources of the system are reallocated, and a running core of a real-time task is appointed, so that resources needed by the real-time task can be ensured; a two-level scheduling model is adopted, wherein the model comprises two levels of schedulers: a module scheduler of a scheduling partition, and a partition scheduler of a process in the scheduling partition; and a secondary scheduling model is inclined to a cycle round-robin scheduling partition of the module scheduler, and the partition scheduler preempts a scheduling process based on a fixed priority. According to the scheduling method, in the Windows environment, a virtual two-level scheduling policy of ARINC 653 is created, thereby providing a good development and debugging environment for embedded software; and the method is high in practicality and reduces development cost.

To avoid lost packets that could otherwise occur were a round robin scheduling policy to be used to assign PPP packet fragments to multiple communication links, the links are assigned tokens based on their capacities, with a fragment being assigned to the link with the most tokens. When a fragment is scheduled to a link, the tokens of the link are decremented accordingly. The tokens are periodically refreshed.

The present invention provides a multi-core processor system, including: multiple central processor units and multiple groups of level-one hardware message queues. Each central processor unit is separately connected to a group of level-one hardware message queues and is configured to process messages in the level-one hardware message queues. Each group of level-one hardware message queues includes multiple level-one hardware message queues. Moreover, in each group of level-one hardware message queues, a level-one hardware message queue having a higher priority is scheduled preferentially, and level-one hardware message queues having the same priority are scheduled in a round-robin manner according to round robin scheduling weights. Through the multi-core processor system provided in the present invention, the efficiency and performance of the multi-core processor system are improved.

The present invention discloses a multi-cell joint adaptive modulation coding method based on round robin scheduling. The method comprises the following steps of (1) calculating the user channel quality; (2) predicting the user channel quality; (3) at the current scheduling moment, enabling all base stations to schedule all users of each base station based on a round robin scheduling algorithm, and distributing the resource blocks to all users to obtain the resource scheduling lists of all base stations; (4) according to the resource scheduling lists obtained in the step (3), calculating the signal to noise ratios of all scheduled users at the current scheduling moment; (5) according to a mapping criterion between the signal to noise ratios and the modulation coding schemes, selecting the modulation coding schemes for the users. The multi-cell joint adaptive modulation coding method based on the round robin scheduling of the present invention can simulate the cofrequency interference of the users at the data transmission moment more accurately, so that the channel quality predication at the data transmission moment is more accurate, the selected modulation coding schemes can adapt to the channel states at the data transmission moment better, and the transmission performance of a system is improved effectively.