Showing papers on "Communication complexity published in 1984"
TL;DR: Two models of the cost of data movement in parallel numerical algorithms are described, one suitable for shared memory multiprocessors where each processor has vector capabilities and the other applicable to highly parallel nonshared memory MIMD systems.
Abstract: This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.
108 citations
TL;DR: It is here argued that the communication complexity of distributed problems can be greatly affected by two factors hereby identified as 'sense of direction' and 'topological awareness'.
Abstract: Based on some recent results, it is here argued that the communication complexity of distributed problems can be greatly affected by two factors hereby identified as 'sense of direction' and 'topological awareness'. It is also suggested that 'insensitivity' to either or both factors is an indicator of the inherent difficulty of a distributed problem. A bibliography of recent results is included.
72 citations
TL;DR: It is shown, for example, that the complexity classes of random one- way protocols and of deterministic two-way protocols are incomparable: exponential gaps exist in either direction.
Abstract: We study four kinds of protocols in distributed computing. Besides the case of deterministic protocols, we consider random, nondeterministic and probabilistic models. We show a strict containment relationship with exponential gaps. We also explore in some depth the relationship between one-way and two-way communications. It is shown, for example, that the complexity classes of random one-way protocols and of deterministic two-way protocols are incomparable: exponential gaps exist in either direction. On the other hand there is no difference between the complexity of one-way and two-way communications in the nondeterministic case.
35 citations
27 Aug 1984
TL;DR: This paper presents distributed algorithms for election and traversal in strongly connected unidirectional networks that achieves the same communication complexity and uses only 1 bits of memory in each processor.
Abstract: This paper presents distributed algorithms for election and traversal in strongly connected unidirectional networks. A unidirectional network consists of nodes which are processors connected by unidirectional communication links. Initially, processors differ by their identifier but are otherwise similar. The election algorithm distinguishes a single processor from all other processors. The election algorithm requires O(log n) bits of memory in each processor and has communication complexity of O(n • m+n2log n) bits. In the traversal algorithm one node initiates a token which visits all the nodes of the network and returns to the initiator. The traversal algorithm is derived from the election algorithm. It achieves the same communication complexity and uses only O(1) bits of memory in each processor.
25 citations
24 Oct 1984
TL;DR: This work proves that a certain language requires /spl Omega/(nlogn) time to be recognized by a 1-tape (unbounded error) probabilistic Turing machine, and believes that this is the first nontrivial lower bound on the time required by unrestricted probabilism Turing machines.
Abstract: We study (unbounded error) probabilistic communication complexity. Our new results include -one way and two complexities differ by at most 1 - certain functions like equality and the verification of Hamming distance have upper bounds that are considerably better than their counterparts in deterministic, nondeterministic, or bounded error probabilistic model - there exists a function which requires /spl Omega/(logn) information transfer. As an application, we prove that a certain language requires /spl Omega/(nlogn) time to be recognized by a 1-tape (unbounded error) probabilistic Turing machine. This bound is optimal. (Previous lower bound results [Yao 1] require acceptance by bounded error computation. We believe that this is the first nontrivial lower bound on the time required by unrestricted probabilistic Turing machines.
23 citations
24 Oct 1984
TL;DR: In this article, it was shown that for almost all boolean functions f, the conmunication complexity of f on a linear array with p+1 processors is approximately p times its commuication complexity on a system with two processors.
Abstract: We prove that for almost all boolean functions f , the conmunication complexity of f on a linear array with p+1 processors is approximately p times its commuication complexity on a system with two processors. We use this result to develop a technique for establishing lower bounds on communication complexity on general networks by simulating them on linear arrays. Using this technique, we derive optimal lower bounds for ranking, distinctness, uniqueness and triangle-detection problems on the ring. The application of this technique to meshes and trees yields nontrivial near optimal lower bounds on the communicaton complexity of ranking and distinctness problems on these networks.
8 citations
01 Sep 1984
TL;DR: UNCLASSIFIED S E C U R I T Y C L A S S I F I C A T I O N O F T H IS P A G E SECUR ITY CLASSI FIÇA TIO N of TH IS PAGE
Abstract: 20. Ol S T RI B U T I O N / A V A I L A B I L I T Y OF A B S T R A C T 21. A B S T R A C T S E C U R I T Y C L A S S I F I C A T I O N U N C L A S S I F I E D / U N L I M I T E D 3 S A M E AS RPT. □ O T I C U SER S □ UNCLASSIFIED 22a. N A M E O F R E S P O N S IB L E I N D I V I D U A L ______________________________________________ 22b. t e l e p h o n e n u m b e r (Include Area Code) 22c. O F F I C E S Y M B O L NONE DD FORM 1473, 33 APR e d i t i o n o f i j a n 73 is o b s o l e t e . UNCLASSIFIED S E C U R I T Y C L A S S I F I C A T I O N O F T H IS P A G E SECUR ITY CLASSI FIÇA TIO N OF TH IS PAGE
8 citations
Proceedings Article•
16 Jul 1984
TL;DR: A protocol is a communication protocol that uses c bits if for every input A and B exchange ≤ c bits, and the bits exchanged are called transcript.
4 citations
01 Jan 1984
TL;DR: This general technique is derived by simulating the general network by a linear array and then using a lower bound on the communication complexity of the problem on the linear array to determine lower bounds on the Communication complexity of problems on various distributed computer networks.
Abstract: We F tions f , the c( linear array wi. times its commL two processors. nique for establi complexity on on linear arraj optimal lower uniqueness and ring. The applil trees yields non the communica tinctness probler
2 citations
Book•
16 Jul 1984
TL;DR: The theory of data dependencies - An overview of VLSI and its implications for graph grammars.
Abstract: The theory of data dependencies - An overview.- The VLSI revolution in theoretical circles.- Tuple sequences and indexes.- The complexity of cubical graphs.- P-generic sets.- Functional dependencies and disjunctive existence constraints in database relations with null values.- The algebra of recursively defined processes and the algebra of regular processes.- Algebraic specification of exception handling and error recovery by means of declarations and equations.- Building the minimal DFA for the set of all subwords of a word on-line in linear time.- The complexity and decidability of separation.- Concurrent transmissions in broadcast networks.- Linear searching for a square in a word.- Domain algebras.- Principality results about some matrix languages families.- Oriented equational clauses as a programming language.- Relational algebra operations and sizes of relations.- Some results about finite and infinite behaviours of a pushdown automaton.- On the relationship of CCS and petri nets.- Communicating finite state machines with priority channels.- A modal characterization of observational congruence on finite terms of CCS.- Communication complexity.- Space and time efficient simulations and characterizations of some restricted classes of PDAS.- A complete axiom system for algebra of closed-regular expression.- The complexity of finding minimum-length generator sequences.- On probabilistic tape complexity and fast circuits for matrix inversion problems.- On three-element codes.- Recursion depth analysis for special tree traversal algorithms.- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem.- Measures of presortedness and optimal sorting algorithms.- Languages and inverse semigroups.- Area-time optimal vlsi integer multiplier with minimum computation time.- On the interpretation of infinite computations in logic programming.- A linear time algorithm to solve the single function coarsest partition problem.- Complexite des facteurs des mots infinis engendres par morphismes iteres.- Automates boustrophedon, semi-groupe de birget et monoide inversif libre.- Probabilistic bidding gives optimal distributed resource allocation.- Partial order semantics versus interleaving semantics for CSP - like languages and its impact on fairness.- Cancellation, pumping and permutation in formal languages.- A hardware implementation of the CSP primitives and its verification.- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm.- Robust algorithms: A different approach to oracles.- Node weighted matching.- The propositional mu-calculus is elementary.- AVL-trees for localized search.- The simple roots of real-time computation hierarchies.- Computational complexity of an optical disk interface.- Encoding graphs by derivations and implications for the theory of graph grammars.- Sampling algorithms for differential batch retrieval problems (extended abstract).
1 citations
01 Jan 1984
TL;DR: This work studies (unbounded error) pro- babilistic communication complexity and new results include Po, and second argument, Xil is known to Pi.
Abstract: We study (unbounded error) pro- babilistic communication complexity. Our new results include Po, and second argument, Xil is known to Pi. In order to compute f, Po, and P, communicate - one way ad two way complexities differ by at most 1 - certain functions like equality and the verification of Hamming distance have upper bounds that are considerably PO, and Pi have unlimited local computing better than their counterparts in deterministic, nondeterministic, or power, and the ability to realize an arbitrary bounded error probabilistic model - there exists a function which requires probability distribution over the set of mes- R(1ogn) information transfer