SlideShare una empresa de Scribd logo
1 de 2
ADVANCED OPERATING SYSTEMS
PART A (10*2=20 marks)
1. Mention the functions of operating systems?
2. Why does the interrupt disable method to achieve mutual exclusion not work for multi-
processor systems?
3. State the purpose of control site in completely centralized deadlock detection?
4. How does Lamport’s algorithm guarantee mutual exclusion?
5. Sender-initiated algorithms cause system instability at high system loads. Predict
analytically at what system load the instability will occur. Assume probe limit is 5,
average service requirement of a task is 1 second, overhead incurred by a processor to
poll or to reply to a poll is 3 milliseconds.
6. Why is mapping function required in the central server algorithm?
7. Differentiate between forward error and backward error recovery?
8. Define global atomicity. Give an example.
9. List out the issues in pre-processor scheduling that causes performance degradation in
multi-processor systems?
10. Write the difference between tightly coupled systems and loosely coupled systems
with an example.
PART B-(5*16=80 MARKS)
11. (a) 1) Describe bankers algorithm for deadlock avoidance with supporting example?
(8)
2) Consider a computer system which has four identical units of a resource R.
There are three processes each with a maximum claim of two units of resource R.
Processes can request these resources in any way, that is, two in one shot or one
by one. The system always satisfies a request if enough resources are available. If
the process does not request any other kind of resource, show that the system
never deadlocks. (8)
OR
(b) Give a solution for the following synchronization problems using semaphores.
1) Producer-Consumer problem (8)
2) Readers-Writers problem (8)
12. (a) Discuss in detail about the communication models that provide communication
primitives. (16)
OR
(b) Consider the following scheme to reduce message traffic in distributed deadlock
detection:Transactions are assigned unique priorities, and an antagonistic conflict
occurs when a transaction waits for a data object that is locked by a lower priority
transaction. Deadlock detection is initiated only when an antagonistic conflict occurs.
When a writing transaction receives a probe that is initiated by a lower priority
transaction, the probe is discarded.
1) Determine the number of messages exchange to detect a deadlock in the “best
case” (4)
2) Determine the number of messages exchange to detect a deadlock in the
“average case” (4)
3) Determine the number of messages exchange to detect a deadlock in the
“worst case” (4)
4) Determine the saving (in %) in the average number of messages exchange
under this message traffic reduction scheme as compared to when no such is
used. (4)
13. (a) 1) With a neat diagram explain the architecture and data access of a distributed
system. (8)
2) Predict the performance of the receiver initiated load sharing algorithm when
the entire system work load is generated at only a few nodes in the system instead of
equally at all nodes in the system. (8)
OR
(b) Describe about the distributed shared memory. Explain the algorithm that are
developed for implementing the DSM. (16)
14. (a) 1) Define live locks. What is the difference between a deadlock and live lock?(6)
2) Explain the asynchronous check pointing recovery method and give an
example where the recovery algorithm will need to execute for [N] iterations
where [N] is the number of processors in the system. (10)
OR
(b) Design a de-centralized two-phase commit protocol.
1) Where no site is designated to be a coordinator. (8)
2) Which uses only O ( √N )messages where N is the number of sites in the system.
(8)
15. (a) 1) Can the performance of a multi-processor system with two processors be worse
than the performance of a uni-processor (with an identical CPU)? Explain the answer
with an example. (8)
2) A task consists of several subtasks. If these communicate synchronously with
each other frequently which scheduling policy will suit for this scenario and why? (8)
OR
(b) Discuss in detail about the lightweight process and its different levels. Write its
advantages, disadvantages and performance of supporting lightweight process at these
levels. (16)

Más contenido relacionado

Similar a 1aos

IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docxIFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
scuttsginette
 
Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...
Damir Delija
 
Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...
Damir Delija
 
Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...
Damir Delija
 

Similar a 1aos (20)

LATENCY-AWARE WRITE BUFFER RESOURCE CONTROL IN MULTITHREADED CORES
LATENCY-AWARE WRITE BUFFER RESOURCE  CONTROL IN MULTITHREADED CORESLATENCY-AWARE WRITE BUFFER RESOURCE  CONTROL IN MULTITHREADED CORES
LATENCY-AWARE WRITE BUFFER RESOURCE CONTROL IN MULTITHREADED CORES
 
