The Community for Technology Leaders
2013 Workshops of 27th International Conference on Advanced Information Networking and Applications (WAINA) (2013)
Barcelona
March 25, 2013 to March 28, 2013
ISBN: 978-1-4673-6239-9
pp: 1429-1435
H. Kredel , IT-Center, Univ. of Mannheim, Mannheim, Germany
ABSTRACT
Groebner bases, an important building block in computer algebra, are computed on distributed memory parallel computers with multi-CPU compute nodes with increasing success. Based on previous efforts we present and compare new programs using the MPI message passing standard implemented using MPJ. MPJ is a specification of MPI for Java with efficient implementations. Also the new versions use one control communication channel between the master node and the worker nodes. In the hybrid version the polynomials are shared between the threads on a node and in the pure distributed version the polynomials are replicated on every process. The polynomials are transported asynchronous to the control-flow of the algorithm in a separate distributed data structure. The implementation is generic and works for all implemented fields. We present first promising performance measurements.
INDEX TERMS
Polynomials, Java, Message systems, IP networks, Data structures, Servers, Computers,MPJ, Groebner bases, distributed computation, computer algebra, MPI
CITATION
H. Kredel, "Distributed Gröbner Bases Computation with MPJ", 2013 Workshops of 27th International Conference on Advanced Information Networking and Applications (WAINA), vol. 00, no. , pp. 1429-1435, 2013, doi:10.1109/WAINA.2013.101
87 ms
(Ver 3.3 (11022016))