Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Advanced Operating Systems Final Exam: CS 6/73201, Slides of Algorithms and Programming

California Institute of Technology (Caltech)Algorithms and Programming

With regard to mutual exclusion algorithms in a distributed environment, what are the main tradeoffs between centralized algorithms, ...

Typology: Slides

2022/2023

Uploaded on 05/11/2023

thehurts
thehurts 🇺🇸

4.5

(11)

219 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Name: _____________________________
1
CS 6/73201 Final Exam Advanced OS
Wednesday 12 May 1999
1. In what ways are remote procedure calls (RPCs) and CORBA (i) similar, and (ii) different?
(10 points)
2. Briefly explain the Berkeley algorithm for clock synchronization. If you do not remember this
algorithm, explain Christian’s algorithm for partial credit. (8 points)
3. With regard to mutual exclusion algorithms in a distributed environment, what are the main
tradeoffs between centralized algorithms, time-based algorithms such as Ricart and Agrawala’s
algorithm, and token-passing algorithms such as Le Lann’s token-ring algorithm? (12 points)
pf3
pf4

Partial preview of the text

Download Advanced Operating Systems Final Exam: CS 6/73201 and more Slides Algorithms and Programming in PDF only on Docsity!

CS 6/73201 Final Exam Advanced OS

Wednesday 12 May 1999

  1. In what ways are remote procedure calls (RPCs) and CORBA (i) similar, and (ii) different? (10 points)
  2. Briefly explain the Berkeley algorithm for clock synchronization. If you do not remember this algorithm, explain Christian’s algorithm for partial credit. (8 points)
  3. With regard to mutual exclusion algorithms in a distributed environment, what are the main tradeoffs between centralized algorithms, time-based algorithms such as Ricart and Agrawala’s algorithm, and token-passing algorithms such as Le Lann’s token-ring algorithm? (12 points)
  1. In the Byzantine Generals problem, there is one general and some number of lieutenants. Under the different conditions that may arise, what order should the various lieutenants, loyal or otherwise, agree on when they try to reach agreement? (6 points)
  2. Consider the second algorithm for centralized deadlock detection discussed in class. In one version of this algorithm, a central coordinator maintains a WFG for the system, and the other nodes send information to the coordinator at periodic intervals. What are the major disadvantages of this algorithm? (6 points)
  3. With regard to atomic transactions, briefly explain (i) static locking, and (ii) the advantages and disadvantages of that approach. (15 points)
  1. At the beginning of the semester, a “true” distributed operating system was defined as having a single operating system, or at least the feel of one. Given the topics discussed in this class, how close are we to developing a true distributed OS? Explain your answer, providing examples where appropriate. (20 points)