Feasible time-optimal algorithms for boolean functions on exclusive-write parallel random-access machines

SIAM Journal on Computing

Volumn 25, Issue 6, 1996, Pages 1196-1230

  Dietzfelbinger, Martin ^a   Kutyłowski, Mirosław ^b   Reischuk, Rüdiger ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

^c UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Addition; Boolean circuits; Boolean formulas; Boolean functions; Concurrent read; Exclusive read; Exclusive write; Parallel prefix; Parallel random access machine; Parallel time complexity; Parity; Sorting; Symmetric functions

Indexed keywords

EID: 0013458027     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539791224285     Document Type: Article

References (33)

1. M. AJTAI, J. KOMLÓS, AND E. SZEMERÉDI, Sorting in clog n parallel steps, Combinatorica, 3 (1983), pp. 1-19.
2. P. BEAME AND J. HÅSTAD, Optimal bounds for decision problems on the CRCW PRAM, J. Assoc. Comput. Mach., 36 (1989), pp. 643-670.
3. P. BEAME, M. KIK, AND M. KUTYŁOWSKI, Information broadcasting by exclusive-read PRAMs, Parallel Process. Lett., 4 (1994), pp. 159-169.
4. S. J. BELLANTONI, Parallel random access machines with bounded memory wordsize, Inform. and Comput., 91 (1991), pp. 259-273.
5. R. P. BRENT, The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Mach., 21 (1974), pp. 201-208.
6. J. BRUCK, Harmonic analysis of polynomial threshold functions, SIAM J. Discrete Math., 3 (1990), pp. 168-177.
7. S. BUBLITZ, U. SCHÜRFELD, B. VOIGT, AND I. WEGENER, Properties of complexity measures for PRAMs and WRAMs, Theoret. Comput. Sci., 48 (1986), pp. 53-73.
8. R. COLE, Parallel merge sort, SIAM J. Comput., 17 (1988), pp. 770-785.
9. S. COOK, C. DWORK, AND R. REISCHUK, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput., 15 (1986), pp. 87-97.
10. A. CHANDRA, S. FORTUNE, AND R. LIPTON, Unbounded fan-in circuits and associative functions, J. Comput. System Sci., 30 (1985), pp. 222-234.
11. M. DIETZFELBINGER, M. KUTYŁOWSKI, AND R. REISCHUK, Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes, in Proc. 2nd ACM Symposium on Parallel Algorithms and Architectures, Association for Computing Machinery, New York, 1990, pp. 125-135.
12. _, Exact lower bounds for computing Boolean functions on CREW PRAMs, J. Comput. System Sci., 48 (1994), pp. 231-254.
13. F. FICH, New bounds for parallel prefix circuits, in Proc. 15th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1983, pp. 100-109.
14. F. FICH AND A. WIGDERSON, Towards understanding exclusive write, SIAM J. Comput., 19 (1990), pp. 718-727.
15. R. M. KARP AND V. RAMACHANDRAN, Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 869-941.
16. M. KUTYŁOWSKI, Fast algorithms for threshold functions on CREW PRAMs, Technical Report, University of Wrocław, Wrocław, Poland, 1991.
17. _, Time complexity of Boolean functions on CREW PRAMs, SIAM J. Comput., 20 (1991), pp. 824-833.
18. M. KUTYŁOWSKI AND R. REISCHUK, Evaluating formulas on parallel machines without simultaneous writes, Technical Report, Institut für Theoretische Informatik, Technische Hochschule Darmstadt, Darmstadt, Germany, 1990.
19. R. E. LADNER AND M. J. FISCHER, Parallel prefix computation, J. Assoc. Comput. Mach., 27 (1980), pp. 831-838.
20. K. LANGE, Unambiguity of circuits, Theoret. Comput. Sci., 107 (1993), pp. 77-94.
21. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, San Mateo, CA, 1991.
22. N. NISAN, CREW PRAMs and decision trees, SIAM J. Comput., 20 (1991), pp. 999-1007.
23. N. NISAN AND M. SZEGEDY, On the degree of Boolean functions as real polynomials, Comput. Complexity, 4 (1994), pp. 301-313.
24. I. PARBERRY AND P. Y. YAN, Improved upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput., 20 (1991), pp. 88-99.
25. M. PATERSON, Improved sorting networks with O(log n) depth, Algorithmica, 5 (1990), pp. 75-92.
26. J. H. REIF, ED., Synthesis of Parallel Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1993.
27. R. SMOLENSKY, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in Proc. 19th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1987, pp. 77-82.
28. M. SNIR, On parallel searching, SIAM J. Comput., 14 (1985), pp. 688-708.
29. L. STOCKMEYER AND U. VISHKIN, Simulation of parallel random access machines by circuits, SIAM J. Comput., 13 (1984), pp. 402-422.
30. M. SZEGEDY, Algebraic Methods in Lower Bounds for Computational Models with Limited Communication, Ph.D. thesis, Department of Computer Science, University of Chicago, Chicago, 1989.
31. U. VISHKIN AND A. WIGDERSON, Trade-offs between depth and width in parallel computation, SIAM J. Comput., 14 (1985), pp. 303-314.
32. C. S. WALLACE, A suggestion for a fast multiplier, IEEE Trans. Comput., 13 (1964), pp. 14-17.
33. I. WEGENER, The Complexity of Boolean Functions, Wiley-Teubner, Stuttgart, 1987.