Data independence of read, write, and control structures in PRAM computations

Journal of Computer and System Sciences

Volumn 60, Issue 1, 2000, Pages 109-144

  Lange, Klaus Jörn ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER CIRCUITS; CONTEXT FREE LANGUAGES; DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SYSTEMS ANALYSIS; THEOREM PROVING; TURING MACHINES;

COMMUNICATION STRUCTURES; CONTROL STRUCTURES; DATA INDEPENDENCE; PARALLEL RANDOM ACCESS MACHINES;

COMPUTER SYSTEMS;

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

References (69)

1. F. Abolhassan, R. Drefenstedt, J. Keller, W. J. Paul, and D. Scheerer, On the physical design of PRAMs, Comput. J. 36 (1993), 756-762.
2. A. Aggarwal, A. K. Chandra, and M. Snir, On communication latency in PRAM computations, in "Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures," pp. 11-21, 1989.
3. A. Aggarwal, A. K. Chandra, and M. Snir, Communication complexity of PRAMs, Theoret. Comput. Sci. 71 (1990), 3-28.
4. S. G. Akl, On the power of concurrent memory access, in "Comput. and Inform.," pp. 49-55, 1989.
5. G. S. Almasi and A. Gottlieb, "Highly Parallel Computing," 2nd ed., Benjamin-Cummings, Redwood City, CA, 1994.
6. R. J. Anderson and G. L. Miller, Deterministic parallel list ranking, Algorithmica 6 (1991), 859-868.
7. J. Balcázar, J. Díaz, and J. Gabarró, "Structural Complexity Theory II," Springer-Verlag, Berlin/New York, 1990.
8. J. Balcázar, J. Díaz, and J. Gabarró, "Structural Complexity Theory I," 2nd ed., Springer-Verlag, Berlin/New York, 1995.
9. G. Bilardi and F. P. Preparata, Horizons of parallel computation, J. Parallel Distrib. Comput. 27 (1995), 172-182.
10. D. P. Bovet and P. Crescenzi, "Introduction to the Theory of Complexity," Prentice-Hall, New York, 1994.
11. S. R. Buss, The Boolean formula problem is in ALOGTIME, in "Proceedings of the 19th ACM Symposium on Theory of Computing," pp. 123-131, 1987.
12. A. Chin, Complexity models for all-purpose parallel computation, in "Lectures on Parallel Computation," Cambridge International Series on Parallel Computation, Chap. 14, pp. 393-404, Cambridge Univ. Press, Cambridge, MA, 1993.
13. R. Cole and U. Vishkin, Approximate parallel scheduling, Part i: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput. 17 (1988), 128-142.
14. S. A. Cook, Characterizations of pushdown machines in terms of time-bounded computers, J. Assoc. Comput. Mach. 18 (1971), 4-18.
15. S. A. Cook, Towards a complexity theory of synchronous parallel computation, Enseign. Math. 27 (1981), 99-124.
16. S. A. Cook, A taxonomy of problems with fast parallel algorithms, Inform. and Control 64 (1985), 2-22.
17. 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 (1986), 87-97.
18. S. A. Cook and P. W. Dymond, Parallel pointer machines, Comput. Complexity 3 (1993), 19-30.
19. D. E. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, LogP: A practical model of parallel computation, Commun. Accos. Comput. Mach. 39(11) (1996), 78-85.
20. C. Damm, M. Holzer, and P. Rossmanith, Expressing uniformity via oracles, Theory Comput. Systems 30 (1997), 355-366.
21. P. de la Torre and C. P. Kruskal, Towards a single model of efficient computation in real parallel machines, Future Generation Comput. Systems 8 (1992), 395-408.
22. P. W. Dymond and S. A. Cook, Hardware complexity and parallel computation, in "Proceedings of the 21st IEEE Conference on Foundations of Computer Science," pp. 360-372, 1980.
23. P. W. Dymond, F. E. Fich, N. Nishimura, P. Ragde, and W. L. Ruzzo, Pointers versus arithmetic in PRAMs, J. Comput. System Sci. 53 (1996), 218-232.
24. P. W. Dymond and W. L. Ruzzo, Parallel RAMs with owned global memory and deterministic language recognition, in "Proceedings of the 13th International Conference on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 226, pp. 95-104, Springer-Verlag, 1986.
25. H. Fernau, K.-J. Lange, and K. Reinhardt, Advocating ownership, in "Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science, India, Dec. 1996," Vol. 118, pp. 286-297, Springer-Verlag, Berlin, 1996.
26. S. Fortune and J. Wyllie, Parallelism in random access machines, in "Proceedings of the 10th ACM Symposium on Theory of Computing," pp. 114-118, Assoc. Comput. Mach., New York, 1978.
27. A. Gibbons and P. Spirakis, Eds., "Lectures on Parallel Computation," Cambridge International Series on Parallel Computation, Cambridge University Press, Cambridge, UK, 1993.
28. L. M. Goldschlager, A unified approach to models of synchronous parallel machines, in "Proceedings of the 10th ACM Symposium on Theory of Computing," pp. 89-94, Assoc. Comput. Mach., New York, 1978.
29. D. Gomm, M. Heckner, K.-J. Lange, and G. Riedle, On the design of parallel programs for machines with distributed memory, in "Proceedings of the 2nd European Conference on Distributed Memory Computing Munich, Federal Republic of Germany, April 1991" (A. Bode, Ed.), Lecture Notes in Computer Science, Vol. 48, pp. 381-391, Springer-verlag, Berlin, 1991.
30. E. Grandjean, Linear time algorithms and NP-complete problems, in "6th Workshop on Computer Science Logic," Lecture Notes in Computer Science, Vol. 742, pp. 248-273, Springer-Verlag, Berlin, 1992.
31. T. J. Harris, A survey of PRAM simulation techniques, Assoc. Comput. Mach. Comput. Surveys 26 (1994), 187-206.
32. T. Heywood and C. Leopold, Models of parallelism, in "Abstract Machine Models for Highly Parallel Computers" (J. R. Davy and P. M. Dew, Eds.), Chap. 1, pp. 1-16, Oxford University Press, Oxford, 1995.
33. T. Heywood and S. Ranka, A practical hierarchical model of parallel computation: I. The model, J. Parallel Distrib. Comput. 16 (1992), 212-232.
34. J.-W. Hong, On similarity and duality of computation, Inform. and Control 62 (1984), 109-128.
35. J. E. Hopfcroft and J. D. Ullman, "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA, 1979.
36. J. JáJá, "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA, 1992.
37. D. S. Johnson, A catalog of complexity classes, in "Algorithms and complexity" (J. van Leeuwen, Ed.), Handbook of Theoretical Computer Science, Vol. A, Chap. 2, pp. 67-161, Elsevier, Amsterdam, 1990.
38. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in "Algorithms and Complexity" (J. van Leeuwen, Ed.), Handbook of Theoretical Computer Science, Vol. A, pp. 869-941, Elsevier, Amsterdam, 1990.
39. C. P. Kruskal, L. Rudolph, and M. Snir, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci. 71 (1990), 95-132.
40. T. W. Lam and W. L. Ruzzo, The power of parallel pointer manipulation, in "Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures," pp. 92-102, 1989.
41. K.-J. Lange, Unambiguity of circuits, Theoret. Comput. Sci. 107 (1993), 77-94.
42. K.-J. Lange and P. Rossmanith, Unambiguous polynomial hierarchies and exponential size, in "Proceedings of the 9th IEEE Symposium on Structure in Complexity," pp. 106-115, 1994.
43. C. E. Leiserson and B. M. Maggs, Communication-efficient parallel algorithms for distributed random-access machines, Algorithmica 3 (1988), 53-77.
44. T. G. Lewis and H. El-Rewini, "Introduction to Parallel Computing," Prentice-Hall, New York, 1992.
45. W. F. McColl, General purpose parallel computing, in "Lectures on Parallel Computations" (A. Gibbons, and P. Spirakis, Eds.), Cambridge International Series on Parallel Computation, Chap. 13, pp. 337-391, Cambridge University Press, Cambridge, 1993.
46. A. V. Naik, K. W. Regan, and D. Sivakumar, Quasilinear time complexity theory, in "Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science" (P. Enjalbert, E. W. Mayr, and K. W. Wagner, Eds.), Lecture Notes in Computer Science, Vol. 775, pp. 97-108, Springer-Verlag, Berlin, 1994.
47. R. Niedermeier and P. Rossmanith, Unambiguous auxiliary pushdown, automata and semi-unbounded fan-in circuits, Inform. and Comput. 118 (1995), 227-245.
48. I. Niepel and P. Rossmanith, Uniform circuits and exclusive read PRAMs, in "Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, Dec. 1991" (S. Biswas and K. V. Nori, Eds.), Lecture Notes in Computer Science, Vol. 560, pp. 307-318, Springer-Verlag, Berlin, 1991.
49. C. H. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
50. I. Parberry, "Parallel Complexity Theory," Pitman, London, 1987.
51. A. G. Ranade, How to emulate shared memory, J. Comput. Systems Sci. 42 (1991), 307-326.
52. k, in "Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science" (P. Enjalbert, E. W. Mayr, and K. W. Wagner, Eds.), Lecture Notes in Computer Science, Vol. 775, pp. 289-300, Springer-Verlag, Berlin, 1994.
53. J. H. Reif, "Synthesis of Parallel Algorithms," Morgan Kaufman, San Mateo, CA, 1993.
54. P. Rossmanith, The owner concept for PRAMs, in "Proceedings of the 8th Symposium on Theoretical Aspects of Computer Science Hamburg, Federal Republic of Germany, Feb. 1991" (C. Choffrut and M. Jantzen, Eds.), Lecture Notes in Computer Science, Vol. 480, pp. 172-183, Springer-Verlag, Berlin, 1991.
55. W. L. Ruzzo, On uniform circuit complexity, J. Comput. Systems Sci. 22 (1981), 365-383.
56. C. P. Schnorr, Satisfiability is quasilinear complete in NQL, J. Assoc. Comput. Mach. 25 (1978), 136-145.
57. H. J. Siegel, S. Abraham, W. L. Batcher, T. L. Casavant, D. DeGroot, J. B. Dennis, D. C. Douglas, T.-Y. Feng, J. R. Goodman, A. Huang, H. F. Jordan, J. R. Jump, Y. N. Patt, A. J. Smith, J. E. Smith, L. Snyder, H. S. Stone, R. Tuck, and B. W. Wah, Report on the Purdue Workshop on Grand Challenges in computer architecture for the support of high performance computing, J. Parallel Distrib. Comput. 16 (1992), 199-211.
58. M. Snir, Scalable parallel computers and scalable parallel codes: From theory to practice, in "Proceedings of the 1st Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use, Paderborn, Federal Republic of Germany, 1993" (F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds.), Lecture Notes in Computer Science, Vol. 678, pp. 176-184, Springer-Verlag, Berlin, 1993.
59. L. Stockmeyer and U. Vishkin, Simulation of parallel random access machines by circuits, SIAM J. Comput. 13 (1984), 409-422.
60. I. H. Sudborough, On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach. 25 (1978), 405-414.
61. L. G. Valiant, A bridging model for parallel computation, Commun. Assoc. Comput. Mach. 33 (1990), 103-111.
62. L. G. Valiant, General purpose parallel architectures, in "Algorithms and Complexity" (J. van Leeuwen, Eds.), Handbook of Theoretical Computer Science, Vol. A, Chap. 18, pp. 943-971, Elsevier, Amsterdam, 1990.
63. J. van Leeuwen, Ed., "Algorithms and Complexity," Handbook of Theoretical Computer Science, Vol. A, Elsevier, Amsterdam, 1990.
64. H. Venkateswaran, Properties that characterize LOGCFL, J. Comput. Systems Sci. 43 (1991), 380-404.
65. U. Vishkin, Preliminary announcement of workshop on "Suggesting Computer Science Agenda(s) for High-Performance Computing," Communicated by e-mail on TheoryNet, January 1994.
66. U. Vishkin and A. Wigderson, Dynamic parallel memories, Inform. and Control 56 (1983), 174-182.
67. P. Vitaśnyi, Locality, communication, and interconnect length in multicomputers, SIAM J. Comput. 17 (1988), 659-672.
68. J. S. Vitter and R. A. Simons, New classes for parallel complexity: A study of unification and other complete problems for P, IEEE Trans. Comput. 35 (1986), 403-418.
69. K. W. Wagner and G. Wechsung, "Computational Complexity," Reidel, Reidel, Dordrecht and VEB, Berlin, 1986.