Guy Blelloch and Bruce Maggs. Parallel algorithms. In Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton, Florida, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
One Flip per Clock Cycle - Henz, Tan, Yap (Correct)
....evaluation of the described approach. Possibly one which does not take advantage of the O(1) implementation of ipping given size assumptions on clause length and variable occurrences. 2 Notation In order to analyse the parallel complexity of GSAT algorithms, we adapt the notation used in [BM99] which in turn adopts central constructs of the parallel functional language NESL [BHSZ95] We adapt the work depth model of [BM99] so that we can asymptotically determine the two factors that determine the cost of running a program on an FPGA. The number of gates needed for running the program ....
....assumptions on clause length and variable occurrences. 2 Notation In order to analyse the parallel complexity of GSAT algorithms, we adapt the notation used in [BM99] which in turn adopts central constructs of the parallel functional language NESL [BHSZ95] We adapt the work depth model of [BM99] so that we can asymptotically determine the two factors that determine the cost of running a program on an FPGA. The number of gates needed for running the program P is denoted by g(P ) which re ects the total size of the FPGA. The depth of a program P is the number of time units required to ....
Guy Blelloch and Bruce Maggs. Parallel algorithms. In Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton, Florida, 1999.
Some Parallel Nondeterministic Algorithms - Niculescu (2000) (Correct)
No context found.
G. E. Blelloch, B. M. Maggs , Parallel Algorithms, ACM Computing Surveys, Vol. 28, No. 1, March 1996, pg. 51-54.
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