Abstract
In this paper, we propose a new algorithm that analyzes the data dependency pattern in the first-order linear recurrence (FOLR) and transforms it into algebraically equivalent expanded form so that it can be processed in parallel using the threads on symmetric multiprocessor (SMP) machines. The transformation aims to eliminate the data dependencies in the naive nested form of the FOLR. However, as this transformation may result in extra multiplication operations, our algorithm examines the immanent overhead of the expanded form of the FOLR and generates a new hybrid form of the FOLR. The hybrid form combines nested and appropriately expanded form in order to make it suitable for parallel processing. The parallel algorithm based on the hybrid form of the FOLR is analytically examined and tested through implementation on SMP machines. The implementation details, such as the workload balancing between processors and the optimization of cache performance, are also discussed. The experimental results show that the parallel algorithm based on the hybrid form of the FOLR considerably improves the performance on SMP machines that have three of more processors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Nakamura, Y. Okabe, and T. Tsuda. New fast algorithms for first-order linear recurrences on vector computers. In 5th Workshop on Compilers for Parallel Computers, pp. 167–174, June 1995.
M. J. Wolfe. High Performance Compilers for Parallel Computing, Addison Wesley Publishing, 1995.
H. Zima and B. Chapman. Supercompilers for Parallel and Vector Computer, ACM Press, 1992.
S. Carr, C. Ding, and P. Swany. Improving software pipelining with Unroll-and-Jam. In 29th Annual Hawaii International Conference on System Sciences, pp. 183–192, January 1996.
J. Demmel and M. Heath. Parallel numerical linear algebra. Acta Numerical, pp. 111–197, 1993.
H. Wang, A. Nicolau, S. Keung, and Kai-Yeung Siu. Computing programs containing band linear recurrences on vector supercomputers. IEEE Transactions on Parallel and Distributed Systems, 7(8):769–782, August 1996.
A. Youssef. Parallel algorithms for multi-indexed recurrence relations with applications to DPCM image compression. In Data Compression Conference' 98, p. 584, IEEE, March 1998.
P. M. Kogge and H. S. Stone. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Transactions on Computers, C22(8):786–793, 1973.
Y. Tanaka, K. Iwasawa, S. Gotoo, and Y. Umetani. Compiling techniques for first-order linear recurrences on a vector computer. In Supercomputing' 88, pp. 174–181, IEEE, November 1988.
F. T. Leighton. Introduction to Parallel Algorithms and Architecture: Arrays, Trees-Hypercubes, Morgan Kaufmann Publishers, September 1991.
Y. Ben-Asher and G. Haber. Parallel solution of simple indexed recurrence equations. In 11th International Parallel Processing Symposium, pp. 413–417. IEEE, April 1997.
Y. Ben-Asher and G. Haver. Parallel solution of simple indexed recurrence equations. IEEE Transactions on Parallel and Distributed Systems, 12(1):22–37, January 2001.
H. Wang, A. Nicolau, S. Keung, and K. S. Siu. Scalable techniques for computing band linear recurrences on massively parallel and vector supercomputers. In 8th International Parallel Processing Symposium, pp. 502–508. IEEE/ACM, April 1994.
W. Cheney and D. Kincaid. Numerical Mathematics and Computing, Books/Cole Publishing Company, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kim, Hs., Yoon, Yh. & Han, Ds. Parallel Processing of First Order Linear Recurrence on SMP Machines. The Journal of Supercomputing 27, 295–310 (2004). https://doi.org/10.1023/B:SUPE.0000011389.69863.dc
Issue Date:
DOI: https://doi.org/10.1023/B:SUPE.0000011389.69863.dc