Some examples for solving systems of algebraic equations by calculating groebner bases
Journal of Symbolic Computation
The fuzzy barrier: a mechanism for high speed synchronization of processors
ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Fast barrier synchronization hardware
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Implementing an irregular application on a distributed memory multiprocessor
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Effects of Dynamic Task Distributions on the Performance of a Class of Irregular Computations
ICPP '97 Proceedings of the international Conference on Parallel Processing
| Hi-index | 0.00 |
A technique to improve performance on distributed memory machines of irregularly structured Grobner basis computations is developed. In parallel Grobner basis computation, at every step many tasks are executed in parallel by relating the dependencies present in sequential computation. In this relaxation approach, the idle time spent by processors at k/sup th/ step can be reduced by synchronizing p processors when r out of NT/sub k/(r/spl les/NT/sub k//spl les/p) tasks (instead of NT/sub k/) are complete. The analysis presented in this paper shows that, in theory, the improvement in speedup can be as much as lnp when the task distribution is close to exponential. In 70-75% of the experiments carried on IBM SP2 and Intel Paragon, this quasi-barrier technique improved speedup.