On the communication complexity of distributed algebraic computation

Abstract : we consider a situation where two processors P sub 1 and P sub 2 ar e to evaluate a collection of functions function 1,....,function 8 of two vector variables x, y, under the assumption that processor P sub 1 (respectively, P sub 2) has access only to the value of the variable x (respectively, y) and the functional form of function 1,....,function 8. We provide some new bounds on the communication complexity (the amount of information that has to be exchanged between the processors) for this problem. An almost optimal bound is derived for the case of one-way communication when the functions function 1,...., function 8 are polynomials. We also derive some new lower bounds for the case of two-way communication which improve on earlier bounds by Abelson A 80. As an application, we consider the case where x and y are n x n matrices and f(x,y) is a particular entry of the inverse of x + y. Under certain restriction on the class of allowed communication protocols, we obtain an omega(n squared) lower bound, in contrast to the omega(n) lower bound obtained by applying Abelson's results. Our results are based on certain tools from classical algebraic geometry and field extension theory.

[1]  P. Gordan,et al.  Ueber die algebraischen Formen, deren Hesse'sche Determinante identisch verschwindet , 1876 .

[2]  A. B. BASSET,et al.  Modern Algebra , 1905, Nature.

[3]  C. Zheng,et al.  ; 0 ; , 1951 .

[4]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[5]  Michael Francis Atiyah,et al.  Introduction to commutative algebra , 1969 .

[6]  T. Willmore.  Algebraic Geometry , 1973, Nature.

[7]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[8]  Harold Abelson,et al.  Corrigendum: Towards a Theory of Local and Global in Computation , 1978, Theoretical Computer Science.

[9]  Harold Abelson,et al.  Lower bounds on information transfer in distributed computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[10]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[11]  Nils Sandell,et al.  Detection with Distributed Sensors , 1980, IEEE Transactions on Aerospace and Electronic Systems.

[12]  Christos H. Papadimitriou,et al.  Communication complexity , 1982, STOC '82.

[13]  A. Willsky,et al.  Combining and updating of local estimates and regional maps along sets of one-dimensional tracks , 1982 .

[14]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[15]  John N. Tsitsiklis,et al.  On the Complexity of Designing Distributed Protocols , 1982, Inf. Control..

[16]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

[17]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[18]  F. Zak.  PROJECTIONS OF ALGEBRAIC VARIETIES , 1983 .

[19]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[20]  John N. Tsitsiklis,et al.  Communication complexity of convex optimization , 1986, 1986 25th IEEE Conference on Decision and Control.

[21]  Abbas El Gamal,et al.  Communication Complexity of Computing the Hamming Distance , 1986, SIAM J. Comput..

[22]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[23]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[24]  Zhi-Quan Luo.  Communication complexity of some problems in distributed computation , 1989 .

[25]  John N. Tsitsiklis,et al.  On the Communication Complexity of Solving a Polynomial Equation , 1989, SIAM J. Comput..