JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III ADVANCED OPERATING SYSTEMS Previous Question Paper (February - 2022 - R18)
Answer any five questions
All questions carry equal marks
Main
Explain the design issues in distributed operating system.
Answer
The design of a distributed operating system (DOS) involves addressing several fundamental challenges to ensure transparency, efficiency, and reliability across interconnected nodes:
- Transparency: The system should hide the distributed nature of the hardware and software from the user, providing location, migration, replication, and concurrency transparency.
- Reliability and Fault Tolerance: Since nodes can fail independently, the system must detect failures and recover gracefully through redundancy, checkpointing, or atomic transactions.
- Scalability: The architecture must handle growth in the number of nodes or users without significant performance degradation, often requiring decentralized control and avoiding bottlenecks.
- Communication Models: Choosing between message passing or Remote Procedure Calls (RPC) is critical for inter-process communication, balancing latency and ease of programming.
- Resource Management: Efficient scheduling and load balancing are required to distribute tasks across nodes to maximize resource utilization.
- Synchronization and Deadlock: Managing distributed mutual exclusion and preventing deadlocks in a system without global state requires complex algorithms like token passing or logical clocks.
Compare vector Vs logical clocks.
Answer
Vector clocks and logical clocks (Lamport clocks) are mechanisms used to order events in distributed systems where a global physical clock is unavailable.
| Feature | Logical Clocks (Lamport) | Vector Clocks |
|---|---|---|
| Mechanism | Single integer counter per process. | Array of integers (one per process). |
| Ordering | Provides partial ordering (if a -> b, then C(a) < C(b)). | Provides partial ordering and captures causality (if C(a) < C(b), then a -> b). |
| Causality | Cannot determine if two events are concurrent. | Can precisely determine causality and concurrency. |
| Overhead | Low (single integer). | High (size proportional to number of processes). |
While logical clocks only track the happens-before relationship in one direction, vector clocks provide a complete representation of causal history, allowing the system to detect if two events are concurrent by comparing the vector entries.
Describe message passing communication model.
Answer
Sign in to view the complete answer paper.
Explain any one termination detection algorithm.
Answer
Sign in to view the complete answer paper.
Explain the steps to achieve mutual exclusion using token based algorithms.
Answer
Sign in to view the complete answer paper.
State and explain Shingal’s Mutual exclusion algorithm.
Answer
Sign in to view the complete answer paper.
Explain the properties and performance of Lamport’s Mutual exclusion algorithm.
Answer
Sign in to view the complete answer paper.
Write Lamport’s algorithm for mutual exclusion.
Answer
Sign in to view the complete answer paper.
Discuss the issues in deadlock detection in distributed systems.
Answer
Sign in to view the complete answer paper.
Explain edge chasing algorithm for dead lock detection.
Answer
Sign in to view the complete answer paper.
Explain hierarchical deadlock detection algorithm.
Answer
Sign in to view the complete answer paper.
Explain the deadlock handling strategies in distributed systems.
Answer
Sign in to view the complete answer paper.
Give note on process synchronization in multiprocessor operating system.
Answer
Sign in to view the complete answer paper.
Describe the architecture of distributed file system.
Answer
Sign in to view the complete answer paper.
Explain full replication algorithms for distributed shared memory.
Answer
Sign in to view the complete answer paper.
Explain components of load distributing algorithms.
Answer
Sign in to view the complete answer paper.