## Parallel Evaluation of Arithmetic Circuits (1996)

Venue: | Theoretical Computer Science |

Citations: | 2 - 0 self |

### BibTeX

@ARTICLE{Revol96parallelevaluation,

author = {Nathalie Revol and Jean-louis Roch},

title = {Parallel Evaluation of Arithmetic Circuits},

journal = {Theoretical Computer Science},

year = {1996},

pages = {162--133}

}

### OpenURL

### Abstract

this paper, a generic algorithm designed for the parallel evaluation of arithmetic circuits is given. This algorithm can be used in the domain of VLSI design, in order to get tight upper bounds on the computing time of a circuit. It can also be used in automatic parallelization of numerical programs, as a guide for the detection of some predefinite schemes such as dot-products or reductions. More generally, the (theoretical) algorithm presented in section 2 evaluates very quickly arithmetic straight-line programs, and its evaluation time serves as a good upper bound. This algorithm generalizes Miller, Ramachandran and Kaltofen's algorithm [18] in the sense it deals with a great variety of algebraic structures: semi-rings, rings or lattices. Our contribution resides on the one hand in a new bound for the evaluation of circuits over lattices, which improves previous results [19], and on the other hand in the unified formulation for the evaluation algorithm. This algorithm runs in

### Citations

826 | Matrix multiplication via arithmetic progressions - Coppersmith, Winograd - 1990 |

665 |
An Introduction to Parallel Algorithms
- Jájá
- 1992
(Show Context)
Citation Context ...ma 1 d min (y (i) i ) = d min (y (i\Gamma1) i ) Thus, algorithm 1 evaluates the insertion sort circuit in logarithmic time on a CRCW \Gamma PRAM . The parallel complexity of the best known algorithms =-=[12]-=- for this problem is thus automatically predicted, using a simple and a priori not highly parallel algorithm. 4.3 A P-complete boolean circuit A problem of particular interest is the lexicographic max... |

388 | Gaussian elimination is not optimal - Strassen |

218 |
A Taxonomy of Problems with Fast Parallel Algorithms
- Cook
(Show Context)
Citation Context ... fact a particular application. The term of "circuit" will be used in a more general meaning than the VLSI one; actually the parallel complexity theory is based on the notion of -- uniform -=-=- boolean [2,7,21]-=- and arithmetic [9] circuits, also called straight-line programs. We present in this paper a generic algorithm for the parallel evaluation of arithmetic circuits when the underlying algebraic structur... |

191 | A regular layout for parallel adders
- Brent, Kung
- 1982
(Show Context)
Citation Context ...on T with reasonable A; for instance, we derive automatically a logarithmic time bound from the boolean equations modeling the addition of two n-bit integers, and it is well-known that Brent and Kung =-=[3]-=- have proposed an adder with logarithmic time and small (linear) area. (This formed a test case for our work). Another apparent weakness of our result is that it gives asymptotic bounds on T . However... |

152 |
On uniform circuit complexity
- Ruzzo
- 1981
(Show Context)
Citation Context ... fact a particular application. The term of "circuit" will be used in a more general meaning than the VLSI one; actually the parallel complexity theory is based on the notion of -- uniform -=-=- boolean [2,7,21]-=- and arithmetic [9] circuits, also called straight-line programs. We present in this paper a generic algorithm for the parallel evaluation of arithmetic circuits when the underlying algebraic structur... |

120 |
Parallel Tree Contraction and its Application
- Miller, Reif
- 1985
(Show Context)
Citation Context ...rmula where every variable and every intermediate result can serve only once as an operand. It can be represented as a tree, and optimal algorithms exist with a EREW S ( n log n ; log n) complexity 1 =-=[1,4,10,15,17]-=-, where n is the number of nodes in this tree. Note that this problem is NC 1 -complete [14]. The evaluation of an arithmetic circuit with operations in a commutative semirings(SR; +; \Theta; 0; 1) ca... |

97 | On relating time and space to size and depth
- Borodin
- 1977
(Show Context)
Citation Context ... fact a particular application. The term of "circuit" will be used in a more general meaning than the VLSI one; actually the parallel complexity theory is based on the notion of -- uniform -=-=- boolean [2,7,21]-=- and arithmetic [9] circuits, also called straight-line programs. We present in this paper a generic algorithm for the parallel evaluation of arithmetic circuits when the underlying algebraic structur... |

87 |
A Simple Parallel Tree Contraction Algorithm
- Abrahamson, Dadoun, et al.
- 1989
(Show Context)
Citation Context ...rmula where every variable and every intermediate result can serve only once as an operand. It can be represented as a tree, and optimal algorithms exist with a EREW S ( n log n ; log n) complexity 1 =-=[1,4,10,15,17]-=-, where n is the number of nodes in this tree. Note that this problem is NC 1 -complete [14]. The evaluation of an arithmetic circuit with operations in a commutative semirings(SR; +; \Theta; 0; 1) ca... |

73 | Vermiedung von Divisionen - Strassen - 1973 |

