CSC8103 : Distributed Algorithms
CSC8103 : Distributed Algorithms
- Offered for Year: 2024/25
- Module Leader(s): Dr Paul Ezhilchelvan
- Owning School: Computing
- Teaching Location: Newcastle City Campus
Semesters
Your programme is made up of credits, the total differs on programme to programme.
| Semester 1 Credit Value: | 10 |
| ECTS Credits: | 5.0 |
| European Credit Transfer System | |
Pre-requisite
Modules you must have done previously to study this module
Pre Requisite Comment
None
Co-Requisite
Modules you need to take at the same time
Co Requisite Comment
None
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.
Learning Outcomes
Intended Knowledge Outcomes
To be able to describe and discuss:
- the role of essential services needed to build reliable and responsive applications
- the concept of feasibility: whether services can be implemented under specified delay and failure assumptions
- restrictions under which feasibility can be attained.
Intended Skill Outcomes
The ability to:
- construct distributed algorithms and protocols underpinning design of distributed systems
- reason about the properties of distributed algorithms and protocols
Teaching Methods
Teaching Activities
| Category | Activity | Number | Length | Student Hours | Comment |
|---|---|---|---|---|---|
| Guided Independent Study | Assessment preparation and completion | 20 | 1:00 | 20:00 | Problem solving exercise |
| Scheduled Learning And Teaching Activities | Lecture | 21 | 1:00 | 21:00 | In-person lectures (20) |
| Guided Independent Study | Assessment preparation and completion | 1 | 20:00 | 20:00 | Exam and preparation |
| Scheduled Learning And Teaching Activities | Small group teaching | 4 | 1:00 | 4:00 | PiP for feedback on Formative Coursework |
| Structured Guided Learning | Structured non-synchronous discussion | 10 | 0:30 | 5:00 | Support for coursework and deep learning |
| Guided Independent Study | Independent study | 30 | 1:00 | 30:00 | Background reading |
| Total | 100:00 |
Teaching Rationale And Relationship
Lecture materials will introduce the learning material and demonstrate the key concepts by examples. Students are expected to follow-up within a few days by re-reading and annotating lecture notes to engage in deep learning. They will also be helped in this process through Structured non-synchronous discussions.
This is a very fundamental subject and it is therefore important that the learning materials are supported by plenty of examples and, if possible, by the animation software that interactively explains the workings of the algorithms. Students are expected to spend time on working out examples in their independent study hours and, in case of difficulties, raise questions during the structured non-synchronous discussion sessions which are generously fixed to be 10 in total.
Students aiming for 1st class marks are expected to widen their knowledge beyond the content of lecture notes through background reading.
Reading Lists
Assessment Methods
The format of resits will be determined by the Board of Examiners
Exams
| Description | Length | Semester | When Set | Percentage | Comment |
|---|---|---|---|---|---|
| Written Examination | 90 | 1 | A | 100 | Closed book exam |
Formative Assessments
Formative Assessment is an assessment which develops your skills in being assessed, allows for you to receive feedback, and prepares you for being assessed. However, it does not count to your final mark.
| Description | Semester | When Set | Comment |
|---|---|---|---|
| Prob solv exercises | 1 | M | Problem Solving Exercises: (set end of 6th and 9th lectures) |
Assessment Rationale And Relationship
The assessment (both summative and formative), assess the knowledge of techniques and theory presented in lectures and also application skills in the context of a more realistic and open-ended problems.
Timetable
- Timetable Website: www.ncl.ac.uk/timetable/
- CSC8103's Timetable
Past Exam Papers
- Exam Papers Online : www.ncl.ac.uk/exam.papers/
- CSC8103's past Exam Papers
General Notes
N/A
Welcome to Newcastle University Module Catalogue
This is where you will be able to find all key information about modules on your programme of study. It will help you make an informed decision on the options available to you within your programme.
You may have some queries about the modules available to you. Your school office will be able to signpost you to someone who will support you with any queries.
Disclaimer
The information contained within the Module Catalogue relates to the 2024 academic year.
In accordance with University Terms and Conditions, the University makes all reasonable efforts to deliver the modules as described.
Modules may be amended on an annual basis to take account of changing staff expertise, developments in the discipline, the requirements of external bodies and partners, and student feedback. Module information for the 2025/26 entry will be published here in early-April 2025. Queries about information in the Module Catalogue should in the first instance be addressed to your School Office.