Distributed Algorithms for Implementing Highly Reliable Distributed Systems

点击翻译按钮获取中文摘要

It is highly expected that distributed systems are designed and implemented on world-wide networks. However, the design of large scale of distributed systems is a very complicated task because of inherent autonomy of processes. Thus, it is strongly desired to establish effective paradigms for designing distributed systems.The aim of this research is to propose paradigms for designing distributed/parallel algorithms. Especially, we investigated the method for designing distributed/parallel algorithms that possess the property required for practical distributed systems. The subjects we addressed are summarized as follows :1. Distributed algorithm design for highly reliable/available distributed systems : We investigated self-stabilization and wait-freedom of distributed algorithms that are expected to be promising paradigms for designing practically reliable/available distributed systems.2. Distributed algorithm design for mobile computing : We investigated distributed algorithm design for distributed systems containing mobile computers, since mobile computers as PDAs (Personal Digital Assistants) become essential components of practical distributed systems.3. Parallel algorithm design for computer cluster systems : We investigated parallel algorithm design for distributed systems based on computer clusters, since computer clusters are practical platform of high performance distributed systems.