Journal of Electronic Design Technology
Implementation of Weighted Round Robin Algorithm in Shared Bus Architectures
Abstract
AbstractThe application domain of System-On-Chips (SoC) includes mobile devices, end terminals, multimedia terminals, automotive, set-top-boxes, games, processors etc. The SoC design paradigm relies heavily on reuse of intellectual property cores, enabling designers to focus on functionality and performance of the overall system. This is possible if IP cores are equipped with highly optimized interface for plug and play insertion into communication architecture. To this purpose the virtual Socket Interface Alliance represents an attempt to set the characteristics of industry wide, thus facilitating the match of pre-designed software and hardware blocks from multiple sources. The SoC interconnect must be designed and optimized to support a heterogeneous mix of data paths which may inherently have widely varying performance characteristics. The fabric must reliably deliver the required throughput and hide latency for performance critical paths while simultaneously managing the flow of traffic for slower paths and ports requiring lower bandwidth. Thus the system bus as a whole must strike the appropriate between latency and throughput for the collection data paths. Optimizing around this balance is essential to minimizing power, performance, area (PPA) costs and avoiding an inefficient, over-designed SoC.Keywords: SoC, multiprocessor, arbiter, interconnect, arbitrationCite this ArticleTejas Patel, Devendra Patle. Implementation of Weighted Round Robin Algorithm in Shared Bus Architectures. Journal of Electronic Design and Technology. 2017; 8(2): 34–40p.References (10)
- Dally WJ, Towels B. Route, Packets, Not Wires: On -Chip Interconnection Networks, Proceedings of IEEE Design Automation Conference, 2001, 684–689p.
- Tobagi FA. Fast Packet Switch Architecture for Broadband Integrated Services Digital Networks, Proceedings of IEEE, January 1990, 133–167p.
- Mckeown N, Varaiya P, Warland J. The iSLIP Scheduling Algorithm for Input - Queued Switch, IEEE T Netw. 1999; 7(2): 188–201p.
- Chao HJ, Park JS. Centralized Contention Resolution Schemes for a Larger -capacity Optical ATM Switch, Proceedings of IEEE ATM Workshop, 1998, 11–16p.
- Chao HJ, Lam CH, Guo X. A Fast Arbitration Scheme for Terabit Packet Switches, Proceedings of IEEE Global Telecommunications Conference , 1999, 1236–1243p.
- Tamir Y, Chi H-C. High Performance Multi-queue Buffers for VLSI Communications Switches, IEEE T Commun. 1987; 1347–1356p.
- Shin ES, Mooney III VJ, Riley GF. Round-robin Arbiter Design and Generation, Georgia Institute of Technology, Atlanta, GA, Technical Report GIT -CC-02-38, 2002, Available HTTP: http://www.cc.gatech.edu/tech_rep orts.
- Alex A. Aravind, An Arbitration algorithm for multiport memory systems, IEICE Electronic Express , Oct 2005; 2(19): 488–494p.
- Bu-chung Lin, Geeng -Wei Lee, Juninn Dar Huang , et al. A Precise bandwidth Control Arbitratio n Algorithm for Hard Real- Time SOC Buses, DAC 2007, 165– 170p.
- Kanishka Lahiri, Anand Raghunathan, Lotterybus: A new high -performance communication architecture for System - on-chip Designs, Proceedings of the 38th annual Design Automation Conference , June 18-22, 2001, ACM, USA, 15–20p. Cite this Article Tejas Patel, Devendra Patle. Implementation of Weighted Round Robin Algorithm in Shared Bus Architectures. Journal of Electronic Design and Technology . 2017; 8(2): 34–40p.