Title of article
Starvation Free Scheduler for Buffered Crossbar Switches
Author/Authors
Prasantha, N. Narayanan Department of Information Technology - National College of Engineering, Maruthakulam, India , Balasubramanianb, K Department of Computer Science & Engineering - Mepco Schlenk Engineering College, Sivakasi, India , Devi, R. Chithra Department of Information Technology - Dr. Sivanthi Aditanar College of Engineering, Tiruchendur, India
Pages
6
From page
523
To page
528
Abstract
Need for high speed internet connectivity has led to a substantial research in switching systems.
Buffered crossbar switches have received a lot of attention from both research and industrial
communities due to their flexibility and scalability. Designing a scheduling algorithm for buffered
crossbar switches without starvation is a major challenge as of now. In this paper, we propose a Delay
based prioritized queue with round-robin scheduler (DPQRS) which uses no speedup. Simulation result
shows that DPQRS reduces the starvation considerably with maximum throughput and minimum delay
comparable to PQRS and LQF-RR.
Farsi abstract
نياز به اتصال به اينترنت با سرعت بالا منجر به تحقيقات قابل توجهي در سيستم هاي سوئيچينگ گرديده است. سوئيچهاي كراس بار بافر به دليل انعطاف پذيري و مقياس پذيري براي تحقيق و در جوامع صنعتي مورد توجه زيادي قرار گرفته اند. طراحي الگوريتم زمان بندي براي سوئيچ كراس بار بافر بدون قحطي يك چالش عمده از هم اكنون است. در اين مقاله، ما يك صف بندي اولويت بندي شده بر اساس تاخير با زمانبند (D-PQRS) ارائه مي كنيم كه از هيچ افزايش سرعتي استفاده نمي كند. نتيجه شبيه سازي نشان مي دهد كه DPQRS قحطي را بطور قابل توجهي با حداكثر توان و حداقل تاخير كاهش مي دهد كه قابل مقايسه با PQRS و LQF-RR است.
Keywords
Crossbar Switch , Starvation , Router , Throughput , Delay
Journal title
Astroparticle Physics
Serial Year
2015
Record number
2406911
Link To Document