Pointers versus arithmetic in PRAMs

Journal of Computer and System Sciences

Volumn 53, Issue 2, 1996, Pages 218-232

  Dymond, Patrick W ^a   Fich, Faith E ^b   Nishimura, Naomi ^c   Ragde, Prabhakar ^c   Ruzzo, Walter L ^d  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF WATERLOO   (Canada)

^d UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONTEXT FREE LANGUAGES; DATA STORAGE EQUIPMENT; DATA STRUCTURES; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

PARALLEL POINTER MACHINE; POINTERS;

COMPUTATION THEORY;

EID: 0030259218     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0063     Document Type: Article

References (28)

1. J. Archibald and J.-L. Baer, Cache coherence protocols: Evaluation using a multiprocessor simulation model, ACM Trans. Comput. Systems 4, No. 4 (1986), 273-298.
2. A. M. Ben-Amram and Z. Galil, On pointers versus addresses, J. Assoc. Comput. Mach. 39, No. 3 (1992), 617-648.
3. S. A. Cook, Towards a complexity theory of synchronous parallel computation, Enseign. Math. 27, Nos. 1-2 (1981), 99-124.
4. S. A. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15, No. 1 (1986), 87-97.
5. S. A. Cook and P. W. Dymond, Parallel pointer machines, Comput. Complexity 3, No. 1 (1993), 19-30.
6. P. W. Dymond, Indirect addressing and the time relationships of some models of sequential computation, Int. J. Comput. Math. Appl. 5 (1979), 195-209.
7. P. W. Dymond and S. A. Cook, Hardware complexity and parallel computation, in "IEEE 21st Annual Symposium on Foundations of Computer Science, Syracuse, NY, Oct. 1980," pp. 360-372.
8. P. W. Dymond, F. E. Fich, N. Nishimura, P. Ragde, and W. L. Ruzzo, Pointers versus arithmetic in PRAMs, in "Proceedings, IEEE Structure in Complexity Theory, Eighth Annual Conference, San Diego, CA, May 1993," pp. 239-252.
9. P. W. Dymond and W. L. Ruzzo, Parallel random access machines with owned global memory and deterministic context-free language recognition, in "Automata, Languages, and Programming: 13th International Colloquium, Rennes, France, July 1986" (L. Kott, Ed.), Lecture Notes in Computer Science, Vol. 226, pp. 95-104, Springer-Verlag, New York/Berlin, 1986.
10. D. Eppstein and Z. Galil, "Parallel Algorithmic Techniques for Combinatorial Computation," pp. 233-283, Annual Reviews in Computer Science, Annual Reviews, Palo Alto, CA, 1988.
11. F. E. Fich, The complexity of computation on the parallel random access machine, in "Synthesis of Parallel Algorithms" (J. H. Reif, Ed.), Chap. 20, pp. 843-899, Morgan Kaufmann, San Mateo, CA, 1993.
12. F. E. Fich, R. Impagliazzo, B. Kapron, V. King, and M. Kutyłowski, Limits on the power of parallel random access machines with weak forms of write conflict resolution, in "STACS 93: 10th Annual Symposium on Theoretical Aspects of Computer Science, Wurzburg, Germany, Feb. 1993" (A. Finkel, P. Enjalbert, and K. W. Wagner, Ed.), Lecture Notes in Computer Science, Vol. 665, pp. 386-397, Springer-Verlag, New York/Berlin, 1993.
13. F. E. Fich, P. Ragde, and A. Wigderson, Relations between concurrent-write models of parallel computation, SIAM J. Comput. 17 (1988), 606-627.
14. F. E. Fich and A. Wigderson, Towards understanding exclusive read, SIAM J. Comput. 19, No. 4 (1990), 717-727.
15. S. Fortune and J. C. Wyllie, Parallelism in random access machines, in "Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, CA, May 1978," pp. 114-118.
16. M. T. Goodrich and S. R. Kosaraju, Sorting on a parallel pointer machine with applications to set expression evaluation, in "30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, Oct. 1989," pp. 190-195 (Preliminary version).
17. T. Hagerup and T. Radzik, Every robust CRCW PRAM can efficiently simulate a Priority PRAM, in "Proceedings, 1990 ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece, July 1990," pp. 117-124.
18. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13, No. 2 (1984), 338-355.
19. 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.), Chap. 17, pp. 869-941, M.I.T. Press, Cambridge, MA/Elsevier, New York, 1990.
20. T. W. Lam and W. L. Ruzzo, The power of parallel pointer manipulation, in "Proceedings, 1989 ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, June 1989," pp. 92-102.
21. K.-J. Lange and R. Niedermeier, Data-independences of parallel random access machines, in "Foundations of Software Technology and Theoretical Computer Science, Thirteenth Conference, Bombay, India, Dec. 1993" (R. K. Shyamasundar, Ed.), Lecture Notes in Computer Science, pp. 104-113, Springer-Verlag, New York/Berlin, 1994.
22. D. Lin, X. Deng, and P. W. Dymond, Implementing Cole's parallel mergesort algorithm on owner-write parallel random access machines, Technical report, York University, Department of Computer Science, 1995.
23. "Logic and Algorithmic, an International Symposium Held in Honor of Ernst Specker, Zürich, Feb. 5-11, 1980," Enseign. Math., No. 30, Université de Genève, Geneva, 1982.
24. N. Nisan, CREW PRAMs and decision trees, SIAM J. Comput. 20, No. 6 (1991), 999-1007.
25. A. Schönhage, Storage modification machines, SIAM J. Comput. 9, No. 3 (1980), 490-508.
26. R. E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comput. System Sci. 18 (1979), 110-127.
27. J. T. Tromp and P. van Emde Boas, Associative storage modification machines, in "Complexity Theory: Current Research" (K. Ambos-Spies, S. Homer, and U. Schoning, Eds.), Cambridge Univ. Press, Cambridge, 1993.
28. L. G. Valiant, A bridging model for parallel computation, Comm. ACM 33, No. 8 (1990), 103-111.