✦ LIBER ✦

A MIMD implementation of the Buchberger Algorithm for Boolean polynomials

✍ Scribed by P. Senechaud

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 413 KB
Volume: 17
Category: Article
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(05)80014-6

No coin nor oath required. For personal study only.

✦ Synopsis

Senechaud, P_, A MIMD implementation of the Buchberger algorithm for Boolean polynomials, Parallel Computing 17 (1991) 29-37_

In this note we present two methods to compute GriSbner basis in parallel, both based on Buchberger's sequential algorithm. A distributed memory MIMD computer (the FPS T40) gives experimental results obtained with the Boolean polynomials_ The algorithms were implemented on the FPS T40 connected as a ring and as a hypercube of processors_ The first implementation shows the interest of the parallelization_ The second one, based on a divide and conquer strategy, has a behaviour very close to the sequential algorithm.

📜 SIMILAR VOLUMES

A generalized algorithm for the recursiv

A generalized algorithm for the recursive implementation of polynomial filters

✍ P. Agathoklis; H. Xu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 644 KB

Polynomial jilters have many applications in real time control, estimation and identification, particularly when information about the system dynamics and noise statistics are not precisely known. In this paper, a generalized recursive algorithm for nth order polynomial jilters is developed. The par

A velocity algorithm for the implementat

A velocity algorithm for the implementation of gain-scheduled controllers

✍ Isaac Kaminer; Antonio M. Pascoal; Pramod P. Khargonekar; Edward E. Coleman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 916 KB

new method is proposed to implement gain-scheduled controllers for nonlinear plants. Given a family of linear feedback controllers designed for linearizations of a nonlinear plant about constant operating points, a nonlinear gain-scheduled controller is derived that preserves the input-output proper

A dual rail circuits synthesis environme

A dual rail circuits synthesis environment for the implementation of multiple output boolean functions

✍ Karoubalis, Theodore; Alexiou, George Ph.; Kanopoulos, Nick 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

This paper presents an integrated CAD system for synthesizing high-performance dual rail circuits using DCVS logic. The proposed techniques exploit ROBDDs to provide efficient DCVS trees that fulfill the design rules and constraints. Sharing of common transistor structures is examined to decrease fu

Sorting algorithms for the implementatio

Sorting algorithms for the implementation of a generalized vector product

✍ Alberto Garcia-Diaz; Donald K. Friesen; Donald J. Bagert 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

The worst case behavior of a greedy algo

The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions

✍ M.R. Emamy-K. 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 162 KB

An algorithm for the divisors of monic p

An algorithm for the divisors of monic polynomials over a commutative ring

✍ Ihsen Yengui 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R0 ⊕ . . . ⊕ Rm (m ≤ deg f ), associated to a fundamental system of idempotents e0, . . . , em, such that the component of f in each