Asic Implementation Of The Switch Crossbar Scheduling Algorithm

Information Technology is one of the most important advances of Science and Technology in the 20th century. In recent decades, the user of Internet expands exponentially which led to Internet increasing very fast and its scale growing rapidly. So, the need of switch router of high performance is urgent. This requires the switch routers that construct the backbone network have the capability of gigabit grouping and forwarding. The structure of switch router we used before is based on CPU and bus, which has the limits that can not conquer. Currently, switch routers that construct the backbone network are mostly based on distributed system structure. Fast routing is implemented in ASIC and high speed datagram switching is complemented in Crossbar switch. This dissertation gives a detailed description of high speed Crossbar scheduling algorithm and its implementation.In chapter one, we mainly introduce the structure and development of high speed switching and the situation of research in and abroad. Based on this, we choose the Crossbar switch fabric as our research object.In chapter two and three, we mainly discuss the common problems of Crossbar switch and introduce the scheduling algorithm of Crossbar. Based on this, we compare performance and complexity between several classic scheduling algorithms. From the which we make the conclusion that iSLIP algorithm is the best one in both performance and easy to implement.Chapter four is the core part of this thesis. We detail a implemetation of a reduced Crossbar switch chip--Diamond. The design of iSLIP arbiter is the most important part.Chapter five is all above verification of Diamond. We use high-level verification method to prove that Diamond is correct in function.