R23
CSE · 3-2
✓ VERIFIED VS. PUBLISHED SYLLABUS 2026-07-09
Distributed Operating System
JNTUK R23 · CSE · semester 3-2 · syllabus
This JNTUK R23 professional elective is listed for Computer Science and Engineering (CSE). It is listed in semester 3-2. It carries 3 credits. The published coverage runs across 5 units, from Fundamentals and Message Passing through Distributed File Systems.
Verified vs. published syllabus
Checked 9 Jul 2026
SOURCE DOCKET
Published evidence
✓ Verified
Checked 9 Jul 2026
Record 5 published units
Verification scope Subject name, credits, unit-wise syllabus, and course outcomes are sourced directly from JNTUK's own official R23 course structure and syllabus document, not an autonomous college's adaptation.
5 units, from Fundamentals and Message Passing to Distributed File Systems. Tick off units as you cover them — your progress stays on this device.
Unit-wise syllabus
0 / 5 COVERED
UNIT 01 — Fundamentals and Message Passing
What is a distributed computing system? Evolution and models of distributed computing systems · What is a distributed operating system? Issues in designing a distributed OS; introduction to DCE · Desirable features of a good message passing system; issues in IPC by message passing · Synchronization, buffering, multi-datagram messages, encoding and decoding of message data · Process addressing, failure handling, group communication; case study: 4.3 BSD UNIX IPC mechanism
UNIT 02 — Remote Procedure Calls
The RPC model, transparency of RPC, implementing RPC mechanism, stub generation · RPC messages, marshaling arguments and results, server management, parameter-passing semantics · Call semantics, communication protocols for RPCs, complicated RPCs, client-server binding · Exception handling, security, special types of RPCs, RPC in heterogeneous environments · Lightweight RPC, optimization for better performance; case study: Sun RPC
UNIT 03 — Distributed Shared Memory and Synchronization
General architecture of DSM systems; design and implementation issues of DSM; granularity · Structure of shared memory space, consistency models, replacement strategy, thrashing · Other approaches to DSM; heterogeneous DSM; advantages of DSM · Clock synchronization, event ordering, mutual exclusion, deadlock, election algorithms
UNIT 04 — Resource and Process Management
Desirable features of a good global scheduling algorithm · Task assignment approach, load-balancing approach, load-sharing approach · Process management: process migration · Threads
UNIT 05 — Distributed File Systems
Desirable features of a good distributed file system; file models · File-accessing models; file-sharing semantics · File-caching schemes; file replication · Fault tolerance, atomic transactions and design principles