南華大學機構典藏系統:Item 987654321/25078
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 18278/19583 (93%)
Visitors : 1073776      Online Users : 640
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://nhuir.nhu.edu.tw/handle/987654321/25078


    Title: Generic ILP-based approaches for time-multiplexed FPGA partitioning
    Authors: 吳光閔;Wu, Guang-Ming;Lin, Jai-Ming;Chang, Yao-Wen
    Contributors: 資訊管理學系
    Keywords: Field programmable gate arrays;Circuits;Logic arrays;Chaos;Logic devices;Computer architecture;Programmable logic arrays;Flip-flops;Clustering methods;Runtime
    Date: 2001-10
    Issue Date: 2017-07-18 15:47:37 (UTC+8)
    Abstract: Due to the precedence constraints among vertices, the partitioning problem for time-multiplexed field-programmable gate arrays (TMFPGAs) is different from the traditional one. In this paper, we first derive logic formulations for the precedence-constrained partitioning problems and then transform the formulations into integer linear programs (ILPs). The ILPs can handle the precedence constraints and minimize cut sizes simultaneously. To enhance performance, we also propose a clustering method to reduce the problem size. Experimental results based on the Xilinx TMFPGA architecture show that our approach outperforms the list-scheduling (List), the network-flow-based (FBB-m) (Liu and Wong, 1998), and the probability-based (PAT) (Chao, 1999) methods by respective average improvements of 46.6%, 32.3% and 21.5% in cut sizes. Our approach is practical and scales well to larger problems; the empirical runtime grows close to linearly in the circuit size. More importantly, our approach is very flexible and can readily extend to the partitioning problems with various objectives and constraints, which makes the ILP formulations superior alternatives to the TMFPGA partitioning problems.
    Relation: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
    vol. 20, no. 10
    pp.1266-1274
    Appears in Collections:[Department of Information Management] Periodical Articles

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML466View/Open


    All items in NHUIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback