Abstract
dc:descriptionIN DISTRIBUTED SYSTEMS, IT IS USEFUL TO ASSUME THE EXISTENCE OF A PRIVILEGED PROCESS, THE LEADER PROCESS. THE MAIN FUNCTION OF THE LEADER IS TO COORDINATE THEOTHER PROCESSES OF THE SYSTEM. THE ELECTION PROBLEM AIMS TO DISTINGUISH (ELECT) ONE AMONG THE PROCESSES OF THE SYSTEM AS THE LEADER PROCESS. IN THIS THESIS, IN ORDER TO SOLVE THE ELECTION PROBLEM, IT IS ASSUMED THAT EACH PROCESS HAS A DISTINCT AND UNIQUE IDENTITY VALUE. MOREOVER, THE SYSTEM IS MODELED AS A NETWORKOF N PROCESSES WHICH COMMUNICATE BY EXCHANGING MESSAGES ASYNCHRONOUSLY. THE RESULTS FOR THE MESSAGE AND TIME COMPLEXITIES ACHIEVED, IMPROVE PREVIOUS RESULTS IN THE LITERATURE. (SHORTENED)
Degree
thesis:*- Grantor dc:publisher
- Οικονομικό Πανεπιστήμιο Αθηνών
- Year dc:date
- 1992
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Μάντζαρης, Σπυρίδων
Subjects
dc:subject × 22- CHORDAL RINGS
- COMPLETE NETWORKS
- Distributed algorithms
- Distributed computing
- Distributed systems
- ELECTION PROBLEM
- EXTREME-FINDING PROBLEM
- LEADER ELECTION
- MESSAGE COMPLEXITY
- TIME COMPLEXITY
- ΕΚΛΟΓΗ ΑΡΧΗΓΟΥ
- Κατανεμημένα συστήματα
- Κατανεμημένοι αλγόριθμοι
- Κατανεμημένος υπολογισμός
- ΠΛΗΡΗ ΔΙΚΤΥΑ
- ΠΟΛΥΠΛΟΚΟΤΗΤΑ ΜΗΝΥΜΑΤΩΝ
- ΠΟΛΥΠΛΟΚΟΤΗΤΑΧΡΟΝΟΥ
- ΧΟΡΔΙΚΟΙ ΔΑΚΤΥΛΙΟΙ
- Natural Sciences
- Computer and Information Sciences
- Φυσικές Επιστήμες
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/2224