Leader election and renaming with optimal message complexity
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/89859 |
| _version_ | 1811080278091759616 |
|---|---|
| author | Gelashvili, Rati |
| author2 | Nir Shavit. |
| author_facet | Nir Shavit. Gelashvili, Rati |
| author_sort | Gelashvili, Rati |
| collection | MIT |
| description | Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014. |
| first_indexed | 2024-09-23T11:28:40Z |
| format | Thesis |
| id | mit-1721.1/89859 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:28:40Z |
| publishDate | 2014 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/898592019-04-11T05:35:19Z Leader election and renaming with optimal message complexity Gelashvili, Rati Nir Shavit. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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. 2014-09-19T19:37:56Z 2014-09-19T19:37:56Z 2014 2014 Thesis http://hdl.handle.net/1721.1/89859 890151019 eng 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 68 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Gelashvili, Rati Leader election and renaming with optimal message complexity |
| title | Leader election and renaming with optimal message complexity |
| title_full | Leader election and renaming with optimal message complexity |
| title_fullStr | Leader election and renaming with optimal message complexity |
| title_full_unstemmed | Leader election and renaming with optimal message complexity |
| title_short | Leader election and renaming with optimal message complexity |
| title_sort | leader election and renaming with optimal message complexity |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/89859 |
| work_keys_str_mv | AT gelashvilirati leaderelectionandrenamingwithoptimalmessagecomplexity |