A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservatio...A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservation by assigning suitable finishing tiniest-amps to contending cells. STF can also provide isolation between flows that share a common output, link. Misbehaving flows will be restricted to guarantee the behaving flows' bandwidth. Simulations prove the feasibility of our algorithm.展开更多
A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of th...A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of throughput, requires only O( I) time complexity to process a packet, and is simple enough to be implemented in hardware. After the performances are analyzed, the fairness and packet loss rate of the algorithm are simulated. Simulation results show that the CRR can effectively isolate the effects of contending .sources.展开更多
This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adap...This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.展开更多
This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair c...This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair channel bandwidth allocation among nodes. The data communication process requiring the establishment of compensation coordination scheduling model is divided into three periods： the sending period, the compensation period and the dormancy period. According to model parameters, time constraint functions are designed to limit the execution length of each period. The algorithms guarantee that the nodes complete fair transmission of network packets together in accordance with the fixed coordination scheduling rule of the model. Simulations and analysis demonstrate the effectiveness of the proposed algorithm in network throughput and fairness.展开更多
One of the fundamental problems in parallel and distributed systems is deciding how to allocate jobs to processors. The goals of job scheduling in a parallel environment are to minimize the parallel execution time of ...One of the fundamental problems in parallel and distributed systems is deciding how to allocate jobs to processors. The goals of job scheduling in a parallel environment are to minimize the parallel execution time of a job and try to balance the user’s desire with the system’s desire. The users always want their jobs be completed as quickly as possible, while the system wants to service as many jobs as possible. In this paper, a dynamic job scheduling algorithm was introduced. This algorithm tries to utilize the information of a practical system to allocate the jobs more evenly. The communication time between the processor and scheduler is overlapped with the computation time of the processor. So the communication overhead can be little. The principle of scheduling the job is based on the desirability of each processor. The scheduler would not allocate a new job to a processor that is already fully utilized. The execution efficiency of the system will be increased. This algorithm also can be reused in other complex algorithms.展开更多
基金Supported by National Natural Science Foundation of China under Grant No.69896246
文摘A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservation by assigning suitable finishing tiniest-amps to contending cells. STF can also provide isolation between flows that share a common output, link. Misbehaving flows will be restricted to guarantee the behaving flows' bandwidth. Simulations prove the feasibility of our algorithm.
文摘A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of throughput, requires only O( I) time complexity to process a packet, and is simple enough to be implemented in hardware. After the performances are analyzed, the fairness and packet loss rate of the algorithm are simulated. Simulation results show that the CRR can effectively isolate the effects of contending .sources.
基金Supported by the National Natural Science Foundation of China (No.60472057).
文摘This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.
基金Supported by the National Natural Science Foundation of China （61071096, 61003233, 61073103 ） and the Research Fund for the Doctoral Program of Higher Education （20100162110012）.
文摘This paper proposes a distributed fair queuing algorithm which is based on compensation coordi- nation scheduling in wireless mesh networks, considering such problems as the location-dependent competition and unfair channel bandwidth allocation among nodes. The data communication process requiring the establishment of compensation coordination scheduling model is divided into three periods： the sending period, the compensation period and the dormancy period. According to model parameters, time constraint functions are designed to limit the execution length of each period. The algorithms guarantee that the nodes complete fair transmission of network packets together in accordance with the fixed coordination scheduling rule of the model. Simulations and analysis demonstrate the effectiveness of the proposed algorithm in network throughput and fairness.
基金National Natural Science Foundation of China( No.60 173 0 3 1)
文摘One of the fundamental problems in parallel and distributed systems is deciding how to allocate jobs to processors. The goals of job scheduling in a parallel environment are to minimize the parallel execution time of a job and try to balance the user’s desire with the system’s desire. The users always want their jobs be completed as quickly as possible, while the system wants to service as many jobs as possible. In this paper, a dynamic job scheduling algorithm was introduced. This algorithm tries to utilize the information of a practical system to allocate the jobs more evenly. The communication time between the processor and scheduler is overlapped with the computation time of the processor. So the communication overhead can be little. The principle of scheduling the job is based on the desirability of each processor. The scheduler would not allocate a new job to a processor that is already fully utilized. The execution efficiency of the system will be increased. This algorithm also can be reused in other complex algorithms.
