In this assignment, we give you part of a working thread system; your job is to complete it, and then to use it to solve a synchronization problem.
The first step is to read and understand the partial thread system we have written for you. This thread system implements thread fork, thread completion, along with semaphores for synchronization. Build and run the program ./nachos for a simple test of our code. Trace the execution path (by hand) for the simple test case we provide.
When you trace the execution path, it is helpful to keep track of the state of each thread and which procedures are on each thread's execution stack. You will notice that when one thread calls switch, another thread starts running, and the first thing the new thread does is to return from switch. We realize this comment will seem cryptic to you at this point, but you will understand threads once you understand why the switch that gets called is different from the switch that returns. (Note: because gdb does not understand threads, you will get bizarre results if you try to trace in gdb across a call to switch.)
The files for this assignment are:
Properly synchronized code should work no matter what order the scheduler chooses to run the threads on the ready list. In other words, we should be able to put a call to Thread::Yield (causing the scheduler to choose another thread to run) anywhere in your code where interrupts are enabled without changing the correctness of your code. You will be asked to write properly synchronized code as part of the later assignments, so understanding how to do this is crucial to being able to do the project.
To aid you in this, code linked in with Nachos will cause Thread::Yield
to be called on your behalf in a repeatable but unpredictable way.
Nachos code is repeatable in that if you call it repeatedly with the
same arguments, it will do exactly the same thing each time.
However, if you invoke
nachos -rs #, with a different number each
time, calls to Thread::Yield will be inserted at different places in the code.
Make sure to run various test cases against your solutions to these problems; for instance, for part three, create multiple producers and consumers and demonstrate that the output can vary, within certain boundaries.
Warning: in our implementation of threads, each thread is assigned a small,
fixed-size execution stack. This may cause bizarre problems (such as
segmentation faults at strange lines of code) if you declare large data
structures to be automatic variables (e.g.,
int buf;). You
will probably not notice this during the semester, but if you do, you may
change the size of the stack by modifying the StackSize define in switch.h.
Although the solutions can be written as normal C routines, you will find organizing your code to be easier if you structure your code as C++ classes. Also, there should be no busy-waiting in any of your solutions to this assignment.
Semaphore::P(). Coupled with this, it is important to maintain the correctness of value. The key is in understanding what value's value should be if a waiting thread is released by a signaling thread.
The producer places characters from the string "Hello world" into the buffer one character at a time; it must wait if the buffer is full. The consumer pulls characters out of the buffer one at a time and prints them to the screen; it must wait if the buffer is empty. Test your solution with a multi-character buffer and with multiple producers and consumers. Of course, with multiple producers or consumers, the output display will be gobbledygook; the point is to illustrate.