Abstract
This paper describes a parallel implementation of the Gröbner Bases algorithm and the Characteristic Sets method using a grid environment. The two algorithms, their parallelization, and grid-enabled implementations are presented. The performance of the implementations has been evaluated and the experiments have demonstrated considerable speedups.
Similar content being viewed by others
References
Ajwa I (1998) Parallel algorithms and implementations for the Gröbner Bases algorithm and the characteristic sets method, Ph.D. Dissertation, Kent State University, Kent, Ohio, December 1998
Ajwa I, Wang P, Lin D (2000) Another attempt for parallel computation of characteristic sets. In: Proceedings of the fourth asian symposium on computer mathematics (ASCM’2000), Lecture Notes Series on Computing, vol 8, pp 63–66
Buchberger B (1965) An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal (in German), Doctoral Dissertation, Math Inst University of Innsbruck, Austria
Buchberger B (1985) Gröbner Bases: an algorithmic method in polynomial ideal theory. In: Bose NK, Reidel D (eds) Recent trends in multidimensional systems theory, pp 184–232
Buchberger B (1985) The parallel L-machine for symbolic computation. In: Caviness BF (ed) EUROCAL ’85, European conference on computer algebra, Springer, LNCS, vol 204, pp 541–542
Buchberger B et al (1993) SACLIB 1.1 User’s Guide, RISC-Report No. 93-19, Linz, Austria
Fensch J, Ajwa I (2006) A Grid Computing Environment at Ashland University, Technical Report, The Grid Project
Foster I, Kesselman C, Tuecke S (2001) The anatomy of the grid: Enabling scalable virtual organizations. Int J High Perform Comput Appl 15(3):220–222
Grabmeier J, Kaltofen E, Weispfenning V (2003) Computer algebra handbook: foundations, applications, systems. Springer
Lin D, Liu Z (1999) Mathematical research software: ELIMINO. In: Proceedings of the third asian symposium on computer mathematics (ASCM’1998). Lanzhou University Press, pp 107–114
Petcu D, Dubu D, Paprzycki M Maple link to grid, Western University of Timisoara, Romania
Wang D (1991) On the parallelization of the characteristic-set-based algorithms. In: Proceedings of the 1st international conference ACPC
Wolfram Research, gridMathematica, http://www.wolfram.com
Wu W-T (1984) On the decision problem and the mechanization of theorem-proving in elementary geometry, automated theorem proving: after 25 years. Contemp Math 29:213–234
Wu W-T (1986) Basic principles of mechanical theorem proving in elementary geometries. J Autom Reason 2:221–252
Wu Y, Liao W, Wang P, Lin D, Yang G (2003) An internet accessible grid computing system: Grid-ELIMINO. In: Internet accessible mathematical computation, a workshop of ISSAC
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ajwa, I.A. A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets. J Supercomput 41, 53–62 (2007). https://doi.org/10.1007/s11227-007-0103-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-007-0103-y