LATENCY-AWARE WRITE BUFFER RESOURCE CONTROL IN MULTITHREADED CORES
LATENCY-AWARE WRITE BUFFER RESOURCE CONTROL IN MULTITHREADED CORESLATENCY-AWARE WRITE BUFFER RESOURCE CONTROL IN MULTITHREADED CORES
LATENCY-AWARE WRITE BUFFER RESOURCE CONTROL IN MULTITHREADED CORES
 
Latency aware write buffer resource
Latency aware write buffer resourceLatency aware write buffer resource
Latency aware write buffer resource
 
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docxIFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
 
Rip and OSPF assignment (RIP ба OSPF дасгал ажил)
Rip and OSPF assignment (RIP ба OSPF дасгал ажил)Rip and OSPF assignment (RIP ба OSPF дасгал ажил)
Rip and OSPF assignment (RIP ба OSPF дасгал ажил)
 
8th Semester Computer Science (2013-June) Question Papers
8th Semester Computer Science (2013-June) Question Papers8th Semester Computer Science (2013-June) Question Papers
8th Semester Computer Science (2013-June) Question Papers
 
Es 2 mark
Es 2 markEs 2 mark
Es 2 mark
 
Software architecture for data applications
Software architecture for data applicationsSoftware architecture for data applications
Software architecture for data applications
 
An Index-first Addressing Scheme for Multi-level Caches
An Index-first Addressing Scheme for Multi-level CachesAn Index-first Addressing Scheme for Multi-level Caches
An Index-first Addressing Scheme for Multi-level Caches
 
Chapter 2B-Communication.ppt
Chapter 2B-Communication.pptChapter 2B-Communication.ppt
Chapter 2B-Communication.ppt
 
Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...
 
Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...
 
Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...Communication network simulation on the unix system trough use of the remote ...
Communication network simulation on the unix system trough use of the remote ...
 
Distribute Storage System May-2014
Distribute Storage System May-2014Distribute Storage System May-2014
Distribute Storage System May-2014
 
Summary of Simultaneous Multithreading: Maximizing On-Chip Parallelism
Summary of Simultaneous Multithreading: Maximizing On-Chip ParallelismSummary of Simultaneous Multithreading: Maximizing On-Chip Parallelism
Summary of Simultaneous Multithreading: Maximizing On-Chip Parallelism
 
ICT III - MPMC - Answer Key.pdf
ICT III - MPMC - Answer Key.pdfICT III - MPMC - Answer Key.pdf
ICT III - MPMC - Answer Key.pdf
 
1.multicore processors
1.multicore processors1.multicore processors
1.multicore processors
 
Higher Homework
Higher HomeworkHigher Homework
Higher Homework
 
Multiprocessors(performance and synchronization issues)
Multiprocessors(performance and synchronization issues)Multiprocessors(performance and synchronization issues)
Multiprocessors(performance and synchronization issues)
 
parallel Questions & answers
parallel Questions & answersparallel Questions & answers
parallel Questions & answers
 

Último

FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
dollysharma2066
 
Top Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoor
Top Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoorTop Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoor
Top Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoor
dharasingh5698
 
VIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 Booking
dharasingh5698
 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
ssuser89054b
 
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak HamilCara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Kandungan 087776558899
 

Último (20)

Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...
Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...
Navigating Complexity: The Role of Trusted Partners and VIAS3D in Dassault Sy...
 
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
 
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
 
Minimum and Maximum Modes of microprocessor 8086
Minimum and Maximum Modes of microprocessor 8086Minimum and Maximum Modes of microprocessor 8086
Minimum and Maximum Modes of microprocessor 8086
 
Generative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPTGenerative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPT
 
DC MACHINE-Motoring and generation, Armature circuit equation
DC MACHINE-Motoring and generation, Armature circuit equationDC MACHINE-Motoring and generation, Armature circuit equation
DC MACHINE-Motoring and generation, Armature circuit equation
 
Top Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoor
Top Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoorTop Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoor
Top Rated Call Girls In chittoor 📱 {7001035870} VIP Escorts chittoor
 
Unit 2- Effective stress & Permeability.pdf
Unit 2- Effective stress & Permeability.pdfUnit 2- Effective stress & Permeability.pdf
Unit 2- Effective stress & Permeability.pdf
 
VIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Palanpur 7001035870 Whatsapp Number, 24/07 Booking
 
Unleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leapUnleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leap
 
(INDIRA) Call Girl Bhosari Call Now 8617697112 Bhosari Escorts 24x7
(INDIRA) Call Girl Bhosari Call Now 8617697112 Bhosari Escorts 24x7(INDIRA) Call Girl Bhosari Call Now 8617697112 Bhosari Escorts 24x7
(INDIRA) Call Girl Bhosari Call Now 8617697112 Bhosari Escorts 24x7
 
