Department of Computer Science

Department information

 

Operating Systems, Fall 2006, Homework 11

This homework will be covered in practise session on Thursday 30.11.2006 (week 48).

The exercises are based on chapters 14 and 15.

1. Problem 14.3. a) and b) from text book [Stal05, p. 640] (problem 13.3 [Stal01, p. 605])
   

2. Problem 14.3. c) and d) from text book [Stal05, p. 640] (problem 13.3 [Stal01, p. 605])
   

3. Clustering and Grid-computing (as defined at the end of Lecture 12)
   1. Give an example application that would be suitable for Beowulf Linux Cluster, but not for Windows 2000 Cluster Server. Why?
   2. Give an example application that would be suitable for clusters but not for grids. Why?
   3. Which synchronization primitives are suitable for SMP, but not for clusters? Why?
   4. Which synchronization primitives are suitable for clusters, but not for grids? Why?
      

4. Ordering of events
   1. Problem 15.2 from text book [Stal05, p. 676] (problem 14.2. [Stal01, p.644 ])
      
   2. Problem 15.3 from text book [Stal05, p. 676] (problem 14.3. [Stal01, p.644 ])
      

---

Tiina.Niklander@cs.helsinki.fi