A knowledge-based approach to verifying message complexity lower bounds of two distributed computing problems
碩士 === 國立交通大學 === 資訊工程系 === 90 === Knowledge is a kind of modal logic. It was proposed by Halpern et al. in 1984, and provides a unified framework and a set of tools for formal proofs about impossibility results. Knowledge has been extensively used since then as an analytical tool to prov...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60833712360117209082 |
| Summary: | 碩士 === 國立交通大學 === 資訊工程系 === 90 === Knowledge is a kind of modal logic. It was proposed by Halpern et al. in 1984, and provides a unified framework and a set of tools for formal proofs about impossibility results. Knowledge has been extensively used since then as an analytical tool to prove the impossibility result of the problem in distributed environments.
In this thesis, we use knowledge to verify message complexity lower bounds of two distributed computing problems. The problems are the resynchronization problem and the infimum computation problem. Gerard Tel provided two combinatorial proofs for these problems and showed that any algorithm that solves one of these problems needs at least n-1 messages, where n is the number of processes. We use knowledge’s framework to verify message complexity lower bounds of the two problems. The result of our verification shows that n-1 is indeed a lower bound of each problem. The result attests the common belief in the field of distributed computing that knowledge is really a powerful analytical tool.
|
|---|