ABSTRACT
In this paper, we introduce a Round–robin Arbiter Generator (RAG) tool. The RAG tool can generate a design
for a Bus Arbiter (BA).
The BA is able to handle the exact number of bus masters for both on-chip and off-chip buses.
RAG can also generate a distributed and parallel hierarchical Switch Arbiter (SA).
The first contribution of this paper is the automated generation of a round-robin token passing BA to reduce time
spent on arbiter design. The generated arbiter is fair, fast, and has a low and predictable worst-case wait time.
The second contribution of this paper is the design and integration of a distributed fast arbiter, e.g., for a terabit switch,
based on 2x2 and 4x4 switch arbiters (SAs). Using a .25μ TSMC standard cell library from LEDA Systems [10, 14],
we show the arbitration time of a 256x256 SA for a terabit switch and demonstrate that the SA generated by
RAG meets the time constraint to achieve approximately six terabits of throughput in a typical network switch design.
Furthermore, our generated SA performs better than the Ping-Pong Arbiter and Programmable Priority Encoder by a factor of 1.9X and 2.4X, respectively.
'[FPGA]' 카테고리의 다른 글
[xilinx] FPGA DCM(Digital Clock Manager)이란? (0) | 2013.05.19 |
---|---|
[xilinx] Memory type에 따른 분류 (single port ram....) (0) | 2013.04.22 |
[xilinx] license 설정 방법 (0) | 2013.04.22 |
[xilinx] xilinx를 이용한 합성 및 다운로드 방법 (0) | 2013.04.22 |
[xilinx] Xilinx Basic FPGA Architecture (0) | 2013.04.22 |