Abstract
PAC is a computer algebra system, based on MIMD type parallelism. It uses parallelism as a tool for processing problems wich are too complex for a sequential treatment. Basic fundamentals of the system are firstly discussed. Then, different problems are studied, particularly the implementation of infinite-precision arithmetic, the solution of linear systems and of Diophantine equations, the parallelization of Buchberger's algorithm for Gröbner bases.
A prototype of PAC is implemented on the Floating Point System hypercube Tesseract 20 (16 nodes), and different timing results obtained on this machine are given.
This work is partially supported by the PRC Mathématiques et Informatique and by the Greco Calcul Formel of French Centre National de la Recherche Scientifique.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Abelson, G. J. Sussman, J. Sussman "Structure & Interpretation of Computer Programs" (p.491–503) Mc Graw-Hill Book Company (1985).
A.V. Aho, J.E. Hopcroft, J.D. Ullman "Data Structure & Algorithm" (p. 378–407) Addison-Wesley (1983).
E.H. Bareiss, "Computational Solution of Matrix Problems over an Integral Domain", J. Inst. Math. Applic. 10 (1972), 68–104.
D. Bayer and M. Stillman "The Design of Macaulay: A System for Computing in Algebraïc Geometry and Commutative Algebra." (January 1986).
W.A. Blankinship, A new version of the Euclidean algorithm, Amer. Math. Monthly, vol. 70, No3, (1967).
B. Buchberger. "A Criticical Pair / Completion Algorithm for Finited Generated Ideals in Rings". Proc logic and Machines. Decision Problems and Complexity ed by E. Bröger, G. Hasenjaeger, D. Rödding.Springer LNCS 171 (1983).
B. Buchberger. "Basic Features and Development of the Critical Pair / Completion Procedure". Preprint J. Kepler University Austria
S. Cabay and T.P.L. Lam, "Congruence Techniques fot the Exact Solution of Integer Systems of Linear Equations", ACM Trans. Math. Software 3, 386–397 (1977).
J. Chazarain. "The Lady, the tiger and the Gröbner Basis". Preprint no100 University of Nice. Department of Mathematics.
M.Cosnard and Y.Robert, "Implementing the Null Space Algorithm over GF(p) on a Ring of Processors", Second international symposium on Computer and Information Sciences, Istanbul (1987).
M.Cosnard, B.Tourancheau, G.Villard, Présentation de l'hypercube T20 de FPS, Journées Architecture C3, Sophia Antipolis, Revue Bigre + Globule (1987).
M.Cosnard, B.Tourancheau and G.Villard, "Gaussian Elimination on Message Passing Architectures", Proceedings of ICS 87, Athènes, Lect. Notes Comp. Sc. no 297, Springer Verlag (1988).
J.D. Dixon, "Exact solution of Linear Equations using P-adic Expansions", Numer. Math. 40, 137–141 (1982).
Floating Point Systems, "Programming the FPS T-Series, Release B, Portland Oregon 97223.
G.A.Geist, "Efficient Parallel LU Factorization with Pivoting on a Hypercube Multiprocessor", ORNL Preprint 6211 (1985).
G.H.Golub and C.F.Van Loan, "Matrix Computation", The John Hopkins Univ. Press (1983).
R.T.Gregory and E.V.Krishnamurthy, "Methods and Applications of Error-Free Computations", Springer Verlag (1984).
K.Hwang and F.Briggs, "Parallel Processing and Computer Architecture", Mc Graw Hill (1984).
S.L.Johnsson and C.T.Ho, "Spanning Graphs for Optimum Broadcasting and Personalized Communication in Hypercubes", Technical Report 500, Comp. Sc. Dpt.,Yale University (1986).
M.Kaminski, A.Paz, Computing the Hermite normal form on an integral matrix, Technical Report 417, Israel Institute of Technology (june 1987).
D.E. Knuth "The Art of Computer Programming Vol. 2: Semi-Numerical Algorithms" (p. 229–293) Addison-Wesley Reading Mass (1969).
E.V. Krishnamurthy, T.M. Rao and K. Subramanian, "P-adic Arithmetic Procedures for Exact Matrix Computations", Proc. Indian Acad. Sci. 82A, 165–175 (1975).
M. McClellan, "The Exact Solution of Systems of Linear Equations with Polynomials Coefficients", Journal of A.C.M., vol. 20, pp 563–588 (1973).
D.G. Malm, A computer laboratory manual for number theory, student manual, COMPress (1980).
R. Mœnck "Is a Linked List the Best Storage for an Algebra System" Research Report
M.Newman, Integral matrices, Pure and applied mathematics, Academic Press (1973).
E. Regener "Multiprecision Integer Division Examples Using Arbitrary Radix" ACM, vol. 10 No 3 (1984).
J.L.Roch, P.Sénéchaud, F.Siebert et G.Villard, "Parallel Algebraic Computing", Imag Grenoble, RR-686 I, (december 1987).
J.L. Roch, P. Senechaud, F. Siebert, G. Villard "Calcul Formel, Parallelisme et Occam" OPPT Ed.T.Muntean (1987).
Y. Saad, Topological properties of hypercubes, Research report YALEU / DCS / RR-389 (1985).
Y.Saad, "Gaussian Elimination on Hypercubes", in Parallel Algorithms and Architectures, Eds. M.Cosnard & al., North-Holland (1986).
A. Schrijver, Theory of linear and integer programming, John Wiley, Chichester, England (1985).
Q.F.Stout and B.Wager, "Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines", CRL-TR-9-87, University of Michigan (1987).
G.Villard, "Parallel General Solution of Rational Linear Systems using P-adic Expansions", Proceedings of the IFIP WG 10.3 Working Conference on Parallel Processing, Pisa Italy, Elsevier Sc.P. To appear (1988).
S. Watt. "Bounded Parallelism in Computer Algebra". Thesis presented to the University of Waterloo Ontario (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roch, JL., Senechaud, P. (1989). Computer algebra on MIMD machine. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_40
Download citation
DOI: https://doi.org/10.1007/3-540-51084-2_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51084-0
Online ISBN: 978-3-540-46153-1
eBook Packages: Springer Book Archive