Distributed SystemsFDA142, 2005VT
|
|
Course plan
Lectures
24 hours
Recommended for
Doctoral students in computer science.
The course was last given
2002
Goals
The course presents modern theories and principles for distributed systems together with an overview of techniques, algorithms and tools used for implementing distributed systems.
Prerequisites
Computation II
Contents
- Characteristics of distributed systems
- Models of distributed systems
- Middleware and Case study: CORBA
- Time and state: global states, logical clocks, causality and time
- Fundamental algorithms: mutual exclusion and election, termination
detection, distributed routing algorithms
- Real-time distributed systems: clock synchronization, real-time
communication, scheduling and schedulability analysis in distributed systems
- Fault tolerance in distributed systems: replication, fault tolerance in
asynchronous and synchronous systems, stabilization
Organized by
Department of Computer Science, Högskolan i Skövde
Department of Computer Science, Linköping University
Literature
Coulouris, J. Dollimore, T. Kindberg: "Distributed Systems - Concepts and
Design" 3rd Edition, Addison Wesley, 2001
2.Research articles
Lecturers
Sten F. Andler, Petru Eles
Examiner
Sten F. Andler, Petru Eles
Examination
Written exam.
Credit
3 credits
Comments
The course is given in an intensive format ("crash course") at a conference facility.
Course web page
http://www.ida.liu.se/cugs/CCC-DistributedSystems
Page responsible: Anne Moe