Name
Abstract | ||
|---|---|---|
In this paper we present an O(logn) parallel algorithm for the problem of generating optimum code for arithmetic expressions. The model of computation we use is the EREW P-RAM. The algorithm illustrates two general methods for the parallel manipulation of data stored in binary trees. The first (Compression Tree Method) extends the Parallel tree contraction method of Miller and Reif to the EREW P-RAM. The second is a modification of the Euler Path method. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1007/3-540-16766-8_18 | Aegean Workshop on Computing |
Keywords | Field | DocType |
parallel tree techniques,code optimization,parallel tree technique,parallel manipulator,model of computation,binary tree,parallel algorithm | Program optimization,Parallel algorithm,Computer science,Parallel computing,Binary tree,Eulerian path,Model of computation,Function tree,Arithmetic expressions,Binary expression tree | Conference |
ISBN | Citations | PageRank |
0-387-16766-8 | 0 | 0.34 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| E Dekel | 1 | 0 | 0.68 |
| S T Peng | 2 | 0 | 0.68 |
| Simeon C. Ntafos | 3 | 599 | 98.18 |