%%% ====================================================================
%%% @LaTeX-file{
%%% filename = "tsitsikliss95.ltx",
%%% date = "20 November 1995",
%%% time = "21:41:32 EST",
%%% author = "David M. Jones",
%%% email = "jacm@theory.lcs.mit.edu",
%%% url = "http://theory.lcs.mit.edu/~jacm/",
%%% address = "Journal of the ACM
%%% MIT Laboratory for Computer Science
%%% Room NE43-316
%%% 545 Technology Square
%%% Cambridge, MA 02139
%%% USA",
%%% telephone = "(617) 253-5936",
%%% FAX = "(617) 253-3480",
%%% checksum = "03054 103 401 3511",
%%% codetable = "ISO/ASCII",
%%% supported = "yes",
%%% docstring = "Copyright (c) 1995 by ACM, Inc.
%%% Permission to make digital or hard copies of part
%%% or all of this work for personal or classroom use
%%% is granted without fee provided that copies are
%%% not made or distributed for profit or direct
%%% commercial advantage and that copies bear this
%%% notice and the full citation on the first page.
%%% Copyrights for components of this work owned by
%%% others than ACM must be honored. Abstracting with
%%% credit is permitted. To copy otherwise, to
%%% republish, to post on servers, or to redistribute
%%% to lists, requires prior specific permission
%%% and/or a fee. Request permissions from
%%% Publications Dept, ACM Inc., fax +1 (212)
%%% 869-0481, or permissions@acm.org.
%%%
%%% This is a LaTeX2e file. To process it, you will
%%% need a copy of the acmabs document class, which is
%%% available via the following URL:
%%%
%%% http://theory.lcs.mit.edu/~jacm/acmart/acmabs.cls
%%% ",
%%% }
%%% ====================================================================
\documentclass{acmabs}
\begin{document}
\Journal{Journal of the ACM}
\refkey{TsitsiklisS95}
\title{On the Average Communication Complexity of Asynchronous Distributed
Algorithms}
\author{John~N. Tsitsiklis \and George~D. Stamoulis}
\Pages{382--400}
\Month{March}
\Year{1995}
\Volume{42}
\Number{2}
\maketitle
\begin{abstract}
We study the communication complexity of asynchronous distributed algorithms.
Such algorithms can generate excessively many messages in the worst case.
Nevertheless, we show that, under certain probabilistic assumptions, the
expected number of messages generated per time unit is bounded by a
polynomial function of the number of processors under a very general model of
distributed computation. Furthermore, for constant-degree processor graphs,
the expected number of generated messages is only $O(nT)$, where $n$ is the
number of processors and $T$ is the running time. We conclude that (under our
model) any asynchronous algorithm with good time complexity will also have
good communication complexity, on the average.
\end{abstract}
\begin{categories}
C.2.1[network communication]; G.1.0[parallel algorithms]; G.m[Queueing theory]]
\end{categories}
\begin{terms}
Algorithms, performance
\end{terms}
\begin{keywords}
asynchronous distributed algorithms
\end{keywords}
\end{document}