Parallel alternating-direction access machine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 267-278

  Chlebus, Bogdan S ^a   Czumaj, Artur ^b   Gasieniec, Leszek ^a,c   Kowaluk, Mirostaw ^a   Plandowski, Wojciech ^a  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF PADERBORN   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

2-DIMENSIONAL ARRAYS; ALTERNATING DIRECTIONS; MEMORY MODULES; MULTIPROCESSOR COMPUTERS; PARALLEL COMPUTATION; PROTOTYPE ARCHITECTURE; SHARED MEMORY; THEORETICAL STUDY;

PARALLEL PROCESSING SYSTEMS;

EID: 84947911396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_154     Document Type: Conference Paper

References (12)

1. M. Dietzfelbinger and F. Meyer auf der Heide, Dynamic Hashing in Real Time, in Informatik: Festschrift zum 60. Geburtstag von Günter Hotz, ed. J. Buchmann, H. Ganzinger, and W. J. Paul, B. G. Teuber Verlagsgesellschaft, Leipzig, 1992, pp. 95-119.
2. A. Gibbons and W. Rytter, "Efficient Parallel Algorithms", Cambridge University Press, 1988.
3. K. Hwang, P.-S. Tseng, and D. Kim, On Orthogonal Multiprocessor for Parallel Scientific Computations, IEEE Transactions on Computers 38 (1989) 47-61.
4. J. JáJá, "An Introduction to Parallel Algorithms", Addison Wesley, Reading, MA, 1992.
5. H. Kadota, K, Kaneko, I. Okabayashi, T. Okamoto, T. Mimura, Y. Nakakura, A. Wakatani, M. Nakajima, J. Nishikawa, K. Zaiki, and T. Nogi, Parallel Computer ADENART - its Architecture and Application, in Proceedings of the 5th ACM International Conference on Supercomputing, 1991, pp, 1-8.
6. H. Kadota, K. Kaneko, Y. Tanikawa, and T. Nogi, VLSI Parallel Computer with Data Transfer Network: ADENA, in Proceedings of the International Conference on Parallel Processing, Vol. I, 1989, pp. 319-322.
7. R. M. Karp and V. Ramachandran, Parallel Algorithms for Shared-Memory Machines, in "Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity", ed. J. van Leeuwen, Elsevier Science Publishers, 1990, pp. 870-941.
8. C. P. Kruskal, L. Rudolph, and M. Snir, A Complexity Theory of Efficient Parallel Algorithms, Theoretical Computer Science 71 (1990) 95-132.
9. F. T. Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes", Morgan Kaufman Publishers, San Mateo, California, 1991.
10. W. F. McColl, General Purpose Parallel Computing, in "Lectures on Parallel Computation", ed. A. Gibbons and P. Spirakis, Cambridge University Press, 1993, pp. 337-391.
11. F. Meyer auf der Heide, Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines, in Proceedings of the 1st Heinz Nixdorf Symposium "Parallel Architectures and their Efficient Use," ed. F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, 1992, Lecture Notes on Computer Science 678, pp. 20-29.
12. L. G. Valiant, General Purpose Parallel Architectures, in "Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity", ed. J. vein Leeuwen, Elsevier Science Publishers, 1990, pp. 943-972.