𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Parallel Implementation of Buchberger's Algorithm overZpforp ≤  31991

✍ Scribed by A.A. Reeves

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
391 KB
Volume
26
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

Gröbner bases of ideals of polynomials are known to have many applications. They have been applied to problems in commutative algebra, statistics, graph theory, robotics and differential equations. Their use as a research tool, however, is limited by their computational complexity. These two facts have inspired numerous attempts to parallelize Buchberger's algorithm to compute them.

In this paper, we describe a parallel implementation developed on the Cray T3D using the extensions to C provided by ac. The program is based on the publicly available package Macaulay which computes Gröbner bases of homogeneous ideals over Zp for primes p ≤ 31991. The efficiency is nearly 100% on up to 16 processors for moderately sized problems. Above 16 processors, the efficiency drops.

📜 SIMILAR VOLUMES

Robustness of 80 Gbit/s (4 × 2
Robustness of 80 Gbit/s (4 × 20 Gbit/s) Regenerated WDM Soliton Transoceanic Transmission to Practical System Implementation
✍ O Leclerc; E Desurvire; O Audouin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 126 KB

We analyze the robustness of a novel type of transoceanic WDM soliton system based on synchronous regeneration. The effect of uncertainty of regenerator and filter passband position in a 4 = 20 Gbit / s WDM system is studied numerically. The results indicate that practical implementation of synchron