Skip to main content

Module

CSC8103 : Distributed Algorithms

  • Offered for Year: 2020/21
  • Module Leader(s): Dr Paul Ezhilchelvan
  • Owning School: Computing
  • Teaching Location: Newcastle City Campus
Semesters
Semester 1 Credit Value: 10
ECTS Credits: 5.0

Aims

Distributed algorithms are the foundation on which system services are built. The aim of the module is to cover core algorithms by concentrating on three key attributes that are very significant in building responsive applications: processing and communication delays and component failures.

Outline Of Syllabus

Preliminaries: Synchronous and Asynchronous communication models, precedence relations, non-deterministic computations and execution configurations, basics of tree structures, and basics of cryptography.
Fundamental Algorithms: Wave and Election Algorithms for trees, rings, and arbitrary topological structures. Example applications on Routing Algorithms and e-auction sites.
Algorithms in e-Commerce: Fair Exchange Algorithms. On-line and Off-line algorithms. Contract Exchange Applications.
Algorithms for Distributed Data Management: Database Commit Protocols: 2-phase and 3-phase protocols. The requirements and the limitations of commit protocols.
Algorithms for Fault-Tolerant Distributed Computing: Replication Strategies. Reliable and Ordered Broadcasts, Reaching agreement and Consensus protocols.

Teaching Methods

Module leaders are revising this content in light of the Covid 19 restrictions.
Revised and approved detail information will be available by 17 August.

Assessment Methods

Module leaders are revising this content in light of the Covid 19 restrictions.
Revised and approved detail information will be available by 17 August.

Reading Lists

Timetable