透過您的圖書館登入
IP:18.217.228.35
  • 學位論文

應用於可局部重組態邏輯閘陣列的模板式排程

Template-based Runtime Reconfiguration Scheduling For Partial Reconfigurable FPGA

指導教授 : 施吉昇

摘要


可重組態硬體能以低廉的成本及低功耗提供多樣化的功能。可程式化邏輯閘陣列(FPGA)為一種可重組態硬體,其技術的快速進展已使其可以應付高速及複雜的邏輯運算。以靜態記憶體技術為基礎製造的FPGA可以在執行時期內進行重組態以便在需要時提供邏輯運算功能而降低成本及功耗,但是重組態的延遲時間和FPGA上的資源管理為傳統的即時排程演算法帶來了新挑戰,為了最佳化硬體使用及重組態延遲時間,FPGA上的排程及資源管理需要新的技術。我們考量了FPGA的限制並提出以模板式演算法來管理硬體資源,並避免對效能造成影響或是違反重組態的截限時間限制。我們提出的解決方式利用離線時期產生的模板協助執行時期排程。

並列摘要


Reconfigurable hardwares can provide multiple functions with low cost and power consumption. Field Programmable Gate Array (FPGA), a form of reconfigurable hardware, is developing rapidly to handle high speed and complex applications. SRAM-based FPGA can be reconfigured during runtime to provide functionalities as they are required, thus reducing cost and power assumption. However, the reconfiguration delay time and resource management of FPGA poses new challenges to traditional real-time scheduling algorithms. In order to optimize hardware usage and reconfiguration delay time, the scheduling and resource management on FPGA requires new techniques. In this thesis, we study the constraints of FPGA and propose a template-based approach to reuse hardware resources without compromising performances and violating the reconfiguration deadline constraint. The proposed solution uses offline generated templates to assist the job of generating schedules during runtime.

參考文獻


[6] S. Ghiasi, A. Nahapetian, and M. Sarrafzadeh, “An optimal algorithm for minimizing
system for dynamical reconfiguration with adaptive priorities,” in Field Programmable
in International Parallel and Distributed Processing Symposium, p. 149a, 2005.
[9] J. Noguera and R. M. Badia, “HW/SW codesign techniques for dynamically reconfigurable
architectures,” in Very Large Scale Integration (VLSI) Systems, IEEE

延伸閱讀