可編程邏輯芯片特別是FPGA的快速發(fā)展，使得新的芯片能夠根據(jù)具體應(yīng)用動(dòng)態(tài)地調(diào)整結(jié)構(gòu)以獲得更好的性能，這類芯片稱為動(dòng)態(tài)可重構(gòu)FPGA芯片（DRFPGA）。然而，使用這類芯片構(gòu)建的可重構(gòu)系統(tǒng)在實(shí)際應(yīng)用前還有許多問(wèn)題需要解決。本文提出一個(gè)基于劃分和時(shí)延驅(qū)動(dòng)的在線布局算法，來(lái)解決動(dòng)態(tài)可重構(gòu)FPGA芯片的布局問(wèn)題。實(shí)驗(yàn)結(jié)果表明，我們的布局算法與傳統(tǒng)的布局算法相比，在時(shí)延上平均減少27%，在線長(zhǎng)上平均減少34%，在運(yùn)行時(shí)間上平均減少42%。
關(guān)鍵詞 劃分布局；時(shí)延驅(qū)動(dòng)；動(dòng)態(tài)可重構(gòu)FPGA；模型

Abstract The advances in the programmable logic devices especially Field-Programmable Gate Arrays (FPGA) have led to new architectures where the hardware can be dynamically adapted to the application to gain better performance. This kind of FPGA is called Dynamically Reconfigurable FPGA (DRFPGA). However, there are still many challenging problems to be solved before any practical reconfigurable system is built. In this paper, we present a partitioning-based timing-driven online placement for DRFPGAs. Experimental results show that our placement scheme achieves on average a total decrease of 27% in delay, 34% in wire-length and 42% in runtime, compared with the traditional placement methods.
Key words Partitioning-based Placement; Timing-driven; Dynamic Reconfigurable FPGA; Model