Abstract
Proving stabilization of a complex algorithm under the distributed scheduler is a non-trivial task. This paper introduces a new method which allows to extend proofs for the central scheduler to the distributed scheduler. The practicability of the method is shown by applying it to two existing algorithms, for which stabilization under the distributed scheduler was an open problem.
Original language | English |
---|---|
Title of host publication | Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, Proceedings |
Pages | 65-79 |
Number of pages | 15 |
DOIs | |
State | Published - 2010 |
Externally published | Yes |
Event | 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2010 - New York, NY, United States Duration: 20 Sep 2010 → 22 Sep 2010 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 6366 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2010 |
---|---|
Country/Territory | United States |
City | New York, NY |
Period | 20/09/10 → 22/09/10 |
Bibliographical note
Funding Information:This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.
Funding
This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.
Funders | Funder number |
---|---|
Deutsche Forschungsgemeinschaft | TU 221/3-1 |