PAHSU · Final Year B.Tech. Computer Science and Engineering · NEP 2020
Distributed Systems
CSEPEC-04C · Programme Elective IV · Semester VII · 4 credits · End-semester 100 only
One of the Programme Elective IV options. Programme Elective IV: examined by a 100-mark end-semester exam only.
Unit 1: Fundamentals
5 hoursOperating-system fundamentals; what a distributed system is; the evolution and models of distributed computing systems and why they are popular; design issues; the Distributed Computing Environment; the FLIP and VMTP protocols.
Examined in the 100-mark end-semester paper
- Distributed systems: goals and types
- Distributed computing system models and DCE
Unit 2: Message Passing
6 hoursDesirable features of a message-passing system; IPC issues: synchronisation, buffering, multi-datagram messages, process addressing and failure handling; the Message Passing Interface; group communication; case studies: RMI and CORBA.
Examined in the 100-mark end-semester paper
- Message passing: synchronisation, buffering and failure handling
- Group communication
- Remote method invocation
Unit 3: Remote Procedure Calls
7 hoursThe RPC model and its transparency; implementing RPC: stubs, messages, marshalling arguments and results; server management; parameter-passing and call semantics; communication protocols for RPC; client-server binding; exception handling and security.
Examined in the 100-mark end-semester paper
- RPC implementation: stubs, marshalling and binding
- RPC call semantics and parameter passing
Unit 4: Synchronization in Distributed Systems
6 hoursProcess migration and threads; clock synchronisation; event ordering; election algorithms; distributed consensus algorithms.
Examined in the 100-mark end-semester paper
- Process and code migration
- Clock synchronisation
- Logical and vector clocks
- Election algorithms
- Consensus: Paxos and Raft
Unit 5: Distributed Mutual Exclusion
5 hoursClassification of mutual exclusion algorithms; a simple solution; non-token-based algorithms: Lamport's and Ricart-Agrawala; token-based algorithms: Suzuki-Kasami's broadcast algorithm.
Examined in the 100-mark end-semester paper
- Distributed mutual exclusion
- Token-based mutual exclusion: Suzuki-Kasami and Raymond
Unit 6: Distributed Deadlock Detection
6 hoursDeadlock handling strategies in distributed systems; issues in detection and resolution; control organisations; centralised, distributed and hierarchical detection algorithms; avoidance and prevention.
Examined in the 100-mark end-semester paper
- Distributed deadlock detection
Unit 7: Distributed File Systems
6 hoursArchitecture of a distributed file system; mechanisms for building one and its design issues; log-structured file systems; case study: the Google File System.
Examined in the 100-mark end-semester paper
- Distributed file systems
- File caching and replication in distributed file systems
- Cloud applications and Google's GFS and BigTable
Unit 8: Distributed Shared Memory
6 hoursArchitecture and motivation; algorithms for implementing DSM; memory coherence and coherence protocols; design issues; case study: Linda.
Examined in the 100-mark end-semester paper
- Distributed shared memory
- Data-centric consistency models
Unit contents are summarised from the official PAHSU syllabus . AiCanCode.org is not affiliated with Punyashlok Ahilyadevi Holkar Solapur University (PAHSU).