Assignment3 - Department of Computer Science University of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Department of Computer Science University of Minnesota, Twin Cities CSci 5103 - Operating Systems -- Fall 2010 (Instructor: Tripathi) Assignment 3 Due Date: October 12, 2010 Problem 1: In case of Protocol 4 for two-process mutual exclusion, presented in LectureNotes 3, consider the case when both processes are concurrently competing to enter the critical section. One of them would succeed and the other would be forced to busy wait in the entry section of the protocol. Is it possible for the process that succeeds in entering the critical section first to complete its critical section execution, immediately make another attempt for the critical section, and then once again succeed before the other process that has been busy waiting? If yes, then show the sequence of execution steps of the two processes. If not, explain how that is prevented from happening. Now consider Protocol 5 (also known as Peterson’s protocol), and answer the above question. Problem 2: Show how counting semaphores (i.e. semaphores that can hold an arbitrary positive integer value) can be implemented using binary semaphores . Problem 3:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

Assignment3 - Department of Computer Science University of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online