DocumentCode
2868883
Title
Load-Aware Dynamic Partial Reconfiguration Implementation of Crossbar Scheduler
Author
Zhang, Shaobin ; Hu, Tongsen ; Wu, Minghui ; Chen, Tianzhou ; Qu, Zening
Author_Institution
Coll. of Comput. Sci., Zhejiang Univ. of Technol., Hangzhou, China
fYear
2011
fDate
12-14 Dec. 2011
Firstpage
252
Lastpage
258
Abstract
FPGA dynamic partial reconfiguration (DPR) tend to be adopted for its flexibility and fewer resource consumption increasingly in hardware implementation, especially in communication devices. A crossbar scheduling algorithm is used to schedule the crossbar, or decide the order in which cells will be served. The is lip and FIRM are two classic crossbar scheduling algorithms, but they do not support DPR. Performance of these two algorithms differs under varying workloads (load: cells´ arrival speed). With the development of DPR, implementations of these algorithms will have improvement both in performance and resource usage. DPR reduces 7.249% average delay than iSlip does and 0.013% average delay than FIRM does in 4×4 crossbar. It reduces 17.9% average delay than iSlip does and 0.039% average delay than FIRM does in 8×8 crossbar. In this paper, we compared the DPR implementation and non-DPR implementations (iSlip and FIRM) and found that the former reduces 37.744% LUTs and 47.874% FFs in 4×4 crossbar, and 47.325% LUTs and 49.907% FFs in 8×8 crossbar.
Keywords
field programmable gate arrays; processor scheduling; DPR; FPGA dynamic partial reconfiguration; crossbar scheduling algorithm; load aware dynamic partial reconfiguration implementation; Algorithm design and analysis; Delay; Educational institutions; Schedules; Scheduling; Scheduling algorithm; Switches; FPGA; crossbar; dynamic partial reconfiguration;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on
Conference_Location
Sydney, NSW
Print_ISBN
978-1-4673-0006-3
Type
conf
DOI
10.1109/DASC.2011.62
Filename
6119074
Link To Document