Abstract
This paper presents algorithms and lower bounds for several fundamental problems on the ERCW PRAM and some results for unbounded fan-in, bounded fan-out (or ‘BFO’) circuits. Our results for these two models are of importance because of the close relationship of the ERCW model to the OCPC model, a model of parallel computing based on dynamically reconfigurable optical networks, and of BFO circuits to the OCPC model with limited dynamic reconfiguration ability.
This research was supported by Texas Advanced Research Projects Grant 003658480.
This research was supported in part by Texas Advanced Research Projects Grants 003658480 and 003658386, and NSF Grant CCR 90-23059.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. J. Anderson and G. L. Miller. Optical communication for pointer based algorithms. Technical Report CRI 88-14, University of Southern California, 1988.
R. B. Boppana and M. Sipser. The complexity of finite functions. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, chapter 14, pages 757–804. MIT Press/Elsevier, 1990.
A. K. Chandra, L. J. Stockmeyer, and U. Vishkin. A complexity theory for unbounded fan-in parallelism. In Proc. 23th Symp. on Found. of Comp. Sci., pages 1–13, 1982.
S. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 15(1):87–97, February 1986.
P. Dowd. High performance interprocessor communication through optical wavelength division multiple access channels. In Proc. 18th Symp. on Comp. Arch., pages 96–105, 1991.
P. Erdös and R. Rado. Intersection Theorems for Systems of Sets. J. London Math., 35:85–90, 1960.
M. M. Eshaghian. Parallel algorithms for image processing on omc. IEEE Trans. Comput., 40(7):827–833, 1991.
F. Fich, R. Impagliazzo, B. Kapron, V. King, and M. Kutylowski. Limits on the power of parallel random access machines with weak forms of write conflict resolution. In Proc. of 10th Symp. on Theor. Aspects of Comp. Sci., page unknown, 1993.
F. Fich, M. Kowaluk, M. Kutylowski, K. LoryŚ, and P. Ragde. Retrieval of scattered information by EREW, CREW, and CRCW PRAMs. In Proc. 3rd Scand. Workshop on Alg. Theory, pages 30–41. Lec. Notes in Comp. Sci., Vol. 621, 1992.
F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson. One, two, three ... infinity: Lower bounds for parallel computation. In Proc. 17th Symp. on Theory of Computing, pages 48–58, 1985.
F. E. Fich, P. Ragde, and A. Wigderson. Relations between concurrent-write models of parallel computation. SIAM J. Comput., 17:606–627, 1988.
J. Friedman. Construct O(n log n) size montone formulae for the kth threshold function of n boolean variables. SIAM J. Comput., 15(3):641–654, 1986.
A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. In Proc. Scandinavian Workshop on Algo. Theory, 1992.
M. Geréb-Graus and T. Tsantilas. Efficient optical communication in parallel computers. In Proc. ACM Symp. on Para. Alg. and Arch., pages 41–48, 1992.
P. B. Gibbons, Y. Matias, V. Ramachandran. The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms. In Proc. ACM-SIAM Symp. on Discrete Algs. 1994, SIAM J Comput, to appear.
L. A. Goldberg, M. Jerrum, T. Leighton, and S. Rao. A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. In Proc. ACM Symp. on Para. Alg. and Arch., pages 300–309, 1993.
L. A. Goldberg, M. Jerrum, and P. D. MacKenzie. A lower bound for routing on a completely connected optical communication parallel computer. accepted to SPAA, 1994.
T. Hagerup. Towards optimal parallel bucket sorting. Inform. and Comp., 75:39–51, 1987.
T. Hagerup and T. Radzik. Every robust CRCW PRAM can efficiently simulate a Priority PRAM. In Proc. 2nd ACM Symp. on Para. Alg. and Arch., pages 117–124, 1990.
H. J. Hoover, M. M. Klawe, and N. J. Pippenger. Bounding fan-out in logical networks. J. Assoc. Comput. Mach., 31(1):13–18, 1984.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, chapter 17, pages 869–941. MIT Press/Elsevier, 1990.
V. M. Khrapchenko. A method for determining lower bounds for the complexity of π-schemes. Mat. Zametki, 10(1):83–92, 1971. (in Russian); English translation in: Math. Notes 10(1) (1971) 474–479.
R. E. Krichevskii. Complexity of contact circuits realizing a function of logical algebra. Dokl. Akad. Nauk SSSR, 151(4):803–806, 1963. (in Russian); English translation in: Soviet Phys. Dokl. 8(8) (1964) 770–772.
P. D. MacKenzie and V. Ramachandran. ERCW PRAMs and Optical Communication. TR96-16, Dept. of Comp. Sci., Univ of Texas at Austin, 1996.
D. E. Muller and F. P. Preparata. Bounds to complexities of networks for sorting and for switching. J. Assoc. Comput. Mach., 22(2):195–201, April 1975.
L. G. Valiant. Short monotone formulae for the majority function. J. Algorithms, 5:363–366, 1984.
L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, chapter 18, pages 945–971. MIT Press/Elsevier, 1990.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
MacKenzie, P.D., Ramachandran, V. (1996). ERCW PRAMs and optical communication. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024715
Download citation
DOI: https://doi.org/10.1007/BFb0024715
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive