Professor Allan Gottlieb
Lab 2 (Short-term CPU) Scheduling
OS: 2012-13 Fall
In this lab you will simulate scheduling in order to see how the time required depends on the scheduling algorithm and the request patterns. The lab is due in 2 weeks.
A process i
1.1 What is an operating system?
As mentioned above, the OS raises the abstraction level by providing a higher level
virtual machine. A second related key objective for the OS is to manage the resources
provided by this virtual machine.
1.1.1 The Operatin
1.3 Computer Hardware Review
The picture above is very simplified. (For one thing, today separate buses are used to
Memory and Video.)
A bus is a set of wires that connect two or more devices. Only one message can be on
the bus at a time. All the devices
Chapter 0 Interlude on Linkers
Originally called a linkage editor by IBM.
A linker is an example of a utility program included with an operating system
distribution. Like a compiler, the linker is not part of the operating system per se, i.e.
it does not
UG OS (202)
Practice Midterm Exam Page 1
This practice midterm is DEFINITELY MUCH TOO LONG. The real midterm will be shorter.
The real exam will have 20% ll in the blanks such as
A scheduling algorithm in which running processes can become ready is
Operating Systems Prof. Allan Gottlieb
Practice Final Exam Page 1
PLEASE WRITE YOUR NAME ON ALL SHEETS. Please start your answer for each question on the sheet where the question
appears. You may use the backs of the question sheets to continue your
I have decided to make 10-20 of the exam fill-in-the-blank. The main advantage is
that it takes you less time and eases any time pressure on the real final. Here are some
When a linker converts a relative address to
1.4 OS Zoo
There is not much difference between mainframe, server, multiprocessor, and PC
OS's. Indeed the 3e has considerably softened the differences given in the 2e. For
example Unix/Linux and Windows runs on all of them.
This course covers all four of
The following guidelines for lab submissions were introduced by Robert Soule during
the 2006-07 fall semester and have been modified since. Please be sure to follow these
guidelines when submitting your labs. They are required to receive fu
Operating Systems: 202
In this lab you will simulate demand paging and see how the number of page faults depends on page
size, program size, replacement algorithm, and job mix (job mix is dened below and includes locality
Operating SystemsAllan Gottlieb
The goal of this lab is to do resource allocation using both an optimistic resource manager and the
bankers algorithm of Dijkstra. The optimistic resource manager is simple: Satisfy a request if possible,
Lab 1Linker: Due 18 Sep
CSCI-UA.0202 2012-13 Fall Allan Gottlieb
You are to implement a two-pass linker in C, C+, or Java and submit the source code, which we will compile and
The target machine is word addressable and has a memory of 200 word