Result: Two absolute bounds for distributed bit complexity

Title:
Two absolute bounds for distributed bit complexity
Authors:
DINITZ, Yefim, SOLOMON, Noam
Source:
Structural information and communication complexity (SIROCCO 2005)Theoretical computer science. 384(2-3):168-183
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 7 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Divers, Miscellaneous, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Borne inférieure, Lower bound, Cota inferior, Borne supérieure, Upper bound, Cota superior, Calcul automatique, Computing, Cálculo automático, Calcul réparti, Distributed computing, Cálculo repartido, Chaîne, Chain, Cadena, Communication, Comunicación, Complexité communication, Communication complexity, Concept, Concepto, Consensus, Consenso, Informatique théorique, Computer theory, Informática teórica, Lien, Link, Vínculo, Longueur chaîne, Chain length, Longitud cadena, Preuve, Proof, Prueba, Processeur, Processor, Procesador, 68Q85, 68Wxx, Absolute bound, Bit complexity, Leader election
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, POB 653, Beer-Sheva 84105, Israel
Department of Mathematics, Ben-Gurion University of the Negev, POB 653, Beer-Sheva 84105, Israel
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19109042
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19109042
Database:
PASCAL Archive

Further Information

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied the bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, which remained there open. The first is to close the gap between the known upper and lower bounds, for electing a leader by two linked processors. The second is whether the suggested algorithm, sending 1.5n bits while electing a leader in a chain of even length n, is optimal, in the case when n is known to the processors. For both problems, absolutely exact bounds are found. Moreover, the presented lower bound proofs show that there is no optimal algorithm other than the suggested ones.