{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:13Z","timestamp":1750306933261,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"1s","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["NSC-99-2218-E-126-003 and NSC-100-2221-E-126-005"],"award-info":[{"award-number":["NSC-99-2218-E-126-003 and NSC-100-2221-E-126-005"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:p>Dynamically reconfigurable FPGA (DRFPGA) implements a given circuit system by partitioning it into stages and then executing each stage sequentially. Traditionally, the number of communication buffers is minimized. In this article, we study the partitioning problem targeting at power minimization for the DRFPGAs that have lookup table (LUT) based logic blocks. We analyze the power consumption caused by the communication buffers in the temporal partitioning. Based on the analysis, we use a flow network to represent a given circuit so that the power consumption of buffers is correctly evaluated and the temporal constraints are satisfied in circuit partitioning. The well known flow-based FBB algorithm is then applied to the network to find the area-balanced partitioning of minimum power consumption. Experimental results show that our method outperforms the conventional partitioning algorithms in terms of power consumption. The problem is then extended to include constraints on the number of communication buffers. We provide a net modeling for this extended problem and present an extension of the FBB algorithm to obtain a power-optimal solution. Experimental results demonstrate the effectiveness of the proposed algorithm in reducing power consumption as compared to the previous partitioning algorithms without exceeding the buffer number limit.<\/jats:p>","DOI":"10.1145\/2435227.2435248","type":"journal-article","created":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T16:27:31Z","timestamp":1515083251000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Power minimization for dynamically reconfigurable FPGA partitioning"],"prefix":"10.1145","volume":"12","author":[{"given":"Tzu-Chiang","family":"Tai","sequence":"first","affiliation":[{"name":"Providence University, Taichung, Taiwan"}]},{"given":"Yen-Tai","family":"Lai","sequence":"additional","affiliation":[{"name":"National Cheng Kung University, Tainan, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2013,3,29]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Bhat N. B. Chaudhary K. and Kuh E. S. 1993. Performance-oriented fully routable dynamic architecture for a field programmable logic device. Memo no. UCB\/RELM93\/42 University of California Berkeley.   Bhat N. B. Chaudhary K. and Kuh E. S. 1993. Performance-oriented fully routable dynamic architecture for a field programmable logic device. Memo no. UCB\/RELM93\/42 University of California Berkeley."},{"key":"e_1_2_1_2_1","volume-title":"DELTA: Prototype for a First-Generation Dynamically Programmable Gate Array","author":"Brown J.","year":"1995","unstructured":"Brown , J. , Chen , D. , Eslick , I. , Tau , E. , and DeHon , A. 1995 . DELTA: Prototype for a First-Generation Dynamically Programmable Gate Array . MIT Press , Cambridge, MA . Brown, J., Chen, D., Eslick, I., Tau, E., and DeHon, A. 1995. DELTA: Prototype for a First-Generation Dynamically Programmable Gate Array. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/258305.258331"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.773794"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/339492.340041"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888289"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.920832"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPGA.1994.315596"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647921.740866"},{"key":"e_1_2_1_10_1","unstructured":"Ford J. R. and Fulkerson D. R. 1962. Flows in Networks. Princeton University Press Princeton NJ.  Ford J. R. and Fulkerson D. R. 1962. Flows in Networks. Princeton University Press Princeton NJ."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.1999.759297"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1723112.1723135"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CICC.1995.518231"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASSCC.2005.251732"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/966137.966139"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289077"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.673632"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.814237"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.205010"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.105"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357964"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/567270.567275"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/275107.275135"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/549928.795737"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/370155.370569"},{"key":"e_1_2_1_26_1","unstructured":"Weste N. and Eshraghian K. 1993. Principles of CMOS VLSI Design: A Systems Perspective. Addison-Wesley Reading MA.   Weste N. and Eshraghian K. 1993. Principles of CMOS VLSI Design: A Systems Perspective. Addison-Wesley Reading MA."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.952745"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.552086"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2435227.2435248","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2435227.2435248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:40Z","timestamp":1750235740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2435227.2435248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":28,"journal-issue":{"issue":"1s","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1145\/2435227.2435248"],"URL":"https:\/\/doi.org\/10.1145\/2435227.2435248","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2013,3]]},"assertion":[{"value":"2010-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-03-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}