R. E. Ladner and M. J. Fischer, Parallel prefix computation, JACM 27, No. 4 (1980), 831--838. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Efficient Integer Multiplication Overflow Detection Circuits - Mustafa Gok Michael (Correct)
....AND AND a a 1 4 a a u b b b A b A b A b A 5 3 2 5 6 7 7 1 6 A 3 4 4 3 5 6 7 1 Figure 1: Unsigned 8 bit Overflow Detection Circuit. where A i = k=i a k is computed using parallel prefix methods. The theory of parallel prefix computation methods have been well developed over the years, [4], 5] 6] 7] 8] but have not yet been applied to overflow detection in parallel multipliers. Our overflow detection circuits use the Brent Kung algorithm [7] to implement the parallel prefix circuit, since it has O(n) gates, while most other parallel prefix algorithms have O(n log(n) gates. ....
R. E. Ladner and M. J. Fischer, "Parallel Prefix Computation," Journal of the Association for Computing Machinery, vol. 27, pp. 831--838, October 1980.
Asynchronous Parallel Prefix Computation - Rajit Manohar Department (1998) (Correct)
....circuits over their synchronous counterparts to reduce the average case latency of the prefix computation. Let Omega be an associative operation. The prefix problem is to compute, given x 1 ; x 2 ; x n , the results y 1 ; y 2 ; y n , where y k = x x k , for 1 k n [6]. The prefix problem can be used to solve a number of problems efficiently. Ladner and Fisher show how the prefix problem can be used to parallelize the computation of an arbitrary Mealy machine [6] Leighton discusses a number of different problems that can be solved using prefix computations ....
....1 ; x 2 ; x n , the results y 1 ; y 2 ; y n , where y k = x x k , for 1 k n [6] The prefix problem can be used to solve a number of problems efficiently. Ladner and Fisher show how the prefix problem can be used to parallelize the computation of an arbitrary Mealy machine [6]. Leighton discusses a number of different problems that can be solved using prefix computations [7] As a concrete application, we use the method presented in this paper to construct an asynchronous adder with an averagecase latency of O(log log n) steps. A variety of synchronous solutions to ....
[Article contains additional citation context not shown here]
Richard E. Ladner and Michael J. Fischer. Parallel Prefix Computation. Journal of the Association for Computing Machinery , 27(4):831--838, October 1980.
On Dynamic Algorithms for Algebraic Problems - John Reif Department (Correct)
No context found.
R. E. Ladner and M. J. Fischer, Parallel prefix computation, JACM 27, No. 4 (1980), 831--838.
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
No context found.
R. E. LADNER AND M. J. FISCHER, Parallel prefix computation, J. ACM, 27 (1980), pp. 831--838.
Bit 30:268-288, 1990 - Parallel Method For (Correct)
No context found.
R. LADNER AND M. FISCHER, Parallel prefix computation, J. Assoc. Comput. Mach., 27 (October 1980), pp. 831--838.
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
No context found.
R. Ladner and M. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831--838, 1980.
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
No context found.
R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4), pages 831--838, 1980.
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
No context found.
R.E. Ladner and M.J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831-- 838, 1980.
Data Parallel Computation on Graphics Hardware - Ian Buck Pat (2003) (3 citations) (Correct)
No context found.
Ladner, R. E., and Fischer, M. J. 1980. Parallel prefix computation.
The Owner Concept for PRAMs - Peter Rossmanith Technische (1991) (9 citations) (Correct)
No context found.
R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM, 27:831--838, 1980.
Upper Bounds on the Computational Power of an Optical Model of.. - Woods (2005) (Correct)
No context found.
R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831--838, 1980.
Computational Complexity of an Optical Model of Computation - Woods (2005) (Correct)
No context found.
Richard E. Ladner and Michael J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831--838, 1980.
A Parallel Method for Fast and Practical High-Order.. - Egecioglu.. (1989) (Correct)
No context found.
R. LADNER AND M. FISCHER, Parallel prefix computation, J. Assoc. Comput. Mach., 27 (October 1980), pp. 831--838.
Conservative Algorithms for Parallel and Sequential Integer.. - Han, Shen (1995) (Correct)
No context found.
R. E. Ladner and M. J. Fischer. Parallel prefix computation. J. ACM, pp. 831-838(Oct. 1980).
Parallel Algorithms for Bucket Sorting and the Data Dependent.. - Wagner, Han (1986) (5 citations) (Correct)
No context found.
. R.E. Ladner and M.J. Fischer. Parallel prefix computation. J. ACM, Oct. 1980, pp. 831-838.
High Performance Code Generation through Lazy Activation.. - Satpathy Mahapatra.. (Correct)
No context found.
Ladner R.E., Fischer J., Parallel Prefix Computation, Journal of the ACM, Vol. 27(4), 1980, pp. 831--837.
Parallel Tree Contraction' - Part Fundamentals Gary (Correct)
No context found.
Richard E. Ladner and Michael J. Fisher, Parallel prefix computation, J. Assoc. Computing Mach. 831-838 (October 1980).
VLSI Digital Signal Processing: Some Arithmetic Issues - Jullien (1996) (Correct)
No context found.
Ladner, R. E., and Fischer, M. J., "Parallel prefix computation", J. ACM, vol. 27, pp. 831-838, 1980.
Optimized Synthesis of Sum-of-Products - Zimmermann, Tran (2003) (Correct)
No context found.
R. E. Ladner and M. J. Fischer, "Parallel Prefix Computation," J. ACM, vol. 27, no. 4, pp. 831--838, Oct. 1980.
Randomized Parallel Computation - Rajasekaran, Reif (Correct)
No context found.
Ladner,R.E., and Fischer,M.J., "Parallel Prefix Computation," Journal of the ACM, 27(4), 1980, pp.831-838.
A Regular Layout for Parallel Adders - Brent, Kung (1982) (75 citations) (Correct)
No context found.
R E Ladner and M J Fisher, "Parallel prefix computation", J Ass Comput Mach, vol 27, pp 831--838, October 1980.
An Algebra of Scans - Hinze (2004) (Correct)
No context found.
Ladner, R.E., Fischer, M.J.: Parallel prefix computation. Journal of the ACM 27 (1980) 831--838
Size and Access Inference for Data-Parallel Programs - Chatterjee (1990) (7 citations) (Correct)
No context found.
Richard E. Ladner and Michael J. Fischer. Parallel Prefix Computation. Journal of the ACM, 27(4):831-- 838, October 1980.
Solving Linear Recurrences with Loop Raking - Guy Blelloch School (1992) (2 citations) (Correct)
No context found.
R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the Association for Computing Machinery, 27(4):831--838, Oct. 1980.
Thinking in Parallel: Some Basic Data-Parallel Algorithms and.. - Vishkin (2002) (1 citation) (Correct)
No context found.
R.E. Ladner and M.J. Fischer. Parallel prefix computation. J. Assoc. Comput. Mach., 27:831--838, 1980.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC