Efficient techniques for performing an irregular computation on distributed memory machines

DOI10.1080/00207729708929471zbMath0897.68005OpenAlexW2159815538MaRDI QIDQ4392348

Hemal V. Shah, José A. B. Fortes

Publication date: 4 August 1998

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729708929471

zbMATH Keywords

Gröbner basisdistributed memory machines

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Factorization (11Y05)

Cites Work

• Extended parallelism in the Gröbner basis algorithm
• A MIMD implementation of the Buchberger algorithm for Boolean polynomials
• Some examples for solving systems of algebraic equations by calculating Gröbner bases
• Parallel computation of Gröbner bases on distributed memory machines
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient techniques for performing an irregular computation on distributed memory machines