##plugins.themes.academic_pro.article.main##

Abstract

Increasing complexity of the individual devices, the increasing demand for higher bandwidth on the network lines and an operating frequency hitting new limits with almost every new design, place the communication and computation resources arbitration being the performance bottleneck of the NoC system.  The arbitration is desired to be completed within one clock cycle to avoid large latencies between the cores on the chip. To achieve the arbitration in one clock cycle, the total delay introduced by the arbitration should be low so that it will not impact the overall system clock frequency which introduces new challenges for the design of the arbiters. In this paper, we design iSLIP arbiter using iSLIP scheduling algorithm with mesh router for NoC. An iterative, round-robin algorithm, iSLIP can achieve 100% throughput for uniform traffic. It is well known that if simple first in first out (FIFO) input queues are used to hold packets then, even under benign conditions, head-of-line (HOL) blocking limits the achievable bandwidth to approximately 58.6% of the maximum. HOL blocking can be overcome by the use of virtual output queuing, which is described in this paper. It is designed using VHDL and using ModelSimSE 6.3f.

Keywords: iSLIP,  iterative, scheduling algorithm, mesh router, arbiter

##plugins.themes.academic_pro.article.details##

Author Biography

Deepali Thakur Mahobiya, RKDF Institute of Science & Technology,Bhopal M.P

M-TECH Scholar

Department of Electronics & Communication Engineering

How to Cite
Mahobiya, D. T. (2015). Efficient iSLIP Arbiter with iSLIP Scheduling Algorithm for NoC. International Journal of Emerging Trends in Science and Technology, 2(03). Retrieved from https://igmpublication.org/ijetst.in/index.php/ijetst/article/view/583

References

1. McKeown, N. W. 1995 Scheduling Algorithms for Input-Queued Cell Switches. Doctoral Thesis. UMI Order Number: UMI Order No. GAX96-02658., University of California at Berkeley.
2. C. Partridge; P. Carvey et al. “A Fifty-Gigabit per Second IP Router,” Submitted to IEEE/ACM Transactions on Networking, 1996.
3. T. Anderson et al. “High Speed Switch Scheduling for Local Area Networks,” ACM Trans. on Computer Systems, Nov 1993, pp. 319-352.
4. N. McKeown et al. “The Tiny Tera: A small high-bandwidth packet switch core,” IEEE Micro, Jan-Feb 1997.
5. LaMaire, R.O.; Serpanos, D.N.; “Two-dimensional round-robin schedulers for packet switches with multiple input queues,” IEEE/ACM Transactions on Networking, Oct. 1994, vol.2, (no.5):471-82.
6. Lund, C.; Phillips, S.; Reingold, N.; “Fair prioritized scheduling in an input-buffered switch,” Proceedings of the IFIP-IEEE Conf. on Broadband Communications ‘96, Montreal, April 1996. p. 358-69.
7. Hui, J.; Arthurs, E. “A broadband packet switch for integrated transport,” IEEE J. Selected Areas Communications, 5, 8, Oct 1987, pp 1264-1273.
8. Ali, M.; Nguyen, H. “A neural network implementation of an input access scheme in a high-speed packet switch,” Proc. of GLOBECOM 1989, pp.1192-1196.
9. N. McKeown, “Scheduling Cells in an input-queued switch,” PhD Thesis, University of California at Berkeley, May 1995.
10. N. McKeown, “iSLIP: A Scheduling Algorithm for Input-Queued Switches,” Submitted to IEEE Transactions on Networking.
11. Maher Abdelrasoul, Mohammed Ragab, Victor Goulart”Evaluation The Scalability of Round Robin Arbiters for NoC Routers onFPGA” of 2013 IEEE 7th International Symposium on Embedded Multicore/Manycore System-on-Chip.
12. D. Cavendish, M. Lajolo, and H. Liu. On the evaluation of fairness For input queue switches. In IEEE International Conference on Communications, 2002. ICC 2002, volume 2, 2002.
13. G. Varghese. Network Algorithmics: an interdiscilinary aproach to designing fast networked devices. Morgan Kaufmann, 2005 T. D. Richardson, C. Nicooulos, D. . and V. Narayanan, Y. Xie, C. Das, and V. Degalahal, “A hybrid soc interconnect with dynamic tdma- based transaction-less buses and on-chi networks,” in roc. Of International Conference on VLSI Design, 2006.
14. S. Bourduas and Z. Zilic, “A hybrid ring/mesh interconnect for networkon chip using hierarchical rings for global routing,” in International Symosium on Network-on-Chi, 2007
15. H. M. Harmanani and R. Farah, “A method for efficient maping and reliable routing for noc architectures with minimum bandwidth and area,” in IEEE Northeast Workshop on Circuits and Systems and TAISA Conference, June 2008.
16. W. Lee and G. E. Sobelman, “Mesh-star hybrid noc architecture with cdma switch,” in IEEE roc. of International Symosium onCircuits and Systems, 2009.
17. Kang, K., K. Park, L. Sha, Q. Wang. Design of a crossbar VOQ real-time switch with clock-driven Scheduling . Real-Time Systems, January2013, Vol. 49, Issue 1, pp. 117- 135.
18. Tejaswini Rajesh Deotare, Prashant R.Rothe; “I-SLIP algorithm for low latency on hybrid noc architecture” IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308 Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 509