TDC 311 Homework #6

1. Using the bounded buffer producer/consumer problem, what would be the result if you switched the two statements: wait(e); wait(s); in the producer, to: wait(s); wait(e); 2. What if you switched the signal(s) and signal(n) statements? 3. Consider the following set of processes: Process Name 1 2 3 4 5 Arrival Time 0 1 3 9 12 Processing Time 3 5 2 5 5

Perform the same analysis as demonstrated in class (Finish Time, Turnaround Time Tq, Normalized Turnaround Time Tq/Ts, average Normalized Turnaround Time, and the time-line chart or >Gantt Chart=) for each of the following scheduling algorithms: FCFS Shortest Job First Shortest Remaining Time Round Robin q=1 Round Robin q=4 4. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 3, 5, 4, 3, 6, 4, 7, 4, 6, 3, 2, 1, 3, 6 How many page faults would occur for the following page replacement algorithms, assuming there are three available frames? Remember all frames are initially empty, and use pure-demand paging (count all page faults). FIFO replacement LRU replacement Optimal replacement

5. Modify the directory in Table 12-1 and the storage allocation table in Table 12-2 to store a new file containing seven allocation units. Both tables appear in the lecture slides. 6. Assume the first character of the filename in a deleted files directory entry is overwritten with an ASCII 0 to mark the file as deleted. Write a step-by-step procedure for undeleting a deleted file, assuming that no file operations have been performed since the deletion. 7. Investigate the storage area network and network-attached storage products of a major computer system vendor such as IBM, Hewlett-Packard, or Dell. What are the approximate costs of each type of server configured to store 2 terabytes of data and respond to requests from 8 other servers? Which type of device provides higher storage access performance? Which type of device is easier to configure and administer?