
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P.R. Chang, C.S.G. Lee, "A Decomposition Approach for Balancing LargeScale Acyclic Data Flow Graphs," IEEE Transactions on Computers, vol. 39, no. 1, pp. 3446, January, 1990.  
BibTex  x  
@article{ 10.1109/12.46279, author = {P.R. Chang and C.S.G. Lee}, title = {A Decomposition Approach for Balancing LargeScale Acyclic Data Flow Graphs}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {1}, issn = {00189340}, year = {1990}, pages = {3446}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.46279}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Decomposition Approach for Balancing LargeScale Acyclic Data Flow Graphs IS  1 SN  00189340 SP34 EP46 EPD  3446 A1  P.R. Chang, A1  C.S.G. Lee, PY  1990 KW  decomposition approach; balancing largescale acyclic data flow graphs; optimal buffer assignment problem; integer linear optimization problem; pseudopolynomial time; integer linear constraint equations; optimisation; parallel processing. VL  39 JA  IEEE Transactions on Computers ER   
An efficient decomposition technique that provides a more systematic approach in solving the optimal buffer assignment problem of an acyclic dataflow graph (ADFG) with a large number of computational nodes is presented. The buffer assignment problem is formulated as an integer linear optimization problem that can be solved in pseudopolynomial time. However, if the size of an ADFG increases, then integer linear constraint equations may grow exponentially, making the optimization problem more intractable. The decomposition approach utilizes the critical path concept to decompose a directed ADFG into a set of connected subgraphs, and the integer linear optimization technique can be used to solve the buffer assignment problem in each subgraph. Thus, a largescale integer linear optimization problem is divided into a number of smallerscale subproblems, each of which can be easily solved in pseudopolynomial time. Examples are given to illustrate the proposed decomposition technique.
[1] H. M. Ahmed, J. M. Delosme, and M. Morf, "Highly concurrent computing structures for matrix arithmetic and signal processing,"IEEE Comput. Mag., vol. 15, no. 1, pp. 6582, Jan. 1982.
[2] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Reading, MA: AddisonWesley, 1974, pp. 195199.
[3] S. Baase,Computer Algorithms: Introduction to Design and Analysis. Reading, MA: AddisonWesley, 1978, pp. 145148.
[4] J. D. Brock and L. B. Montz, "Translation and optimization of data flow programs," inProc. 1979 Int. Conf. Parallel Processing, Aug. 1979, pp. 4654.
[5] J. B. Dennis and R. G. Gao, "Maximum pipelining of array operations on static data flow machine," inProc. 1983 Int. Conf. Parallel Processing, Aug. 1983, pp. 331334.
[6] K. S. Fu, Ed.,VLSI for Pattern Recognition and Image Processing. New York: SpringerVerlag, 1984.
[7] G. L. Haviland and A. A. Tuszynski, "A CORDIC arithmetic processor chip,"IEEE Trans. Comput., vol. C29, no. 2, pp. 6879, Feb. 1980.
[8] F. H. Hsu, H. T. Kung, T. Nishizawa, and A. Sussman, "LINC: The link and interconnection chip," Dep. Comput. Sci., CarnegieMellon Univ., 1984.
[9] K. Hwang and Z. Xu, "Multipipeline networking for fast evaluation of vector compound functions," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 495502.
[10] H. T. Kung, "Why systolic architectures?,"IEEE Comput. Mag., pp. 3746, Jan. 1982.
[11] H. T. Kung and M. Lam, "Waferscale integration and twolevel pipelined implementation of systolic arrays,"J. Parallel Distrib. Comput., vol. 1, no. 1, pp. 3263, Sept. 1984.
[12] S. Kung, H. Whitehouse, and T. Kailath,VLSI and Modern Signal Processing, Prentice Hall, Englewood Cliffs, N.J., 1985.
[13] E. L. Lawler,Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
[14] C. S. G. Lee and P. R. Chang, "Efficient parallel algorithm for inverse dynamics computation,"IEEE Trans. Syst., Man, Cybern., vol. SMC16, no. 4, pp. 532542, July/Aug. 1986.
[15] C. S. G. Lee and P. R. Chang, "A maximum pipelined CORDIC architecture for robot inverse kinematic position computation,"IEEE J. Robot. Automat., vol. RA3, no. 5, pp. 445458, Oct. 1987.
[16] C. E. Leiserson and J. B. Saxe, "Optimizing synchronous systems,"J. VLSI Comput. Syst., vol. 1, pp. 4168, 1983.
[17] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: AddisonWesley, 1980, pp. 150152.
[18] C. H. Papadimitriou, "On the complexity of integer programming,"J. Assoc. Comput. Mach., vol. 28, pp. 675768, 1981.
[19] J. A. Starzyk and A. Konczykowska, "Flowgraph analysis of large electronic networks,"IEEE Trans. Circuits Syst., vol. CAS33, pp. 302315, Mar. 1986.
[20] J. E. Volder, "The CORDIC trigonometric computing technique,"IRE Trans. Electron. Comput., vol. EC8, no. 3, pp. 330334, Sept. 1959.