2026-09-18T19:12:37Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/898592022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Nir Shavit.
Gelashvili, Rati
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2014-09-19T19:37:56Z
2014-09-19T19:37:56Z
2014
2014
http://hdl.handle.net/1721.1/89859
890151019
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 65-68).
Asynchronous message-passing system is a standard distributed model, where n processors communicate over unreliable channels, controlled by a strong adaptive adversary. The asynchronous nature of the system and the fact that t<n2 processors may fail by crashing are the great obstacles for designing efficient algorithms. Leader election (test-and-set) and renaming are two fundamental distributed tasks. We prove that both tasks can be solved using expected O(n²) messages -- the same asymptotic complexity as a single all-to-all broadcast -- and that this message complexity is in fact optimal.
by Rati Gelashvili.
S.M.
68 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Leader election and renaming with optimal message complexity
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="63bf0426-9ed0-4c8a-9260-8f4aceff476f">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Leader election and renaming with optimal message complexity</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2014</PublicationDate>
<Authors>
<Author>
<DisplayName>Gelashvili, Rati</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Asynchronous message-passing system is a standard distributed model, where n processors communicate over unreliable channels, controlled by a strong adaptive adversary. The asynchronous nature of the system and the fact that t<n2 processors may fail by crashing are the great obstacles for designing efficient algorithms. Leader election (test-and-set) and renaming are two fundamental distributed tasks. We prove that both tasks can be solved using expected O(n²) messages -- the same asymptotic complexity as a single all-to-all broadcast -- and that this message complexity is in fact optimal.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>