CST 334 - Week 2

 This week was all about process and process states.  The OS controls and schedules which processes will be run and when.  One way of scheduling processes is the first in, first out (FIFO) method.  To me personally, this method makes the most sense.  The first process started should be the first one to complete but that is not always the case.  Imagine if the first process took double or even triple the time it takes for the processes to start after it.  Another way of scheduling is to complete multiple processes using the Round Robbin method that runs each process for a specific time and then switches to the next.  This process is repeated until the processes are completed.  This can be beneficial for very short processes but as the process becomes larger, the turnaround becomes much longer.  These are just two of many methods of scheduling and as you can see they both have their pros and cons.

We also had some more hands-on practice with the command line.  This time was creating our first C program.  The purpose of this program was to introduce the fork method as well as how parent and child processes are run.  The program took a command line argument (time in milliseconds) when executing to show a delay between a parent and child process output.  We also created a makefile that compiled our two programs using the gcc compiler and sent the output to a file.

Comments

Popular posts from this blog

CST 499 - Week 10

CST 438 - Week 7

CST 438 - Week 3