M.A. Khan, N. Miyamoto, R. Pantonial, K. Kotani, S. Sugawa, T. Ohmi
{"title":"提高drfpga的多上下文执行速度","authors":"M.A. Khan, N. Miyamoto, R. Pantonial, K. Kotani, S. Sugawa, T. Ohmi","doi":"10.1109/ASSCC.2006.357904","DOIUrl":null,"url":null,"abstract":"To implement a user circuit on a Dynamically Reconflgurable FPGA (DRFPGA) the circuit needs to be temporally partitioned into several sub-circuits such that their sequential execution on the DRFPGA yields the same result as that of the user circuit. In devices where interconnect delay is far dominating than logic delay, such implementation has the prospect of executing user circuits faster than traditional FPGA implementation, since temporal partitioning divides a long spatial wire of a circuit into several short temporal wires, thus converting interconnect delay into logic delay. To realize such prospect, reconfiguration delay and temporal communication delay of a DRFPGA must be kept as low as possible. This paper studies these issues and reports the architecture and performance of Flexible Processor III (FP3), a newly proposed DRFPGA. FP3 employs a new shift register type temporal interconnect and Nearest Neighbor (NN) type spatial interconnect to reduce the delay mentioned above. Correct behavior of FP3, designed and fabricated in 0.35 um CMOS technology, has been confirmed and our experimental results show that there exist cases where the best user circuit speed is achieved when two or more contexts are in use.","PeriodicalId":142478,"journal":{"name":"2006 IEEE Asian Solid-State Circuits Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Improving Multi-Context Execution Speed on DRFPGAs\",\"authors\":\"M.A. Khan, N. Miyamoto, R. Pantonial, K. Kotani, S. Sugawa, T. Ohmi\",\"doi\":\"10.1109/ASSCC.2006.357904\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To implement a user circuit on a Dynamically Reconflgurable FPGA (DRFPGA) the circuit needs to be temporally partitioned into several sub-circuits such that their sequential execution on the DRFPGA yields the same result as that of the user circuit. In devices where interconnect delay is far dominating than logic delay, such implementation has the prospect of executing user circuits faster than traditional FPGA implementation, since temporal partitioning divides a long spatial wire of a circuit into several short temporal wires, thus converting interconnect delay into logic delay. To realize such prospect, reconfiguration delay and temporal communication delay of a DRFPGA must be kept as low as possible. This paper studies these issues and reports the architecture and performance of Flexible Processor III (FP3), a newly proposed DRFPGA. FP3 employs a new shift register type temporal interconnect and Nearest Neighbor (NN) type spatial interconnect to reduce the delay mentioned above. Correct behavior of FP3, designed and fabricated in 0.35 um CMOS technology, has been confirmed and our experimental results show that there exist cases where the best user circuit speed is achieved when two or more contexts are in use.\",\"PeriodicalId\":142478,\"journal\":{\"name\":\"2006 IEEE Asian Solid-State Circuits Conference\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Asian Solid-State Circuits Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASSCC.2006.357904\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Asian Solid-State Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASSCC.2006.357904","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
摘要
为了在动态可重构FPGA (DRFPGA)上实现用户电路,需要将电路暂时划分为几个子电路,以便它们在DRFPGA上的顺序执行产生与用户电路相同的结果。在互连延迟远比逻辑延迟占主导地位的设备中,这种实现有望比传统的FPGA实现更快地执行用户电路,因为时间划分将电路的长空间线划分为几个短时间线,从而将互连延迟转换为逻辑延迟。为了实现这一前景,DRFPGA的重构延迟和瞬时通信延迟必须尽可能低。本文对这些问题进行了研究,并报道了柔性处理器III (FP3)的结构和性能。FP3采用一种新的移位寄存器型时间互连和最近邻(NN)型空间互连来减少上述延迟。采用0.35 um CMOS技术设计和制造的FP3的正确行为已经得到证实,我们的实验结果表明,当使用两种或多种环境时,存在最佳用户电路速度的情况。
Improving Multi-Context Execution Speed on DRFPGAs
To implement a user circuit on a Dynamically Reconflgurable FPGA (DRFPGA) the circuit needs to be temporally partitioned into several sub-circuits such that their sequential execution on the DRFPGA yields the same result as that of the user circuit. In devices where interconnect delay is far dominating than logic delay, such implementation has the prospect of executing user circuits faster than traditional FPGA implementation, since temporal partitioning divides a long spatial wire of a circuit into several short temporal wires, thus converting interconnect delay into logic delay. To realize such prospect, reconfiguration delay and temporal communication delay of a DRFPGA must be kept as low as possible. This paper studies these issues and reports the architecture and performance of Flexible Processor III (FP3), a newly proposed DRFPGA. FP3 employs a new shift register type temporal interconnect and Nearest Neighbor (NN) type spatial interconnect to reduce the delay mentioned above. Correct behavior of FP3, designed and fabricated in 0.35 um CMOS technology, has been confirmed and our experimental results show that there exist cases where the best user circuit speed is achieved when two or more contexts are in use.