Abstract
PAC is a parallel environment, based on a MIMD distributed computing model, which is intended to aid in the development of computer algebra algorithms. It uses parallelism as a tool for processing large problems. This paper discusses the general relationship between computer algebra and parallelism. The general features of the PAC project are described and some of the results obtained with PAC are presented. One of the crucial elements of symbolic computation on parallel architectures is efficient implementation of fast arbitrary precision arithmetic. This paper presents a nodal (arbitrary precision) integer arithmetic package and discusses the fast division algorithm which we have implemented. The representation used is designed to take advantage of a vectorized floating point unit. Our experiences with this approach are also discussed.
PAC has been implemented on the FPS T series hypercube (32 processors) and an implementation on the TELMAT Meganode (128 processors) is in progress.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A.V.Aho, J.E.Hopcroft, J.D.Ullman The Design and Analysis of Computer Algorithms, Addison Wesley (1974)
A. Borodin, “On relating Time and Space to Size and Depth”, SIAM Journal of Computing, 5, pp. 733–744, (1977).
R. Cole, U. Vishkin, “Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking”, Springer Verlag, Lectures Notes in Computer Science, 319, pp 91–100 (1988).
S.A. Cook, “On the Minimum Complexity of Functions”, Trans. Amer. Math. Soc., 142, pp. 291–314 (1969).
S.A. Cook, “A Taxonomy of Problems that have Fast Parallel Algorithms”, Information and Control, vol. 64, pp. 2–22, (1985).
L. Csanky, “Fast Parallel Matrix Inversion Algorithms”, SIAM Journal of Computing, 5/4, pp. 618–623, (1976).
C. Dicrescenzo and D. Duval, “Algebraic Extensions and Algebraic Closure in Scratchpad II,” Proceedings of ISSAC'88, (Ed. P. Gianni), Lecture Notes in Computer Science 358, Springer-Verlag, New York, 1989.
S. Johnson “Sparse Polynomial Arithmetic”, Bell Labs research report (1974).
A. Karatsuba, Y. Ofman “Multiplication of multidigit numbers on automata”, Dok. Akad. Nauk. SSSR, vol.145 (p. 293–294) (1962)
R.Kannan, G.Miller, L.Rudolph, “Sublinear parallel algorithm for computing the gcd of two integers”, SIAM J. Computing, vol 16/1, February (1987).
D.E.Knuth, Semi-numerical algorithms, Addison-Wesley (1981).
S.R. Kosaraju, V. Ramachandran, “Optimal Parallel Evaluation of Tree-Structured Computations by Raking” Springer Verlag, Lectures Notes in Computer Science, 319, pp. 101–110 (1988).
D.H. Lehmer, “Euclid's algorithm for large numbers”, AMMM, 45, pp. 227–233, April (1938).
G.L. Miller, E. Kaltofen, V. Ramachandran, “Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits”, SIAM Journal of Computing, 17/4 pp. 687–695 (1988).
J.L. Philippe, Parallélisation du crible quadratique—Application à la cryptographie, Ph.D. Thesis, Inst. Nat. Polytechnique de Grenoble (1990).
N. Pippenger, “On Simultaneous Resource Bounded Computation”, Proc. 20th Ann. IEEE Symp. on Fund, of Computer Science, pp. 307–311, (1979).
N. Revol, “Evaluateur distribué d'expressions arithmétiques”, Rapport de fin d'études, Inst. Nat. Polytechnique de Grenoble (1990).
J.L. Roch, Calcul Formel et Parallélisme: Le système PAC et son arithmétique nodale, Ph.D. Thesis, Inst. Nat. Polytechnique de Grenoble (1989).
J.L. Roch, P. Sénéchaud, F. Siebert, G. Villard, “Computer Algebra on MIMD machine”, SIGSAM Bulletin, 23/1, January (1989).
W.L. Ruzzo, “On Uniform Circuit Complexity”, Journal of Computer and System Sciences, 22, 3, pp. 365–383, June (1981).
Y. Saad, M.H. Schultz, “Topological Properties of Hypercubes”, IEEE Transactions on Computers, 37/7 (1988).
P. Sénéchaud, Calcul Formel et Parallélisme: Bases de Gröbner Booléennes — Méthodes de Calcul — Applications — Parallélisation, Ph.D. Thesis, Inst. Nat. Polytechnique de Grenoble (1990).
F. Siebert-Roch, Calcul Formel et Parallélisme: Forme Normale d'Hermite — Méthodes de Calcul et Parallélisation, Ph.D. Thesis Inst. Nat. Polytechnique de Grenoble (1990).
G. Villard, Calcul Formel et Parallélisme: Résolution de systèmes linéaires, Ph.D. Thesis, Inst. Nat. Polytechnique de Grenoble (1988).
H.J. Yeh, “L'intepréteur PAC, et l'évaluation parallèle dynamique”, Rapport de fin d'études, Inst. Nat. Polytechnique de Grenoble (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roch, JL. (1992). An environment for parallel algebraic computation. In: Zippel, R.E. (eds) Computer Algebra and Parallelism. CAP 1990. Lecture Notes in Computer Science, vol 584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55328-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-55328-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55328-1
Online ISBN: 978-3-540-47026-7
eBook Packages: Springer Book Archive