59 |
Approximate and exact parallel scheduling with applications to list, tree, and graph problems
- Cole, Vishkin
- 1986
(Show Context)
Citation Context ...rmula where every variable and every intermediate result can serve only once as an operand. It can be represented as a tree, and optimal algorithms exist with a EREW S ( n log n ; log n) complexity 1 =-=[1,4,10,15,17]-=-, where n is the number of nodes in this tree. Note that this problem is NC 1 -complete [14]. The evaluation of an arithmetic circuit with operations in a commutative semirings(SR; +; \Theta; 0; 1) ca... |

52 | Greatest common divisors of polynomials given by straight-line programs - Kaltofen - 1988 |

50 |
The monotone and planar circuit value problems are log space complete for P
- Goldschlager
- 1977
(Show Context)
Citation Context ... indeed, there is no trick using the actual values of the inputs in the algorithm; thus, the number of steps is the same, whatever the inputs are. The addition requires the NOT operator. Goldschlager =-=[11]-=- has proven that a boolean circuit with NOT gates can be transformed into a monotone boolean circuit (without NOT gates). In fact we did not use this transformation; instead, we slightly modified the ... |

49 |
Optimal parallel evaluation of tree-structured computations by raking
- Kosaraju, Delcher
- 1988
(Show Context)
Citation Context |

47 | Approximate parallel scheduling, part i: the basic technique with applications to optimal parallel list ranking in logarithmic time - Cole, Vishkin |

33 |
Towards a Complexity Theory of Synchronous Parallel Systems. LEnseignement Nfathematique, Reveu Internationale, Geneva
- Cook
- 1981
(Show Context)
Citation Context ...means that it produces automatically an adder equivalent to Brent and Kung's adder [3]. Lastly, the limits of our algorithm are given: for the P-complete lexicographic maximal independent set problem =-=[6]-=-, it evaluates the corresponding circuit in linear parallel time. Since the evaluation algorithm gives satisfying results on these problems, some real applications are considered as future work. 2 Alg... |

32 | Efficient parallel evaluation of straight-line code and arithmetic circuits
- Miller, Ramachandran, et al.
(Show Context)
Citation Context ...d in section 2 evaluates very quickly arithmetic straight-line programs, and its evaluation time serves as a good upper bound. This algorithm generalizes Miller, Ramachandran and Kaltofen's algorithm =-=[18]-=- in the sense it deals with a great variety of algebraic structures: semi-rings, rings or lattices. Our contribution resides on the one hand in a new bound for the evaluation of circuits over lattices... |

22 |
Optimal parallel algorithm for dynamic expression evaluation and context-free recognition
- Gibbons, Rytter
- 1989
(Show Context)
Citation Context |

4 |
Dynamic parallel complexity of computational circuits
- Miller, S
- 1987
(Show Context)
Citation Context ...t variety of algebraic structures: semi-rings, rings or lattices. Our contribution resides on the one hand in a new bound for the evaluation of circuits over lattices, which improves previous results =-=[19], and on t-=-he other hand in the unified formulation for the evaluation algorithm. This algorithm runs in O(min(log n + log d) log n; (h a + log n) log n)) parallel time, d being the "algebraic degree" ... |

3 |
Boolean circuits versus arithmetic circuits
- Gathen, Seroussi
- 1991
(Show Context)
Citation Context ...cation. The term of "circuit" will be used in a more general meaning than the VLSI one; actually the parallel complexity theory is based on the notion of -- uniform -- boolean [2,7,21] and a=-=rithmetic [9]-=- circuits, also called straight-line programs. We present in this paper a generic algorithm for the parallel evaluation of arithmetic circuits when the underlying algebraic structure is commutative an... |

1 |
Handbook of Theoretical Computer
- Karp, Ramachandran
- 1990
(Show Context)
Citation Context ...represented as a tree, and optimal algorithms exist with a EREW S ( n log n ; log n) complexity 1 [1,4,10,15,17], where n is the number of nodes in this tree. Note that this problem is NC 1 -complete =-=[14]-=-. The evaluation of an arithmetic circuit with operations in a commutative semirings(SR; +; \Theta; 0; 1) can be done by Miller, Ramachandran and Kaltofen's algorithm 2 [18]. It has a complexity of CR... |

1 |
Handbook of Theoretical Computer
- Lengauer
- 1990
(Show Context)
Citation Context .... Our works allows one to derive tight upper bounds on the computation time of a multi-valued boolean function. Actually, in order to measure the quality of a VLSI circuit, two measures are used (cf. =-=[16]-=-): the first one is A, the area of the chip surface that is taken up by the electronic components devoted to the considered computation; the second one is the time, T , which represents the number of ... |

1 |
Complexit'e de l"evaluation parall`ele de circuits arithm'etiques
- Revol
- 1994
(Show Context)
Citation Context ...log 2 x + 2 Fig. 4. Experimental results for the addition. The same results (logarithmic time, small constants) occur when the boolean circuit for the multiplication of two n-bit numbers is evaluated =-=[20]-=-. To obtain these results, only one test with arbitrary inputs has been done, in order to determine the number of steps needed to compute the result; indeed, there is no trick using the actual values ... |