Efficiency estimate for distributed computation of Gröbner bases and involutive bases
Denis A. Yanovich · Programming and Computer Software · 2008
Several years ago, we presented a program complex for parallel computation of Gröbner bases that works on computers with shared-memory architecture. Unfortunately, the number of the processors that we can use is small (from 2 to 16) because of hardware constraints. This paper presents a program for distributed computation of bases that relies on the same principles but works in a network consisting of heterogeneous machines. The effectiveness of such an approach is estimated from the standpoint of the processor capacity usage and the required network bandwidth, and methods optimizing usage of these resources are specified.