Abstract
We describe a set of representations for polynomials and sparse matrices suited for use with fine-grain parallelism on a distributed memory multiprocessor system. Our aim is to support use of supercomputers with this style of architecture to perform computations that would exceed the main memory capacity of more traditional computers: although such systems have very high performance communication networks it is still essential to avoid letting any one part of the network become a bottleneck. We use randomised data placement both to avoid hot-spots in the communication patterns and to balance (in a probabilistic sense) the memory load placed upon each processing element. The expected application areas for such a system will be those where intermediate expression swell means that the huge primary memory available on MPP systems will be needed if the smaller final result is to be successfully computed.
Chapter PDF
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.
References
Dinda, P.A., Garcia, B.M., and Leung, D.-S. The measured network traffic of compiler-parallelized programs. Tech. rep., Carnegie Mellon University School of Computer Science, 1998. Techincal Report CMU-CS-98-144.
Geist, G., Kohl, J., and Papadopoulos, P. Pvm vs mpi: A comparison of features. In Calculateurs Paralleles (1996).
Gustavson, F., and Yun, D.Y.Y. Arithmetic complexity of unordered sparse polynomials. In SYMSAC’76 (August 1976), R.D. Jenks, Ed., SIGSAM, ACM, pp. 149–153.
Hitachi Ltd. A tutorial for parallel programming, 1995.
Kumar, V., Grama, A., Gupta, A., and Karypis, G. Introduction to Parallel Computing:Design and Analysis of Algorithms. Benjamin/Cummings Publishing Company, Inc., Redwood City, California, 1994.
Miller, R., and Stout, Q.F. Parallel Algorithms for Regular Architectures: Meshes and Pyramids. The MIT Press, Cambridge, Massachusetts, 1996.
Norman, A., and Fitch, J. Cabal: Polynomial and power series algebra on a parallel computer. In Proceedings of PASCO 1997 (1997).
Pacheco, P.S. Parallel Programming with MPI. Morgan Kaufmann Publishers, Inc., San Francisco, California, 1997.
Sasaki, T., and Kanada, Y. Parallelism in algebraic computaion and parallel algorithms for symbolic linear systems. In Proceedings of 1981 ACM Symposium on Symbolic and Algebraic Computation (1981), P.S. Wang, Ed., pp. 160–167.
Smit, J. New recursive minor expansion algorithms: A presentation in a comparative context. In Proceedings of International Symposium on Symbolic and Algebraic Manipulation (1979), E.W. Ng, Ed., Lecture Notes in Computer Science 72, Springer-Verlag, pp. 74–87.
Smit, J. A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sets of equations. In Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation (1981), P.S. Wang, Ed.
Snir, M., Otto, S.W., Huss-lederman, S., Walker, D.W., and Don-garra, J. MPI:The Complete Reference. The MIT Press, Cambridge, Massachusetts, 1996.
Tobey, R. Experience with formac algorithm design. In Communications of the ACM (1966), pp. 589–597.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matooane, ’., Norman, A. (1999). A Parallel Symbolic Computation Environment: Structures and Mechanics. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_212
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_212
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive