A decomposition approach for balancing large-scale acyclic data flow graphs
Journal Article
·
· IEEE (Institute of Electrical and Electronics Engineers) Transactions on Computers; (USA)
- Advanced Technology Center of ERSO of Industrial Technology Research Institute, Chu-Tung, Taiwan, Republic of China (TW)
- Purdue Univ., Lafayette, IN (USA). School of Electrical Engineering
In designing VLSI architectures for a complex computational task, the functional decomposition of the task into a set of computational modules can be represented as a directed task graph, and the inclusion onf input dta modifies the task graph to an acylic data flow graph (ADFG). Due to different paths of traveling and computation time of each computational module, operands may arrive at multiinput modules at different arrival times, causing a longer pipelined time. Delay buffers may be inserted along various paths to balance the ADFG to achieve maximum pipelining. This paper presents an efficient decomposition technique which provides a more systematic approach in solving the optimal buffer assignment problem of an ADFG with a large number of computational nodes. The buffer assignment problem is formulated as an integer linear optimization problem which can be solved in pseudopolynomial time. Examples are given to illustrate the proposed decomposition technique.
- OSTI ID:
- 7222615
- Journal Information:
- IEEE (Institute of Electrical and Electronics Engineers) Transactions on Computers; (USA), Journal Name: IEEE (Institute of Electrical and Electronics Engineers) Transactions on Computers; (USA) Vol. 39:1; ISSN 0018-9340; ISSN ITCOB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel algorithms and VLSI architectures for robotics and assembly scheduling
Parallel Algorithms for Graph Optimization using Tree Decompositions
Parallel Algorithms for Graph Optimization Using Tree Decompositions
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:7184509
Parallel Algorithms for Graph Optimization using Tree Decompositions
Conference
·
Mon Dec 31 23:00:00 EST 2012
·
OSTI ID:1089227
Parallel Algorithms for Graph Optimization Using Tree Decompositions
Technical Report
·
Fri Aug 31 20:00:00 EDT 2012
·
OSTI ID:1042920