DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Tae-Whan | - |
dc.contributor.advisor | 김태환 | - |
dc.contributor.author | Choi, Yoon-Seo | - |
dc.contributor.author | 최윤서 | - |
dc.date.accessioned | 2011-12-13T06:02:36Z | - |
dc.date.available | 2011-12-13T06:02:36Z | - |
dc.date.issued | 2002 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=174158&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/34505 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학전공, 2002.2, [ [ii], 20 p. ] | - |
dc.description.abstract | 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. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | datapath synthesis | - |
dc.subject | network-flow | - |
dc.subject | binding | - |
dc.subject | 배정 알고리즘 | - |
dc.subject | 데이타 경로 합성 | - |
dc.subject | 네트워크 플로우 | - |
dc.title | (An) efficient binding algorithm in data path synthesis utilizing network flow computation | - |
dc.title.alternative | 네트워크-플로우을 이용한 데이타 경로 합성에서의 효율적 배정 알고리즘 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 174158/325007 | - |
dc.description.department | 한국과학기술원 : 전산학전공, | - |
dc.identifier.uid | 020003560 | - |
dc.contributor.localauthor | Kim, Tae-Whan | - |
dc.contributor.localauthor | 김태환 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.