A case study of multi-threaded Gröbner basis completion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A case study of multi-threaded Gröbner basis completion

Full text

Pdf (971 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1996 international symposium on Symbolic and algebraic computation table of contents

Zurich, Switzerland

Pages: 95 - 102

Year of Publication: 1996

ISBN:0-89791-796-0

Authors

Beatrice Amrhein	Wilhelm Schickard Institute for Computer Science, University of Tübingen, Germany
Oliver Gloor	Wilhelm Schickard Institute for Computer Science, University of Tübingen, Germany
Wolfgang Küchlin	Wilhelm Schickard Institute for Computer Science, University of Tübingen, Germany

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 12

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/236869.236908 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ATTARDI, G., AND TRAVERSO, C. A strategy-accurate parallel Buchberger algorithm. In Hong {16}, pp. 12-21.
	2	Thomas Becker , Volker Weispfenning , Heinz Kredel, Gro¨bner bases: a computational approach to commutative algebra, Springer-Verlag, London, 1993
	3	Till Bubeck , M. Hiller , Wolfgang Küchlin , Wolfgang Rosenstiel, Distributed Symbolic Computation with DTS, Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems, p.231-248, September 04-06, 1995
	4	BUCHBERGER, COLLINS, ENCARNACION, I-tONG, JOHN- SON, KRANDICK, ZOOS, MANDACHE, NEUBACHER, AND VIELHABEt~. SACLIB User's Guide, 1993. On-line software documentation.
	5	Bruno Buchberger, Basic features and development of the critical-pair/completion procedure, Proc. of the first international conference on Rewriting techniques and applications, p.1-45, December 1985, Dijon, France
	6	Bruno Buchberger, The Parallel L-Machine for Symbolic Computation, Research Contributions from the European Conference on Computer Algebra-Volume 2, p.541-542, April 01-03, 1985
	7	BUCHBERGER, B. The parallelization of critical-pair / completion procedures on the L-Machine. TR 87-12, RISC, Linz, Austria, 1987.
	8	I3UCHBERGER~ B_, AND JEBELEAN, T. Parallel rational arithmetic for computer algebra systems: Motivating experiments. TR 92-29, RISC, Linz, Austria, 1992.
	9	Reinhard Bündgen , Manfred Göbel , Wolfgang Küchlin, A fine-grained parallel completion procedure, Proceedings of the international symposium on Symbolic and algebraic computation, p.269-277, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190427]
	10	Bi)NDGEN~ R., G6BEL, M., AND KiJCHLIN, W. Multithreaded AC term rewriting. In Hong {16}, pp. 84-93.
	11	Soumen Chakrabarti , Katherine Yelick, Implementing an irregular application on a distributed memory multiprocessor, Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.169-178, May 19-22, 1993, San Diego, California, United States
	12	S. R. Czapor, A heuristic selection strategy for lexicographic Gröner bases?, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.39-48, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120700]
	13	FAUGi~RE, J. Parallelization of GrSbner basis. In Hong {16}, pp. 124-132.
	14	Rüdiger Gebauer , H. Michael Möller, On an installation of Buchberger's algorithm, Journal of Symbolic Computation, v.6 n.2-3, p.275-286, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80048-8]
	15	Alessandro Giovini , Teo Mora , Gianfranco Niesi , Lorenzo Robbiano , Carlo Traverso, “One sugar cube, please” or selection strategies in the Buchberger algorithm, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.49-54, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120701]
	16	HONG, H., Ed. First Intl. Syrup. Parallel Symbolic Computation PASCO'94 vol. 5 of Lecture Notes Serzes m Computing, World Scientific.
	17	Wolfgang Kuechlin, PARSAC-2: A Parallel SAC-2 Based on Threads, Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.341-353, August 20-24, 1990
	18	Wolfgang Küchlin, The S-Threads Environment for Parallel Symbolic Computation, Proceedings of the Second International Workshop on Computer Algebra and Parallelism, p.1-18, May 09-11, 1990
	19	Ki~CHmN, W. PARSAC-2: Parallel computer algebra on the desk-top. In Computer Algebra in Science and Engineering, J. Fleischer, J. Grabmeier, F. HeAl, and W. Kiichlin, Eds., World Scientific, 19959 pp. 24-43.
	20	PoSSo~ Polynomial systems library. ftp: posso, dm.unipi, it.
	21	H. Sawada , S. Terasaki , A. Aiba, Parallel computation of Gro¨bner bases on distributed memory machines, Journal of Symbolic Computation, v.18 n.3, p.207-222, Sept. 1994 [doi>10.1006/jsco.1994.1045]
	22	Jean-Philippe Vidal, The computation of Gröbner bases on a shared memory multiprocessor, Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, p.81-90, April 10-12, 1990
	23	WATT, S. M., Ed. ISSAC'91 (Bonn, Germany, July 1991), ACM Press.
	24	WINDSTEIGER, W., AND BUCHBERGER, B. GR()BNER: A Library for computing GrSbner Bases based on SACLIB. Manual for Version 2.0, 1993.

CITED BY 12

	Olaf Bachmann , Hans Schönemann , Simon Gray, A proposal for syntactic data integration math protocols, Proceedings of the second international symposium on Parallel symbolic computation, p.165-175, July 20-22, 1997, Maui, Hawaii, United States
	Andreas Dolzmann , Oliver Gloor , Thomas Sturm, Approaches to parallel quantifier elimination, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.88-95, August 13-15, 1998, Rostock, Germany
	Masayuki Noro , John McKay, Computation of replicable functions on Risa/Asir, Proceedings of the second international symposium on Parallel symbolic computation, p.130-138, July 20-22, 1997, Maui, Hawaii, United States
	Angela Sodan , Guang R. Gao , Olivier Maquelin , Jens-Uwe Schultz , Xin-Min Tian, Experiences with non-numeric applications on multithreaded architectures, ACM SIGPLAN Notices, v.32 n.7, p.124-135, July 1997
	Arthur Norman , John Fitch, CABAL: polynomial and power series algebra on a parallel computer, Proceedings of the second international symposium on Parallel symbolic computation, p.196-203, July 20-22, 1997, Maui, Hawaii, United States
	Gene Cooperman , Victor Grinberg, Scalable parallel coset enumeration using bulk definition, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.77-84, July 2001, London, Ontario, Canada
	Gene Cooperman , Victor Grinberg, Scalable parallel coset enumeration: bulk definition and the memory wall, Journal of Symbolic Computation, v.33 n.5, p.563-585, May 2002
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	D. A. Yanovich, Parallelization of an Algorithm for Computation of Involutive Janet Bases, Programming and Computing Software, v.28 n.2, p.66-69, March-April 2002
	V. P. Gerdt , D. A. Yanovich, Parallel computation of Janet and Gröbner bases over rational numbers, Programming and Computing Software, v.31 n.2, p.73-80, March 2005
	D. A. Yanovich, Efficiency estimate for distributed computation of Gröbner bases and involutive bases, Programming and Computing Software, v.34 n.4, p.210-215, July 2008
	Abdallah Deeb I. Al Zain , Kevin Hammond , Jost Berthold , Phil Trinder , Greg Michaelson , Mustafa Aswad, Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures, Proceedings of the 4th workshop on Declarative aspects of multicore programming, January 20-20, 2009, Savannah, GA, USA