(An) efficient binding algorithm in data path synthesis utilizing network flow computation = 네트워크-플로우을 이용한 데이타 경로 합성에서의 효율적 배정 알고리즘

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 382
  • Download : 0
We propose an efficient binding algorithm for power optimization in behavioral synthesis. In prior work, it has been shown that several binding problems for low-power can be formulated as multi-commodity flow problems (due to an iterative execution of data flow graph) and be solved optimally. However, since the multi-commodity flow problem is NP-hard, the application is limited to a class of small sized problems. To overcome the limitation, we address the problem of how we can effectively make use of the property of efficient flow computations in a network so that it is extensively applicable to practical designs while producing close-to-optimal results. To this end, we propose an efficient two-step algorithm, which (1) it determines a feasible binding solution by partially utilizing the computation steps for finding a maximum flow of minimum cost in a network and then (2) refines it iteratively. Experiments with a set of benchmark examples show that the proposed algorithm saves the run time significantly while maintaining close-to-optimal bindings in most practical designs.
Advisors
Kim, Tae-Whanresearcher김태환researcher
Description
한국과학기술원 : 전산학전공,
Publisher
한국과학기술원
Issue Date
2002
Identifier
174158/325007 / 020003560
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학전공, 2002.2, [ [ii], 20 p. ]

Keywords

datapath synthesis; network-flow; binding; 배정 알고리즘; 데이타 경로 합성; 네트워크 플로우

URI
http://hdl.handle.net/10203/34505
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=174158&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0