329 Computer Systems Structures
In this course students will learn the basics of operating systems, including
the creation, management, and scheduling of threads and processes; process
communication and synchronization; memory management; file systems; and
I/O. Programming assignments connect the theory with practice and enable
students to further develop their programming skills.
||introduction / overview (1.1-1.11)||
||C/C++ programming languages and tools||
assignment #1 (9/5 F)|
||processes and threads (2.1-2.2)||
||thread synchronization (2.3-2.4)||
assignment #2 (9/19 F)|
||memory management (4.1-4.2)||
midterm (10/3 F)|
||virtual memory: paging and segmentation (4.3, 4.8)||
||page replacement algorithms (4.4-4.7)||
assignment #3 (10/22 W)|
||file systems (6.1-6.4)||
assignment #4 (11/7 F)|
||multiprocessor systems (8.1-8.3)||
||Unix / Linux (10.1-10.8)||
assignment #5 (11/25 T)|
||Windows / IA-32 (11.1-11.10)||
assignment #6 (12/5 F)|
final exam (12/11 Th, 11:30 - 2:00)|
- Textbook: A. S. Tanenbaum, Modern Operating Systems,
3rd edition, Prentice Hall, 2008.
current students (restricted access, not open to the public)
To gain practical experience with the principles of the course, you will implement several assignments
in C/C++. As shown in the grading chart, code will be graded on whether it compiles, runs, produces the
expected behavior, is well documented, and and is written cleanly. Your
code must compile and run on Visual C++ 6.0 SP6.
To turn in your assignment, send an email to
firstname.lastname@example.org (and cc the instructor and grader) with the subject line "ECE329-1,#n" (without
quotes but with the # sign), where 'n' is the assignment number. You may leave the body of the
email blank. Attach
a zip file containing a readme.txt file (listing the names of the files in your
project along with a brief description of how to run your code and what output
should be expected), and all of the files needed to compile your project (such
as *.h, *.c, *.cpp, *.rc, *.dsp, *.dsw; do not include *.ncb, *.opt, *.plg,
*.aps, or the res, Debug, or Release directories). You must send this
email from your Clemson account, because the assign server is not smart enough
to know who you are if you use another account. (E.g., do not use @g.clemson.edu) Be sure that this file is actually
attached to the email rather than being automatically included in the body of
the email (Eudora, for example, has been known include files inline, but this
behavior can be
turned off). Also, be sure to change the extension of your zip file
(e.g., change .zip to _zip) so that the server does not block
the attachment!!! We cannot grade what we do not receive. (Also be
sure that you're not hiding extensions for known types; in Windows explorer,
uncheck the box "Tools.Folder Options.View.Hide extensions for known file
- Assignment #1 (simulated Unix shell)
Note: Normally Unix suspends the background process if it tries to print
to stdout. For simplicity, override this behavior and instead allow
background processes to print. Also, be sure to flush the output whether
you're using printf or cout.
Note: If you're using cout instead of printf, you need to call
cout.flush() or cout << flush or cout << endl to make sure that the buffer
flushes, to avoid collisions between the threads.
Note: It is okay to hardcode the timezone if you cannot get
strftime to give you an abbreviated string.
Note: For pi, do not worry about handling number of iterations greater
Sample executable: hw1_unixshell.exe
- Assignment #2 (simulated hard drive)
Note: When you format the simulated hard disk, you should set all
bytes to zero. The size of the "disk" is up to you, with 64kB being a
Note: You may find the fseek() function helpful.
Note: You will need to use CreateSemaphore, and you will not need
Note: The member variables are public on purpose. While
this is not good programming practice in general, it serves the purpose of
making the simulated hard disk look like a real device with lines that can be
set to high or low, thereby forcing the simulated hard disk to run in a
Clarification: On problem 5 of Chapter 2, the phrasing is
ambiguous. The question should read, "How long will they take to
complete ..." In other words, you should calculate the total time for
both process to complete, from the start of the first process to the end of
the second process.
Note: Be sure to wrap your header file with a header guard:
Sample executable: hw2_harddisk.exe
Future: Should change name from FormatHardDisk to CreateHardDisk.
- Assignment #3 (simulated file system)
Note: It is recommended that you create a struct/class called
Inode that handles all the data for an i-node, and a struct/class called
InodeList that contains the array of i-nodes. You can ensure that your
data structure in memory is synchronized with the hard disk if you read the
hard disk when you mount the device and when the user passes the currently
mounted device to mkfs, and if you write every change immediately to the disk.
Then you can simply access the copy in memory rather than reading from the
disk every time.
Note: You should *not* modify SimulatedHardDisk.h in any way.
Note: To implement mkfs, you can either
Sample executable: hw3_filesystem.exe
- use an old-fashioned FILE* with fwrite, or
- do not format it at all (just create it), then when you first mount
a file system check whether it has been formatted -- if not, then format it
- temporarily set the device of the SimulatedHardDisk to the one that you
are formatting, then write out your superblock and inodes, then set the device
back to the current one. To make this feasible, the new version of
SimulatedHardDisk.obj allows SetDevice("") to be called with the empty string.
- Assignment #4 (written questions only)
- Assignment #5 (move and copy files)
Note: If the destination file already exists, then mv should just
print the error, 'File already exists.' Similarly, if the destination
file already exists, then cp should ask the user whether to overwrite the
file. Both commands should check permissions.
Sample executable: hw5_cpmv.exe
- Assignment #6 (written questions only)
Instructor: Stan Birchfield, 207-A Riggs Hall, 656-5912, email: stb at clemson
Office hours: 2:00-4:00pm, F, or by appointment
Grader: Vidya Murali, 015 Riggs Hall, vmurali at clemson
Lectures: 8:00-9:00am MWF, 223 Riggs Hall