next up previous
Next: About this document ...

Computer Science 338 - Homework/Lab 3
due: 9:55 AM, Thursday, September 28, 2000

1.
Log in to your account on the SGI Origin 2000 at NCSA. Run the MPI and pthread hello world programs.

2.
Andrews, Exercise 3.3(a)

3.
In class, we looked at the algorithm below which implements a counting semaphore using a binary semaphore. What does the binary semaphore S3 do?

4.
Andrews, Exercise 3.12

5.
In class, we looked at the Bakery Algorithm, shown below. What would happen is the choosing flags were eliminated? Which of the required properties of a solution to the critical section problem would this still satisfy?



 

Jim Teresco
2000-09-21