Abstract
We argue that the synchronized alternating finite automaton (introduced by Hromkovič et al.) is a viable model for studying the communication complexity of parallel computation. This motivates our study of the classes of languages accepted by synchronized alternating finite automata (SAFA) whose messages are bounded in length by a function m(n). We establish the lower bounds on m(n) for some types of SAFA to accept nonregular languages; we also show that these bounds are tight. Next, we establish dense hierarchies of these machines on m(n), and finally we give a characterization of NP in terms of bounded-message multihead SAFA.
Research supported in part by NSF Grant CCR89-18409.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. D. Ullman, and M. Yannakakis, On notions of information transfer in VLSI circuits, in Proc. 15th Symp. on Theory of Computing, ACM, 1983, pp. 133–138.
L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity theory (preliminary version), in Proc. 27th Ann. Symp. on Foundations of Computer Science, IEEE, 1986, pp. 337–347.
A. K. Chandra, D. K. Kozen, and J. Stockmeyer, Alternation, J. ACM, 28 (1981), pp. 114–133.
W. D. Hillis, The Connection Machine, PhD thesis, Massachusetts Institute of Technology, 1985.
J. Hromkovic, J. Karhumäki, B. Rovan, and A. Slobodová, On the power of synchronization in parallel computations, tech. report, Comenius University, Bratislava, Czechoslovakia, 1989.
J. Hromkovic, How to organize the communication among parallel processes in alternating computations. Manuscript, January 1986.
J. Hromkovič, B. Rovan, and A. Slobodová, Deterministic versus nondeterministic space in terms of synchronized alternating machines, tech. report, Comenius University, Bratislava, Czechoslovakia, 1989.
O. H. Ibarra and N. Q. Tran, New results concerning synchronized finite automata, in Proc. 19th ICALP, Vienna 1992, Lecture Notes in Computer Science 623, Springer-Verlag, 1992, pp. 126–137.
-, On space-bounded synchronized alternating Turing machines, Theoretical Computer Science, 99 (1992), pp. 243–264.
K. N. King, Alternating multihead finite automata, Theoretical Computer Science, 61 (1988), pp. 149–174.
A. C.-C. Yao, Some complexity questions related to distributed computing, in Proc. 11th Symp. on Theory of Computing, ACM, 1979, pp. 209–213.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H., Trân, N. (1993). On the communication complexity of parallel computation. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_43
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive