Optical interprocessor communication protocols

Proceedings of the 1st International Workshop on Massively Parallel Processing Using Optical Interconnections, MPPOI 1994

Volumn , Issue , 1994, Pages 266-274

  Rao, Satish B ^a   Tsantilas, Thanasis ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE; OPTICAL COMMUNICATION; OPTICAL INTERCONNECTS; OPTICAL SYSTEMS;

BARRIER SYNCHRONIZATION; BULK SYNCHRONOUS PARALLEL; COMMUNICATION ARCHITECTURES; INTER PROCESSOR COMMUNICATION; MESSAGE TRANSMISSIONS; PARALLEL RANDOM ACCESS MACHINES; THEORETICAL COMPUTER SCIENCE; TWO-DIMENSIONAL ARRAYS;

PARALLEL PROCESSING SYSTEMS;

EID: 85030070331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MPPOI.1994.336618     Document Type: Conference Paper

References (30)

1. R. J. ANDERSON AND G. L. MILLER, Optical communication for pointer based algorithms, Tech. Report CRI-88-14, Computer Science Department, University of Southern California, 1988.
2. D. ANGLUIN AND L. G. VALIANT, Fast probabilistic algorithms for hamiltonian circuits and matchings, Journal of Computer and Systems Sciences, 18(1979), pp. 155-193.
3. M. BAUMSLAG AND F. ANNEXSTEIN, A unified framework for off-line permutation routing in parallel networks, Mathematical Systems Theory, 24(1991), pp. 233-251.
4. V. BENES, Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York, 1965.
5. R. COLE, Parallel merge sort, SIAM Journal on Computing, 17(1988), pp. 770-785.
6. P. W. DOWD, High performance interprocessor communication through optical wavelength division multiple access channels, in Proceedings of the 18th International Symposium on Computer Architecture, 1991, pp. 96-105.
7. G. C. FOX, M. A. JOHNSON, G. A. LYZENGA, S. W. OTTO, J. K. SALMON, AND D. W. WALKER, Solving Problems on Concurrent Processors, Vol. 1: General Techniques and Regular Problems, Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
8. A. GERBESSIOTIS AND L. G. VALIANT, Direct bulk-synchronous parallel algorithms, in Proc. of Third Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 621, Springer-Verlag, 1992.
9. M. GEREB-GRAUS AND T. TSANTILAS, Efficient optical communication in parallel computers, in 4th Symposium on Parallel Algorithms and Architectures (SPAA '92), 1992.
10. A. M. GIBBONS AND P. SPIRAKIS, eds., Lectures on Parallel Computation. Proc. 1991 ALCOM Spring School on Parallel Computation, Cambridge International Series on Parallel Computation, Cambridge University Press, Cambridge, UK, 1992 (to appear).
11. J. GILL AND Y. MATIAS, Fast hashing on a PRAM, in 2nd ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 271-280.
12. L. GOLDBERG, M. JERRUM, T. LEIGHTON, AND S. RAO, A doubly-logarithmic communication algorithm for the completely connected optical communication parallel computer, in 5th Symposium on Parallel Algorithms and Architectures (SPAA '93), 1993.
13. L. A. GOLDBERG, M. JERRUM, AND P. D. MACKENZIE, A lower bound for routing on a completely connected optical communication parallel computer. Unpublished manuscript, 1994.
14. R. I. GREENGERG AND C. E. LEISERSON, Randomized routing on fat-trees, Advances in Computing Research, Vol. 5, JAI Press, 1989, pp. 345-374.
15. A. HARTMAN AND S. REDFIELD, Design sketches for optical crossbar switches intended for large scale parallel processing applications, Optical Engineering, 29(1989), pp. 315-327.
16. P. HENRY, Very-high-capacity lightwave networks, in IEEE International Communication Conference, 1988, pp. 1206-1209.
17. C. P. KRUSKAL, L. RUDOLPH, AND M. SNIR, A complexity theory of efficient parallel algorithms, Theoretical Computer Science, 71(1990), pp. 95-132.
18. T. LEIGHTON AND B. MAGGS. Unpublished results.
19. R. A. LLNKE, Power distribution in a planarwaveguide based broadcast star network, IEEE Photonics Technology Letters, 3(1991), pp. 850-852.
20. L. LOVASZ AND M. PLUMMER, Matching Theory, North-Holland, New York, 1986.
21. P. D. MACKENZIE, C. G. PLAXTON, AND R. RAJARAMAN, On contention resolution protocols and associated probabilistic phenomena. Accepted to STOC '94, 1994.
22. Y. MATIAS AND U. VISHKIN, Converting high probability into nearly-constant time-with applications to parallel hashing, in 23d ACM Symposium on Theory of Computing, 1986, pp. 307-316.
23. W. F. MCCOLL, General purpose parallel computing, in Gibbons and Spirakis [10].
24. S. B. RAO AND T. TSANTILAS, Using optics to solve the VLSI-wiring problem, 1993. Manuscript.
25. L. G. VALIANT, Optimally universal parallel computers, Phil. Trans. R. Soc. Lond., A 326(1988), pp. 373-376.
26. -, A bridging model for parallel computation, Communications of the ACM, 33(1990), pp. 103-111.
27. -, General purpose parallel architectures, in Handbook of Theoretical Computer Science: Vol. A (J. van Leeuwen, ed.), North-Holland, 1990.
28. -, Why BSP computers?, Tech. Report TR- 26-92, Aiken Computation Lab, Harvard University, 1992.
29. L. G. VALIANT AND G. J. BREBNER, Universal schemes for parallel communication, in 13th ACM Symposium on Theory of Computing, 1981, pp. 263-277.
30. L. D. WLTTIE, Communication structures for large networks of microcomputers, IEEE Transactions on Computing, 30(1981), pp. 264-272.