Horizons of parallel computation

Journal of Parallel and Distributed Computing

Volumn 27, Issue 2, 1995, Pages 172-182

  Bilardi, Gianfranco ^a   Preparata, Franco P ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000445973     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1995.1080     Document Type: Article

References (48)

1. Aggrawal, A. Chandra, A. K., and Snir, M. A model for hierarchical memory. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 305-314.
2. Aggarwal, A., Chandra, A. K., and Snir, M. On communication latency in PRAM computation. Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 11-22.
3. Alt, H., Hagerup, T., Mehlhorn, K and Preparata, F. P. Simulation of idealized parallel computers on more realistic ones. SIAM J. Comput. 16, 5 (1987), 808-835.
4. Bay, P. E., and Bilardi, G. Deterministic on-line routing on area-universal networks. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 297-306.
5. Bay, P. E„ and Bilardi, G. An area-universal vlsi circuit. In Proceedings of the 1993 Symposium on Integrated Systems, Mar. 1993.
6. Bell, G. A teraflop before its time. Comm. ACM35, 8 (1992), 26-47.
7. Bennett, C. H., and Landauer, R. The fundamental physical limits of computation. Sci. Amer. (July 1985), 48-56.
8. Bhatt, S. N., and Leighton, F. T. A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, (1984), 300-342.
9. Bilardi, G. Some observations on models of parallel computation. In Sanz, J. L. C. (Ed.). Opportunities and Constraints of Parallel Computations. Springer-Verlag, Berlin/New York, 1989. pp. 11-13.
10. Bilardi, G., and Preparata, F. P. Area-time lower-bound techniques with application to sorting. Algorithmica 1 (1986), 65-91.
11. Bilardi, G., Pracchi, M., and Preparata, F. P. A critique of network speed in VLSI models of computation. IEEE J. Solid-State Circuits 17 (1982), 696-702.
12. Brent, R. P. The parallel evaluation of general arithmetic expressions. J. Assoc. Comput. Mach. 21, 2 (1974), 201-206.
13. Chazelle, B. and Monier, L. A model of computation for VLSI with related complexity results. J. Assoc. Comput. Mach. 32 (1985), 573-588.
14. Cook, S. A. An observation of time-storage tradeoff. J. Comput. Syst. Sci. 9 (1974), 308-316.
15. Cook, S. A. Towards a complexity theory of synchronous parallel computation. Enseign. Math. 27 (1981), 99-124.
16. Cook, S. A., and Reckhow, R. A. Time bounded random access machines. J. Comput. Syst. Sci. 7 (1973), 354-375.
17. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K. E., Santos, E., Subramonian, R., and Von Eicken, T. LogP: Towards a realistic model of parallel computation. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993.
18. Feldman, J., and Shapiro, E. Spatial machines: A more realistic approach to parallel computation. Comm. ACM 35, 10 (1992), 61-73.
19. Flynn, M. J. Very high-speed computing systems. Proc. IEEE 54, 12 (1966), 1901-1909.
20. Greenberg, R. I. The fat-pyramid: A robust network for parallel computation. In Dally, W. J. (Ed.). Advanced Research in VLSI: Proceedings of the Sixth MIT Conference, 1990, pp. 195-213.
21. Greenberg, R. I., and Leiserson, C. E. Randomized routing on fat-trees. In Micali, S. (Ed.). Randomness and Computation. JAI Press, London, 1989, pp. 345-374.
22. Herley, K., and Bilardi, G. Deterministic simulations of PRAMs on bounded-degree networks. In Proceedings of the 26th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, 1988, pp. 1084-1093.
23. Karlin, A., and Upfal, E. Parallel hashing—An efficient implementation of shared memory. J. Assoc. Comput. Mach. 35, 4 (1988), 876-892.
24. Karp, R. M., and Ramachandran, V. Parallel algorithms for shared-memory machines. In Leeuwen, J. V. (Ed.). Handbook of Theoretical Computer Science: Algorithms and Complexity. Elsevier/MIT Press, Amsterdam/New York/Cam-bridge, MA, 1990.
25. Kruskal, C. P., Rudolf, L., and Snir, M. A complexity theory of efficient parallel algorithms. Theoret. Comput. Sci. 71 (1990), 95-132.
26. Kung, H. T. Why systolic architectures? Comput. Mag. 15, 1 (1982), 37-46.
27. Ladner, R. E. The Circuit Value problem is logspace complete for P. SIGACT News 7, 1 (1975), 18-20.
28. Leighton, F. T. Layouts for the shuffle-exchange graph and lower bound techniques for VLSI. Ph.D. dissertation, Massachusetts Institute of Technology, Sept. 1981.
29. Leighton, F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1991.
30. Leiserson, C. E. Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. C-34, 10 (1985), 892-900.
31. Leiserson, C. E., Abuhamdeh, Z. S., Douglas, D. C., Feynman, C. R., Ganmukhi, M. N., Hill, J. V., Hillis, W. D., Kuszmaul, B. C., Pierre, M. A., Wells, D. S., Wong, M. C., Yang, S. W., and Zak, R. The network architecture of the Connection Machine. CM-5. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 272-285.
32. Leiserson, C. E., and Maggs, B. M. Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica 3 (1988), 53-77.
33. Mead, C., and Conway, L. Introduction to VLSI Systems. Addison-Wesley, Reading, MA, 1980.
34. Mehlhorn, K., and Vishkin, U. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Inform. 21, 4 (1984), 339-374.
35. Pease, M. C. The indirect binary n-cube microprocessor array. IEEE Trans. Comput. C-26, 5 (1977), 458-473.
36. Pippenger, N. On simultaneous resource bounds. In Proceedings of the 20th IEEE Symposium Foundation of Computer Science, 1979, pp. 307-311.
37. Preparata, F. P., and Vuillemin, J. The cube-connected cycles: A versatile network for parallel computation. Comm. Assoc. Comput. Mach. 24, 5 (1981), 300-309.
38. Ranade, A. G. How to emulate shared memory. Proceedings of the 28th Annual Symposium on the Foundations of Computer Science, 1987, pp. 185-192.
39. Rosenberg, A. L. Three-dimensional integrated circuitry. In Kung, H. T., Sproull, B., and Steele, G. (Eds.). Proceedings of the CMU Conference on VLSI Systems and Computations. Comput. Sci. Press, New York, 1981, pp. 69-80.
40. Smith, B. J. Architecture and applications of the HEP multiprocessor system. Signal Process. IV, 298 (1981), 241-248.
41. Snyder, L. Type architectures, shared memory, and the corollary of modest potential. Ann. Rev. Comput. Sci. 1 (1986), 289-317.
42. Thompson, C. D. A complexity theory for VLSI. Ph.D. dissertation, Carnegie-Mellon University, Aug. 1980.
43. Upfal, E., and Wigderson, A. How to share memory in a distributed system. J. Assoc. Comput. Mach. 34, 1 (1987), 116-127.
44. Valiant, L. G. Universality considerations in VLSI circuits. IEEE Trans. Comput. C-30, 2 (1981), 135-140.
45. Valiant, L. G. A bridging model for parallel computation. Comm. ACM 33, 8 (1990), 103-111.
46. Valiant, L. G. General purpose parallel architectures. In Leeuwen, J. V. (Ed.). Handbook for Theoretical Computer Science: Algorithms and Complexity. Elsevier/MIT Press, Amsterdam/New York/Cambridge, MA, 1990.
47. Vitanyi, P. M. B. Nonsequential computations and laws of nature, Aegean Workshop on Computing, Proceedings. In Makedon, F. (Ed.). VLSI Algorithms and Architecture. Lecture Notes in Computer Science, Voi. 227. Springer-Verlag, Berlin, 1986, pp. 108-120.
48. Vitanyi, P. M. B. Locality, communication, and interconnect length in multicomputers. SIAM J. Comput. 17, 4 (1988), 659-672.