Abstract
There is a wealth of algorithms for solving recurrence systems on parallel machines. However, none of them takes into account the time and cost necessary to supply data to processors and data organization in parallel memory modules. It is shown how algorithms based on semigroups of recurrences lead naturally to the solution of this problem. Furthermore, it is shown that a parallel processor with a shift unit for rearranging data in memories is sufficient for solving recurrence systems.
This work was supported in part by the National Science Foundation under Grant No. US NSF MCS80-01561.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. C. Chen, D. J. Kuck, and A. H. Sameh, "Practical Parallel Band Triangular System Solvers," ACM Trans. on Mathematical Software, Vol. 4, No. 3, pp. 270–277, Sept. 1978.
D. D. Gajski, "Processor Arrays for Computing Linear Recurrence Systems," Proc. of the 1978 Int'1. Conf. on Parallel Processing, Bellaire, Michigan, pp. 246–256, 1978.
D. D. Gajski, "An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines," University of Illinois, Department of Computer Science Report No. 78–953, Dec. 1978.
L. Hyafil and H. T. Kung, "The Complexity of Parallel Evaluation of Linear Recurrences," Journ. of the ACM, Vol. 24, No. 3, pp. 513–521, July 1977.
P. M. Kogge and H. S. Stone, "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations," IEEE Trans. on Computers, Vol. C-22, pp. 786–793, Aug. 1973.
R. E. Landner and M. J. Fisher, "Parallel Prefix Computation," Journ. of the ACM, Vol. 27, No. 4, pp. 831–838, Oct. 1980.
A. H. Sameh and R. P. Brent, "Solving Triangular Systems on a Parallel Computer," SIAM Journ. Numerical Analysis, Vol. 14, pp. 1101–1113, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gajski, D.D. (1981). Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105129
Download citation
DOI: https://doi.org/10.1007/BFb0105129
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10827-6
Online ISBN: 978-3-540-38715-2
eBook Packages: Springer Book Archive