1
Information Technology, Dr. Sivanthi Aditanar College of Engineering
2
Computer Science and Engineering, Mepco Schlenk Engineering College
3
Information Technology, National College of Engineering
Abstract
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay based Prioritized Queue with Round-robin Scheduler (D-PQRS) which uses no speedup. Simulation result shows that D-PQRS reduces the starvation considerably with maximum throughput and minimum delay comparable to PQRS and LQF-RR.
Devi, C., Balasubramanian, K., & Prasanth, N. (2015). Starvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE). International Journal of Engineering, 28(4), 523-528.
MLA
Chithra Devi; Kannan Balasubramanian; Narayanan Prasanth. "Starvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)". International Journal of Engineering, 28, 4, 2015, 523-528.
HARVARD
Devi, C., Balasubramanian, K., Prasanth, N. (2015). 'Starvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)', International Journal of Engineering, 28(4), pp. 523-528.
VANCOUVER
Devi, C., Balasubramanian, K., Prasanth, N. Starvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE). International Journal of Engineering, 2015; 28(4): 523-528.
)