Proceedings ArticleDOI
An O(1) scheduling algorithm for variable-size packet switching systems
Shunyuan Ye,Yanming Shen,Shivendra S. Panwar +2 more
- pp 1683-1690
Reads0
Chats0
TLDR
A randomized scheduling algorithm that can also stabilize the system for any admissible traffic that satisfies the strong law of large number and is highly scalable and a good choice for future high-speed switch designs is proposed.Abstract:
Internet traffic has increased at a very fast pace in recent years. The traffic demand requires that future packet switching systems should be able to switch packets in a very short time, i.e., just a few nanoseconds. Algorithms with lower computation complexity are more desirable for this high-speed switching design. Among the existing algorithms that can achieve 100% throughput for input-queued switches for any admissible Bernoulli traffic, ALGO3 [1] and EMHW [2] have the lowest computation complexity, which is O(logN), where N is the number of ports in the switch. In this paper, we propose a randomized scheduling algorithm, which can also stabilize the system for any admissible traffic that satisfies the strong law of large number. The algorithm has a complexity of O(1). Since the complexity does not increase with the size of a switch, the algorithm is highly scalable and a good choice for future high-speed switch designs. We also show that the algorithm can be implemented in a distributed way by using a low-rate control channel. Simulation results show that the algorithm can provide a good delay performance as compared to algorithms with higher computation complexity.read more
Citations
More filters
Journal ArticleDOI
Scheduling jobs with unknown duration in clouds
Siva Theja Maguluri,R. Srikant +1 more
TL;DR: A load balancing and scheduling algorithm that is throughput-optimal, without assuming that job sizes are known or are upper-bounded is presented.
Proceedings ArticleDOI
Scheduling jobs with unknown duration in clouds
Siva Theja Maguluri,R. Srikant +1 more
TL;DR: A load balancing and scheduling algorithm that is throughput optimal, without assuming that job sizes are known or are upper bounded is presented.
Proceedings ArticleDOI
Randomized algorithms for scheduling VMs in the cloud
TL;DR: A class of randomized algorithms for placing VMs in the servers that can achieve maximum throughput without preemptions are presented, which are naturally distributed, have low complexity, and each queue needs to perform limited operations.
Proceedings ArticleDOI
On Non-Preemptive VM Scheduling in the Cloud
TL;DR: A non-preemptive scheduling algorithm is proposed that can provide rβ fraction of the throughput region for β < r and can be tuned to provide a tradeoff between achievable throughput, delay, and computational complexity of the scheduling algorithm.
Journal ArticleDOI
On Non-Preemptive VM Scheduling in the Cloud.
TL;DR: A non-preemptive scheduling algorithm is proposed that can provide rβ fraction of the throughput region for β < r and can be tuned to provide a trade-off between achievable throughput, delay, and computational complexity of the scheduling algorithm.
References
More filters
Journal ArticleDOI
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
TL;DR: The stability of a queueing network with interdependent servers is considered and a policy is obtained which is optimal in the sense that its Stability Region is a superset of the stability region of every other scheduling policy, and this stability region is characterized.
Journal ArticleDOI
The iSLIP scheduling algorithm for input-queued switches
TL;DR: This paper presents a scheduling algorithm called iSLIP, an iterative, round-robin algorithm that can achieve 100% throughput for uniform traffic, yet is simple to implement in hardware, and describes the implementation complexity of the algorithm.
Proceedings ArticleDOI
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
TL;DR: The stability of a queuing network with interdependent servers is considered, and the problem of scheduling server activation under the constraints imposed by the dependency among them is studied.
Journal ArticleDOI
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
Libin Jiang,Jean Walrand +1 more
TL;DR: An adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively and is combined with congestion control to achieve the optimal utility and fairness of competing flows.
Scheduling algorithms for input-queued cell switches
TL;DR: The algorithms described in this thesis are designed to schedule cells in a very high-speed, parallel, input-queued crossbar switch, and it is proved that LQ although too complex to implement in hardware, is stable under all admissible i.i.d. offered loads.