Cart (Loading....) | Create Account
Close category search window
 

Non-conflict RR scheduling algorithm and its hardware implementation for crossbar switch

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hongyin Luo ; Dept. of Phys., Xiamen Univ., Xiamen, China ; Lin Li ; Donghui Guo

In this paper, two different architectures of the iSLIP scheduling algorithm are implemented by hardware, and the delay limitation of this algorithm is indicated by comparing their performances. Then a matrix model is proposed for analyzing the reason of delay limitation, and the conclusion is that the pointer conflict causes the large area and delay in essence. Finally, the non-conflict RR scheduling algorithm is proposed for resolving this pointer conflict problem. The hardware implementation result shows that the performance of this algorithm is much better than iSLIP algorithm.

Published in:

Anti-Counterfeiting Security and Identification in Communication (ASID), 2010 International Conference on

Date of Conference:

18-20 July 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.