Abstract
Most theoretical models of distributed systems neglect the cost of local computation, and charge only for communication between the participants in the computation. For example, in shared memory models, we charge only for steps where processes interact with the shared memory, and in message-passing systems we charge only for messages sent between network nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kuhn, F., Drucker, A., Oshman, R.: The computational power of the congested clique. To appear in PODC 2014 (2014)
Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702–732 (2004)
Braverman, M., Ellen, F., Oshman, R., Pitassi, T., Vaikuntanathan, V.: A tight bound for set disjointness in the message-passing model. In: Proc. 54th Symp. on Found. of Comp. Science (FOCS), pp. 668–677 (2013)
Dolev, D., Lenzen, C., Peled, S.: “Tri, tri again”: Finding triangles and small subgraphs in a distributed setting (extended abstract). In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 195–209. Springer, Heidelberg (2012)
Drucker, A., Kuhn, F., Oshman, R.: The communication complexity of distributed task allocation. In: PODC, pp. 67–76 (2012)
Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5(4), 545–557 (1992)
Kuhn, F., Oshman, R.: The complexity of data aggregation in directed networks. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 416–431. Springer, Heidelberg (2011)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (2006)
Lenzen, C.: Optimal deterministic routing and sorting on the congested clique. In: Proc. 32nd Symp. on Principles of Distr. Comp. (PODC), pp. 42–50 (2013)
Patt-Shamir, B., Teplitsky, M.: The round complexity of distributed sorting: extended abstract. In: Proc. 30th Symp. on Principles of Distr. Comp. (PODC), pp. 249–256 (2011)
Peleg, D.: Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics (2000)
Phillips, J.M., Verbin, E., Zhang, Q.: Lower bounds for number-in-hand multiparty communication complexity, made easy. In: Proc. 23rd Symp. on Discrete Algorithms (SODA), pp. 486–501 (2012)
Razborov, A.: On the distributed complexity of disjointness. TCS: Theoretical Computer Science 106 (1992)
Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM Journal on Computing 41(5), 1235–1265 (2012)
Woodruff, D.P., Zhang, Q.: Tight bounds for distributed functional monitoring. In: Proc. 44th Symp. on Theory of Comp. (STOC), pp. 941–960 (2012)
Woodruff, D.P., Zhang, Q.: When distributed computation is communication expensive. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 16–30. Springer, Heidelberg (2013)
Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC, pp. 209–213 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Oshman, R. (2014). Communication Complexity Lower Bounds in Distributed Message-Passing. In: Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2014. Lecture Notes in Computer Science, vol 8576. Springer, Cham. https://doi.org/10.1007/978-3-319-09620-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-09620-9_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09619-3
Online ISBN: 978-3-319-09620-9
eBook Packages: Computer ScienceComputer Science (R0)