Distributed System Modelling and Analysis.

Abstract

Abstract : This project is intended to develop theoretical foundations for distributed computing. The primary goal of the work has been the design of distributed algorithms and the proof of upper and lower complexity bounds for interesting distributed problems. The kinds of problems studies include distributed consensus in the presence of faults, resource allocation, and election of a leader. A secondary goal has been the development of formal semantic models for concurrent and distributed algorithms, in a way which would clarify the commonality among various different kinds of concurrent algorithms (shared memory algorithms, message-passing algorithms, concurrency control algorithms, dataflow algorithms, etc.) A tertiary goal has involved the modelling, specification and verification of concurrency control and recovery algorithms for nested transaction systems. (Author)