CSCE 410 / CSCE 611 -- Operating Systems: Homeworks

In this page you will find information about homeworks.

Homeworks assignments will be typically announced by e-mail. See below for information about how to submit your homework solutions.

You are to submit your homeworks through the department's turn-in system. Proceed as follows:

Log into http://csnet.cs.tamu.edu. (You may need to establish a VPN connection first; not sure.)
Follow the "My Courses" link.
Select CSCE 410 or CSCE 611 from the given list of courses. you will see the class information and buttons for turn-in.
Use the buttons to upload your files.
NOTE: Subsequent submissions overwrite your earlier submissions for the same assignment!!
If you have more than one file to submit, compress them into one file using tar or zip.

For this homework, attack the following problems in the textbook (Doeppner).

Chapter 7, Exercise 1
Chapter 7, Exercise 7
Chapter 7, Exercise 14
(from Silberschatz) Assume you have a demand-paged memory. The page table is held in registers. It takes 8 milliseconds to service a page fault if an empty frame is available or if the replaced pages is not modified and 20 milliseconds if the replaced pages is modified. Memory-access time is 100 nanoseconds. Assume that the page to be replaced is modified 70 percent of the time. What is the maximum acceptable page-fault rate for an effective access time of no more than 200 nanoseconds?
Chapter 5, Exercise 1
(from Silberschatz) Which of the following components of a program state are shared across threads in a multithreaded system?
- Register values
- Heap memory
- Global variables
- Stack memory
(from Silberschatz) Consider a multiprocessor system and a multithreaded program written using light-weight processes as described in class (no scheduler activations!). Let the number of user-level threads in the program be more than the number of processors in the system. Discuss the performance implications of the following scenarios:
- The number of kernel threads allocated ot the program is less than the number of processors.
- The number of kernel threads allocated to the program is equal to the number of processors.
- The number of kernel threads allocated to the program is greater than the number of processors but less than the number of user-level threads.

For this review/homework, attack the following problems in the Doeppner book.