CYCLE-1 programs
1. Implement the following CPU
Scheduling Algorithms.
i). FCFS
ii) SJF [ Preemptive and Non Preemptive ]
iii) Priority
iv) Round Robin
2. Implement the Mutual Exclusion
Problem Using Dekker’s Algorithm.
3. Implement Process Synchronization concepts
(Producer-Consumer / Reader- Writer Problem)
Using Semaphores.
4. Implement Best fit, First Fit
Algorithm for Memory Management.
5. Implement Memory Allocation
with Pages.
6. Implement FIFO page
Replacement Algorithm.
7. Implement LRU page Replacement
Algorithm.
8. Implement the creation of
Shared memory Segment.
9. Implement File
Locking.[12/08/10]
10. Implement Banker’s algorithm
[12/08/10]
CYCLE -2 Programs
11 . Write a Program to
illustrate the concept of Lamport Logical
Clock [ Integer Clock Model ]
12. Write a Program to illustrate
the concept of Vector Clock [ Integer Vector
Clock Model
13. Implement the Birman Schiper
Stephenson [BSS] Protocol for the casual ordering of Messages.
14. Write a Program to Provide
Mutual Exclusion in the Distributed Environment using Non Token Based
Algorithms.
a) Lamports Alogrithm
b) Ricart Agrawala Algorithm
c) Maekawa's Algorithm
14. Write a Program to Provide
Mutual Exclusion in the Distributed Environment using Token Based
Algorithms.
a) Suzuki Kasami Algorithm
b) Raymonds Algorithm
c) Singhal's heuristic
Alogrithm
0 comments
Post a Comment