Block diagram reduction techniques in control systems.ppt
Block diagram reduction techniques in control systems.pptBlock diagram reduction techniques in control systems.ppt
Block diagram reduction techniques in control systems.ppt
 
Thermal Engineering-R & A / C - unit - V
Thermal Engineering-R & A / C - unit - VThermal Engineering-R & A / C - unit - V
Thermal Engineering-R & A / C - unit - V
 
chapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineeringchapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineering
 
University management System project report..pdf
University management System project report..pdfUniversity management System project report..pdf
University management System project report..pdf
 
2016EF22_0 solar project report rooftop projects
2016EF22_0 solar project report rooftop projects2016EF22_0 solar project report rooftop projects
2016EF22_0 solar project report rooftop projects
 
Unit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdfUnit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdf
 
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
 
Double Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torqueDouble Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torque
 
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak HamilCara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil
 

1aos

  • 1. ADVANCED OPERATING SYSTEMS PART A (10*2=20 marks) 1. Mention the functions of operating systems? 2. Why does the interrupt disable method to achieve mutual exclusion not work for multi- processor systems? 3. State the purpose of control site in completely centralized deadlock detection? 4. How does Lamport’s algorithm guarantee mutual exclusion? 5. Sender-initiated algorithms cause system instability at high system loads. Predict analytically at what system load the instability will occur. Assume probe limit is 5, average service requirement of a task is 1 second, overhead incurred by a processor to poll or to reply to a poll is 3 milliseconds. 6. Why is mapping function required in the central server algorithm? 7. Differentiate between forward error and backward error recovery? 8. Define global atomicity. Give an example. 9. List out the issues in pre-processor scheduling that causes performance degradation in multi-processor systems? 10. Write the difference between tightly coupled systems and loosely coupled systems with an example. PART B-(5*16=80 MARKS) 11. (a) 1) Describe bankers algorithm for deadlock avoidance with supporting example? (8) 2) Consider a computer system which has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in any way, that is, two in one shot or one by one. The system always satisfies a request if enough resources are available. If the process does not request any other kind of resource, show that the system never deadlocks. (8) OR (b) Give a solution for the following synchronization problems using semaphores. 1) Producer-Consumer problem (8) 2) Readers-Writers problem (8) 12. (a) Discuss in detail about the communication models that provide communication primitives. (16) OR (b) Consider the following scheme to reduce message traffic in distributed deadlock detection:Transactions are assigned unique priorities, and an antagonistic conflict occurs when a transaction waits for a data object that is locked by a lower priority transaction. Deadlock detection is initiated only when an antagonistic conflict occurs. When a writing transaction receives a probe that is initiated by a lower priority transaction, the probe is discarded.
  • 2. 1) Determine the number of messages exchange to detect a deadlock in the “best case” (4) 2) Determine the number of messages exchange to detect a deadlock in the “average case” (4) 3) Determine the number of messages exchange to detect a deadlock in the “worst case” (4) 4) Determine the saving (in %) in the average number of messages exchange under this message traffic reduction scheme as compared to when no such is used. (4) 13. (a) 1) With a neat diagram explain the architecture and data access of a distributed system. (8) 2) Predict the performance of the receiver initiated load sharing algorithm when the entire system work load is generated at only a few nodes in the system instead of equally at all nodes in the system. (8) OR (b) Describe about the distributed shared memory. Explain the algorithm that are developed for implementing the DSM. (16) 14. (a) 1) Define live locks. What is the difference between a deadlock and live lock?(6) 2) Explain the asynchronous check pointing recovery method and give an example where the recovery algorithm will need to execute for [N] iterations where [N] is the number of processors in the system. (10) OR (b) Design a de-centralized two-phase commit protocol. 1) Where no site is designated to be a coordinator. (8) 2) Which uses only O ( √N )messages where N is the number of sites in the system. (8) 15. (a) 1) Can the performance of a multi-processor system with two processors be worse than the performance of a uni-processor (with an identical CPU)? Explain the answer with an example. (8) 2) A task consists of several subtasks. If these communicate synchronously with each other frequently which scheduling policy will suit for this scenario and why? (8) OR (b) Discuss in detail about the lightweight process and its different levels. Write its advantages, disadvantages and performance of supporting lightweight process at these levels. (16)