Computing Science Course Outlines

Course Outline - CMPT 431 - Distributed Systems

Information

Subject

Catalog Number

Section

Semester

Title

Instructor(s)

Campus

CMPT

431

D100

2022 Fall (1227)

Distributed Systems

Keval Vora   

Burnaby Mountain Campus

Calendar Objective/Description

Distributed Systems

Instructor's Objectives

The course aims to provide an understanding of principles involved in designing modern parallel and distributed software systems. It focuses on the fundamentals of parallel algorithm design and parallel programming techniques by covering key concepts like concurrency, synchronization, consistency models and fault tolerance.

Prerequisites

see go.sfu.ca

Topics

  • Principles of Parallel Algorithm Design
  • Shared Memory Programming
  • Distributed Memory Model & Programming
  • Consistency Models
  • Fault Tolerance
  • Scalable Analytics

Grading

Details about grading will be discussed in the first week of class.

Reference Books

  • The Art of Multiprocessor Programming, Maurice Herlihy and Nir Shavit, Elsevier/Morgan Kaufmann, 2012, 9780123977953
  • Distributed Computing: Principles, Algorithms, and Systems, Ajay D. Kshemkalyani and Mukesh Singhal, Cambridge University Press, 2008, 9780511805318

Academic Honesty Statement

Academic honesty plays a key role in our efforts to maintain a high standard of academic excellence and integrity. Students are advised that ALL acts of intellectual dishonesty will be handled in accordance with the SFU Academic Honesty and Student Conduct Policies ( http://www.sfu.ca/policies/gazette/student.html ).

Data Last Updated: