Algorithm Transformation Techniques for Concurrent Processors

Proceedings of the IEEE

Volumn 77, Issue 12, 1989, Pages 1879-1895

  Parhi, Keshab K ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; COMPUTER SYSTEMS, DIGITAL--MULTIPROCESSING;

ALGORITHM TRANSFORMATION TECHNIQUES; CONCURRENT PROCESSORS; DATA FLOW ARCHITECTURES;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0024883413     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.48830     Document Type: Article

References (83)

1. R. M. Karp and R. E. Miller, “Properties of a model for parallel computations: determinacy, termination, and queueing,” SIAM J. App. Math., vol. 14, pi. 1390–1411, Nov. 1966.
2. R. E. Miller, “Scheduling parallel computations,” J. Ass. Corn-put. Mach., vol. 15, pp. 590-599, Oct. 1968.
3. R. E. Crochiere and A. V. Oppenheim, “Analysis of linear digital networks,” Proc. IEEE, vol. 63, pp. 581-595, Apr. 1975.
4. J. B. Dennis, “Data flow supercomputers,” IEEE Comput., vol. 13, no. 11, pp. 48-56, Nov. 1980.
5. A. L. Davis and R. M. Keller, “Data flow program graphs,” IEEE Comput, vol. 15, pp. 26-41, Feb. 1982.
6. W. B. Ackerman, “Data flow languages,” IEEE Comput., vol. 15, no. 2, pp. 15-25, Feb. 1982.
7. E. A. Lee and D. G. Messerschmitt, “Static scheduling of synchronous data flow programs for digital signal processing,” IEEE Trans. Comput., vol. C-36, No. 1, pp. 24-35, Jan. 1987.
8. S. Y. Kung, P. S. Lewis, and S. C. Lo, “Performance analysis and optimization of VLSI data flow arrays,” J. Parallel Dist. Comput, vol. 4, pp. 592-618, 1987.
9. K. K. Parhi and D. G. Messerschmitt, “Rate-optimal fully-static multiprocessor scheduling of dataflow signal processing programs,” in Proc. 1989 IEEE Int. Symp. Circuits and Systems ‘Portland, OR, May 1989’, pp. 1923-1928.
10. “Fully-static rate-optimal scheduling of iterative dataflow programs via optimum unfolding,” in Proc. 1989 Int. Conf. on Parallel Processing ‘Chicago, IL, Aug. 1989’, vol. 1, pp. 209-216.
11. J. P. Brafman, J. Szczupak, and S. K. Mitra, “An approach to implementation of digital filters using microprocessors,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 26, pp. 442-446, Oct. 1978.
12. J. Zeman and G. S. Moschytz, “Systematic design and programming of signal processors using project management techniques,” IEEE Trans. Acoust, Speech, Signal Processing, vol. 31, no. 6, pp. 1536-1549, Dec. 1983.
13. A. Fettweis, “Realizability of digital filter networks,” Arch. Elek. Ubertragung, pp. 90-96, Feb. 1976.
14. M. Renfors and Y. Neuvo, “The maximum sampling rate of digital filters under hardware speed constraints,” IEEE Trans. Circuits Syst, vol. CAS-28, No. 3, pp. 196-202, Mar. 1981.
15. T. P. Barnwell III and C. J. M. Hodges, “Optimal implementation of signal flow graphs on synchronous multiprocessors,” in Proc. 1982 11th Int. Conf. on Parallel Processing ‘Bellaire, Ml, Aug. 24-27, 1982’, pp. 90-95.
16. C. V. Ramamoorthy and G. S. Ho, “Performance evaluation of asynchronous concurrent systems using Petri nets,” IEEE Trans. SoftwareEngrg., vol. SE-6, no. 5, pp. 440-449, Sept. 1980.
17. D. A. Schwartz, “Synchronous multiprocessor realizations of shift in variant flow graphs,” Ph.D. Dissertation, Georgia Institute of Technology, Atlanta, GA, Tech. Report DSPL-85-2, July 1985.
18. D. A. Schwartz and T. P. Barnwell III, “Cyclostatic multiprocessor scheduling for the optimal implementation of shift invariant flow graphs,” in Proc. of ICASSP-85 ‘Tampa, FL, Mar. 26-29, 1985’, pp. 1384-1387.
19. D. A. Schwartz, “Cyclostatic realizations: Loop unrolling and CPM, optimal multiprocessor scheduling,” in Proc. 1987 Princeton Workshop on Algorithms, Architecture, and Technology Issues in Models of Concurrent Computations, ‘Sept. 30-Oct. 1, 1987’.
20. S. H. Lee and T. P. Barnwell III, “Optimal multiprocessor implementation from a serial algorithm specification,” in Proc. oflCASSP-88, ‘NY, Apr. 11-14, 1988’, pp. 1694-1697.
21. H. Forren and D. A. Schwartz, “Transforming periodic synchronous multiprocessor programs,” Proc. of ICASSP-87, ‘Dallas, TX, Apr. 6-9, 1987’, pp. 1406-1409.
22. C. E. Leiserson, F. Rose, and J. Saxe, “Optimizing synchronous circuitry for retiming,” in 3rd Caltech Conf. on VLSI, ‘Pasadena, CA, Mar. 1983’, pp. 87-116.
23. S. Y. Kung, “On supercomputingwith systolic/wavefront array processors,” Proc. IEEE, vol. 72, no. 7, pp. 867-884, July 1984.
24. D. A. Schwartz and T. P. Barnwell III, “A graph theoretic technique for the generation of systolic implementations for shift invariant flow graphs,” in Proc. ICASSP-84, ‘San Diego, CA, Mar. 19-21, 1984’, vol. 1, paper 8.3/1-3.
25. P. M. Kogge and H. S. Stone, “A parallel algorithm for the efficient solution of a general class of recurrence equations,” IEEE Trans. Comput, vol. C-22, pp. 786-792, Aug. 1973.
26. P.M. Kogge, “Parallel solution of recurrence problems,” IBM I. Res. Develop., vol. 18, pp. 138-148, March 1974.
27. H. S. Stone, “An efficient parallel algorithm for the solution of a tridiagonal linear system of equations,” J. Ass. Comput. Mach., vol. 20, no. 1, pp. 27-38, Jan. 1973.
28. S-C. Chen and D. J. Kuck, “Time and parallel processor bounds for linear recurrence systems,” IEEE Trans. Comput., vol. C-24, No. 7, pp. 701-717, July 1975.
29. D. D. Gajski, “Processor array for computing linear recurrence systems,” in Proc. IEEE 7th Int. Conf. Parallel Processing, ‘Bellaire, Ml, Aug. 22-25, 1978’, pp. 246-256.
30. D. D. Gajski, “An algorithm for solving linear recurrence systems on parallel and pipelined machines,” IEEE Trans. Comput, vol. C-30, No. 3, pp. 190-206, Mar. 1981.
31. K. K. Parhi and D. G. Messershmitt, “Look-ahead computation: Improving iteration bound in linear recursions,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing ‘Dallas, TX, Apr. 1987’, 1855-1858.
32. K. K. Parhi and D. G. Messershmitt, “A bit-parallel bit level recursive filter architecture,” Proc. IEEE Int. Conf. Computer Design ‘Port Chester, NY, Oct. 6-9, 1986’, pp. 284-289.
33. K. K. Parhi and D. G. Messershmitt, “Area-efficient high speed VLSI adaptive filter architectures,” in Proc. IEEE Int. Conf. on Communications, ‘Seattle, WA, June 1987’.
34. K. K. Parhi and D. G. Messershmitt, “Concurrent cellular VLSI adaptive filter architectures,” IEEE Trans. Circuits Syst, vol. CAS-34, pp. 1141-1151, Oct. 1987.
35. H. H. Loomis and B. Sinha, “High speed recursive digital filter realization,” Circuits Syst., Signal Processing, vol. 3, no. 3, pp. 267-294, 1984.
36. R. W. Hockney, “A fast direct solution of Poisson equation using Fourier analysis,” J. Ass. Comput. Mach., vol. 12, no. 1, pp. 95-113, Jan. 1965.
37. B. L. Buzzbee, G. H. Golub, and C. W. Nielson, “On direct methods for solving Poisson's equations,” SIAMJ. Numerical Analysis, vol. 7, no. 4, pp. 627-656, Dec. 1970.
38. R. A. Sweet, “A generalized cyclic reduction algorithm,” SIAM j. Numerical Analysis, vol. 11, no. 3, pp. 506-520, June 1974.
39. P. N. Swarztrauber, “A direct method for discrete solution of separable elliptic equations,” SIAM J. Numerical Analysis, vol. 11, no. 6, pp. 1136-1150, Dec. 1974.
40. P. N. Swarztrauber, “The methods of cyclic reduction, Fourier analysis, and the FACR algorithm for the discrete solution of Poisson's equations on a rectangle,” SIAM Rev., vol. 19, no. 3, pp. 490-501, July 1977.
41. R. W. Hockney and C. R. Jesshope, Parallel Computers: Architecture, Programming, and Algorithms. Bristol, UK: Adam Hilger, 1981.
42. W. Oed and O. Lange, “The solution of linear recurrence relations on pipelined processors,” in Proc. Int. Conf. Parallel Processing, 1983, pp. 545-547.
43. K. K. Parhi and D. G. Messerschmitt, “Pipelined VLSI recursive filters using scattered lookahead and decomposition,” in Proc. 1988 IEEE Int. Conf. Acoustics, Speech, Signal Processing, ‘NY, Apr. 1988’, pp. 2120-2123.
44. K. K. Parhi and D. G. Messerschmitt, “Pipeline interleaving and parallelism in recursive digital filters, Part I: Pipelining using scattered lookahead and decomposition,” IEEE Trans. Acoust, Speech, Signal Processing, vol. ASSP-37, No. 7, pp. 1099-1117, July 1989.
45. K. K. Parhi and M. Hatamian, “A high sample rate recursive digital filter chip,” in Proc. 1988 IEEE VLSI Signal Processing Workshop ‘Monterey, CA, Nov. 1988’.
46. G. Fettweis and H. Meyr, “Parallel Viterbi decoding by breaking the compare select feedback bottleneck,” in.Proc. IEEE Int. Conf. on Communications ‘Philadelphia, PA, June 1988’, pp. 719-723.
47. K. K. Parhi, “Look-ahead in dynamic programming and quantizer loops,” in Proc. 1989 IEEE Int. Symp. Circuits and Syst. ‘Portland, OR, May 1989’, pp. 1382-1387.
48. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967.
49. G. D. Forny, “The Viterbi algorithm,” Proc. IEEE, vol. 61, no. 3, pp. 268-278, Mar. 1973.
50. L. R. Rabiner and B. H. Juang, “An introduction to hidden markov models,” IEEE ASSP Magazine, vol. 3, no. 1, Jan. 1986.
51. B. Gold and K. L. Jordan, “A note on digital filter synthesis,” Proc. IEEE, vol. 65, no. 10, pp. 1717-1718, Oct. 1968.
52. H. B. Voelcker and E. E. Hartquist, “Digital filtering via block recursion,” IEEE Trans. Audio Electroacoust, vol. AU-18, pp. 169-176, June 1970.
53. C. S. Burrus, “Block implementation of digital filters,” IEEE Trans. Circuit Theory, vol. CT-18, pp. 697-701, Nov. 1971.
54. A. L. Moyer, “An efficient parallel algorithm for digital IIR filters,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, April 1976, pp. 525-528.
55. S. K. Mitra and R. Gnanasekaran, “Block implementation of recursive digital filters New structures and properties,” IEEE Trans. Circuits and Syst., vol. CAS-25, pp. 200-207, Apr. 1978.
56. K. S. Arun, “Ultra-high-speed parallel implementation of low-order digital filters,” in Proc. IEEE Int. Symp. on Circuits and Systems, 1986, pp. 944-946.
57. C. W. Barnes and S. Shinnaka, “Block shift invariance and block implementation of discrete-time filters,” IEEE Trans. Circuits and Syst., vol. CAS-27, pp. 667-672, Aug. 1980.
58. J. Zeman and A. C. Lindgren, “Fast digital filters with low roundoff noise,” IEEE Trans. Circuits and Syst., vol. CAS-28, pp. 716-723, July 1981.
59. D. A. Schwartz and T. P. Barnwell III, “Increasing the parallelism of filters through transformation to block state variable form,” in Proc. Int. Conf. Acoustics, Speech, Signal Processing, 1984.
60. H. H. Lu, E. A. Lee, and D. G. Messerschmitt, “Fast recursive filtering with multiple slow processing elements,” IEEE Trans. Circuits and Syst, vol. CAS-32, No. 11, pp. 1119-1129, Nov. 1985.
61. C. L. Nikias, “Fast block data processing via a new MR digital filter structure,” IEEE Trans. Acoust., Speech Signal Processing, vol. 32, no. 4, Aug. 1984.
62. C.W. Wu and P. R. Cappello, “Computer-aided design of VLSI second order sections,” in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, ‘Dallas, TX, Apr. 6-9, 1987’, pp. 1907-1910.
63. K. K. Parhi and D. G. Messerschmitt, “Block digital filtering via incremental block-state structure,” in Proc. IEEE Int. Symp. Circuits Syst. ‘Philadelphia, PA, May 1987’, pp. 645-648.
64. K. K. Parhi and D. G. Messerschmitt, “Pipeline interleaving and parallelism in recursive digital filters, Part II: Pipelined incremental block filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-37, No. 7, pp. 1118-1135, July 1989.
65. H. T. Kung, “Why systolic architectures,” IEEE Comput., vol. 15, no. 1, pp. 37-45, Jan. 1982.
66. P. R. Cappello and K. Steiglitz, “Unifying VLSI array design with linear transformations of space time,” Adv. Comput. Res., vol. 2, pp. 23-65, 1984.
67. P. Quinton, “Automatic synthesis of systolic arrays from uniform recurrent equations,” in Proc. 11th Annu. Symp. Comput. Arch., ‘Ann Arbor, Ml, June 5-7, 1984’, pp. 208-214.
68. D. I. Moldovan and J. A. B. Fortes, “Partitioning and mapping of algorithms into fixed size systolic arrays,” IEEE Trans. Corn-put., vol. C-35, No. 1, pp. 1-12, Jan. 1986.
69. G. Li and B. W. Wah, “The design of optimal systolic arrays,” IEEE Trans. Comput., vol. C-34, pp. 66-77, Jan. 1985.
70. M. C. Chen, “A design methodology for synthesizing parallel algorithms and architectures,”. J. Parallel Distrib. Comput., pp. 461-491, Dec. 1986.
71. H. V. Jagadish, S. K. Rao, and T. Kailath, “Array architectures for iterative algorithms,” Proc. IEEE, vol. 75, no. 9, pp. 1304-1321, Sept. 1987.
72. S. Y. Kung, VLSI Array Processors. Englewood Cliffs, NJ: Prentice-Hall, 1988.
73. L. Lamport, “The parallel execution of do loops,” Commun. Ass. Comput. Mach., vol. 17, no. 2, pp. 83-93, Feb. 1974.
74. T. Aboulnasr and W. Steenart, ‘ Real time systolic array processor for 2D spatial filtering”, IEEE Trans. Circuits and Syst., vol. CAS-35, No. 4, pp. 451-455, Apr. 1988.
75. K. K. Parhi and D. G. Messeischmitt, “Two-dimensional recursive digital filtering: Pipel ning, one-, and twodimensional block processing,” in Proc. IEEE Int. Symp. Circuits Syst. ‘Helsinki, Finland, June 1988’, pp. 1521-1524.
76. K. K. Parhi and D. G. Messeischmitt, “Concurrent architectures for twodimensional recursive digital filtering,” IEEE Tran;. Circuits Syst., vol. CAS-36, No. 6, pp. 813-829, June 1989.
77. R. A. Cohen, J. W. Woods, M. Sanya, and J. F. McDonald, “A video rate architecture for a fully recursive twodimensional filter,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, Apr. 1987, pp. 1973-19'6.
78. J. Loney and M. G. Strintzis, “Block implementation of two dimensional digital filters,” in Proc. IEEE Conf. on Pattern Recognition and Image Processing, ‘Chicago, IL, May 31-June 2, 1978’, pp. 119-122.
79. S. K. Mitra and R. Gnanasekaran, “Block implementation of twodimensional digital filters,’ J. Franklin Inst., vol. 316, pp. 299-316, Oct. 1983.
80. B. G. Mertzios, “Block realizat on of 2-D MR digital filters,” Signal Processing, vol. 7, no. 2, pp. 135-149, Oct. 1984.
81. M. R. Azimi-Sadjadi and R. A. King, “Two-dimensional block processors Structures and implementations,” IEEE Trans. Circuits Syst., vol. CAS-33, no. I, pp. 42-50, Jan. 1986.
82. H. H. Chiang and C. L. Nikias, “Parallel block realization of 2-D HR digital filters,” in Proc. 1985 IEEE Int. Conf. Acoustics, Speech, Signal Processing, ‘Tampa, FL, 1985’, pp. 1301-1304.
83. C. J. Ju and W. E. Alexander, “Block realization of of multidimensional IIR digital filters and its finite word effects,” IEEE Trans. Circuits and Syst., vol. CAS-34, No. 9, pp. 1030-1044, Sept. 1987.