 What CPU is to be used

estrapadesherbetSoftware and s/w Development

Nov 18, 2013 (3 years and 11 months ago)

88 views



What CPU is to be used? What options (extended instruction sets, floating point
arithmetic, and so on) are installed? For multiple CPU system, each CPU must be
described.



How much memory is available? Some systems will determine this value themselves
b
y referencing memory location after memory location until an “illegal address” fault is
generated. This procedure defines the final legal address and hence the amount of
available memory.



What devices are available? The system will need to know how to ad
dress each
device (the device number), the device interrupt number, the device’s type and model,
and special device characteristics.



What operating
-
system options are desired, or what parameter values are to be
used? These options or values might include

how many buffers of which sizes should be
used, what type of CPU
-
scheduling algorithm is desired, what the maximum number of
processes to be supported is, and so on.


Once this information is determined, it can be used in several ways. At one
extreme, a s
ystem administrator can use it to modify a copy of the source code of the
source code of the operating system. The operating system then is completely
compiled. Data declarations, initializations, and constants, along with conditional
compilation, produce
an output object version of the operating system that is tailored to
the system described.


At a slightly less tailored level, the system description can cause the creation of
tables and the selection of modules from a precompiled library. These modules ar
e
linked together to form the generated operating system. Selection allows the library to
contain the device drivers for all supported I/O devices, but only those needed are
linked into operating system. Because the system is not recompiled, system generat
ion
is faster, but the resulting system may be overly general.


At the other extreme, it is possible to construct a system that is completely table
driven. All the code is always part of the system, and selection occurs at execution time,
rather than at co
mpile or link time. System generation involves simply creating the
appropriate tables to describe the system.


The major differences among these approaches are the size and
generality of the generated system and the ease of modification as the hardware
con
figuration changes. Consider the cost of modifying the system to support a newly
acquired graphics terminal or another disk drive. Balanced against that cost, of course,
is the frequency (or infrequency) of such changes.


After an operating system is gener
ated, it must be made available for
use by the hardware. But how does the hardware know where the kernel is, or how to
load that kernel? The procedure of starting a computer by loading the kernel is known as
booting

the system. On most computer system, the
re is a small piece of code, stored in
ROM, know as the
bootstrap program

or
bootstrap loader.
This code is able to locate
the kernel, load it into main memory, and start its execution. Some computer systems,
such as PCs, use a two
-
step process in which a
simple bootstrap loader fetches a more
complex boot program from disk, which in turn loads the kernel. Booting a system is
discussed in Section 13.3.2 and in Chapter 20.


3.10 Summary

Operating system provide a number of services. At the lowest level, syst
em calls allow a
running program to make requests from the operating system directly. At a higher level,
the command interpreter or shell provides a mechanism for a user to issue a request
without writing a program. Commands may come from files during batc
h
-
mode
execution or directly from a terminal when in an interactive or time

shared mode.
System programs are provided to satisfy many common user requests.



The types of requests vary according to the level of the request. The
system call level must provi
de the basic function, such as process control and file and
device manipulation. Higher
-
level requests, satisfied by the command interpreter or
system program, are translated into a sequence of system calls. System services can be
classified into several c
ategories: program control, status requests, and I/O requests.
Program error can be considered implicit requests for service.



Once the system services are defined, the structure of the operating
system can be developed. Various tables are needed to recor
d to record the information
that defines the state of the computer system and the status of the system’s jobs.



The design of a new operating system is a major task. It is important that
the goals of the system be well defined before the design begins. Th
e type of system
desired is the foundation for choices among various algorithms and strategies that will
be necessary.



Since an operating system is large, modularity is important. Designing a
system as a sequence of layers or using a microkernel is consi
dered a good technique.
The virtual
-
machine concept takes the layered approach and treats both the kernel of
the operating system and the hardware as though they were all hardware. Even other
operating systems may be loaded on top of this virtual machine.



Any operating system that has implemented the JVM is able to run all
Java programs, because the JVM abstracts the underlying system to the Java program,
providing an architecture
-
neutral interface.



Throughout the entire operating
-
system design cycl
e, we must be careful
to separate policy decisions from implementation details (mechanisms). This separation
allows maximum flexibility if policy decisions are to be changed later.



Operating system are now almost always written in a systems
-
implementatio
n language or in a higher
-
level language. This feature improves their
implementation, maintenance, and portability. To create an operating system for a
particular machine configuration, we must perform system generation.




Exercises

3.1
What are the Five ma
jor activities of an operating system in regard to process
management?

3.2
What are the three major activities of an operating system in regard to memory
management?

3.3

What are the three major activities of an operating system in regard to secondary
-
storage
management?

3.4

What are the five major activities of an operating system in regard to file
management?

3.5

What is the purpose of the command interpreter? Why is it usually separate from
the kernel?

3.6

List five services provided by an operating system. Explain how
each provides
convenience to the users. Explain in which cases it would be impossible for user
-
level programs to provide these services.


3.7

What is the purpose of system calls?

3.8

Using system calls, write a program in either C or C++ that reads data from one f
ile
and file and copies it to another file. Such a program was described in Section 3.3

3.9

Why doses Java provide the ability to call from a Java program native methods that
are written in, say, C or C++? Provide an example where a native method is useful.

3.10

Wh
at is the purpose of system programs?

3.11

What is the main advantage of the layered approach to system design?

3.12

What is the main advantage of the microkernel approach to system design?

3.13

What is the main advantage for an operating
-
system designer of using a virtu
al
-
machine architecture? What is the main advantage for a user?

3.14

Why is a just
-
in
-
time compiler useful for executing Java programs?

3.15

Why is the separation of mechanism and policy a desirable property?

3.16

The experimental Synthesis operating system has an assemb
ler incorporated
within the kernel. To optimize system
-
call performance, the kernel assembles
routines within kernel space to minimize the path that the system call must take
through the kernel. This approach is the antithesis of the layered approach, in
w
hich the path through the kernel is extended so that building the operating
system is made easier. Discuss the pros and cons of the Synthesis approach to
kernel design and to system performance optimization.


Bibliographical Notes

Dijkstra

[1968] advocated

the layered approach to operating
-
system design. Brinch
Hansen [1970] was an early proponent of the construction of an operating system as a
kernel (or nucleus) on which can be built more complete systems.

The first operating system to provide a virtual m
achine was the CP/67 on an IBM
360/67. The commercially available IBM VM/370 operating system was derived from
CP/67. General discussions concerning virtual machines have been presented by
Hendricks and Hartmann [1979], by MacKinnon [1979], and by Schultz
[1988]. Cheung
and Loong [1995] explored issues of operating systems structuring from microkernel to
extensible systems.

MS
-
DOS, Version 3.1, is described in [Microsoft 1986]. Windows NT is
described by Solomon [1998]. The Apple Macintosh operating system
is described in
[Apple 1987]. Berkeley UNIX is described in [CSRG 1986]. The standard AT&T UNIX
system V is described in [AT&T 1986]. A good description of OS/2 is give by Accetta
and colleagues [1986], and AIX is presented by Loucks and Sauer [1987]. The
experimental Synthesis operating system is discussed by Massalin and Pu [1989].

The specification for the Java language and the Java virtual machine is
presented by Gosling and clloeagues [1996] and by Lindholm and Yellin [1998],
respectively. The internal

working of the Java virtual machine aredescribed by Venners
[1998] and by Meyer and Downing [1997]. There are several good general
-
purpose
book on programming in Java [Flanngan 1997, Horstmann and Cornell 1998a, Niemeyer
and Peck 1997]. More information o
n Java is available on the Web at
http://www.javasoft.com


Part Two

PROCESS

MANAGEMENT


A
process
can be thought of as a program in execution. A process needs resources
-
such as CPU time, memory, files, and I/O devices
-
to accomplish its task. These
resources are allocated either when the process is created or while it is executing.


A process is the unit of work in most system. Such a system consists of a
collection of processes: Operating
-
system processes execute syste
m code, and user
processes execute user code. All these processes can potentially execute concurrently.


The operating system is responsible for the following activities in connection with
process management: the creation and deletion of both user and syst
em processes; the
scheduling of processes; and the provision of mechanisms for synchronization,
communication, and deadlock handling for processes.


Although traditionally a process contained a single
thread

of control as it ran,
most modern operating syst
ems now support processes that have multiple threads.


Chapter 4


PROCESSES

Early computer system allowed only one program to be executed at a time. This
program had complete control of the system, and had access to all the system’s
resources. Current
-
day

computer systems allow multiple programs to be loaded into
memory and to be executed concurrently. This evolution required firmer control and
more compartmentalization of the various programs. These needs resulted in the notion
of a
process
is the unit of

work in a modern time
-
sharing system.


The more complex the operating system is, the more it is expected to do on
behalf of its users. Although its main concern is the execution of user programs, it also
needs to take care of various system tasks that are

better left outside the kernel itself. A
system therefore consists of a collection of processes: Operating
-
system processes
executing system code, and user processes executing user code. All these processes
can potentially execute concurrently, with the C
PU (or CPUs) multiplexed among them.
By switching the CPU between processes, the operating system can make the computer
more productive.


4.1


P牯捥獳⁃潮捥灴

One hindrance to our discussion of operating system is that there is a question of what
to call
all the CPU activities. A batch system executes
jobs,
whereas a time
-
shared
system has
user program,
or
tasks.
Even on a single
-
user system, such as Microsoft
Windows and Macintosh OS, a user may be able to run several programs at one time: a
word processo
r, web browser, and e
-
mail package.

Even if the user can execute only one program at a time, the operating system may
need to support its own internal programmed activities, such as memory management.
In many respects, all these activities are similar, so
we call all of them
processes.


The terms
job

and

process
are used almost interchangeably in this text.
Although we personally prefer the term
process,
much of operating
-
system theory and
terminology was developed during a time when the major activity of o
perating systems
was job processing. It would be misleading to avoid the use of commonly accepted
terms that include the word
job
(such as
job scheduling
) simply because
process

has
superseded
job.

4.1.1 The Process

Informally, a process is a program in ex
ecution. A process is more than the program
code, which is sometime known as the
text section.

It also includes the current activity,
as represented by the value of the
program counter
and the contents of the processor’s
registers. A process generally als
o includes the process
stack,
which contains
temporary data (such as method parameters, return addresses, and local variables),
and a
data section,
which contains global variables.

We emphasize that a program by itself is not a process; a program is a
pass
ive

entity, such as the contents of a file stored on disk, whereas a process is an
active
entity, with a program counter specifying the next instruction to execute and a set of
associated resources.

Although two processes may be associated with the same pr
ogram, they are
nevertheless considered two separate execution sequences. For instance, several users
may be running different copies of the mail program, or the same user may invoke many
copies of the editor program. Each of these is a separate process, a
nd, although the
text sections are equivalent, the data sections vary. It is also common to have a process
that spawns many processes as it runs. We discuss such matters in Section 4.4.

4.1.2 Process State

As a process executes, it changes
state.

The state

of a process is defined in part by the
current activity of that process. Each process may be in one of the following state:



New:

The process is being created.



Running:
Instructions are being executed.



Waiting:
The process is waiting for some event t
o occur (such as an I/O completion
or reception of a signal).



Ready:
The process is waiting to be assigned to a processor.



Terminated:
The

process has finished execution.





Figure 4.1
Diagram of process state.


These names are arbitrary, and they var
y across operating systems. The states that they
represent are found on all systems, however. Certain operating systems also more finely
delineate process states. It is important to realize that only one process can be
running
on any processor at any insta
nt. Many processes may be
ready
and
waiting,
however.
The state diagram corresponding to there states is presented in Figure 4.1.

4.1.3 Process Control Block

Each process is represented in the operating system by a
process control block (PCB)

also called
a task control block. A PCB is shown in Figure 4.2. It contains many pieces
of information associated with a specific process, including these:

Figure 4.2

Process control block (PCB).



Process state:
The state may be new, ready, running, waiting, halted,

and so on.



Program counter:

The counter indicates the address of the next instruction to be
executed for this process.



CPU registers:

The registers vary in number and type, depending on the computer
architecture. They include accumulators, index regis
ters, stack pointers, and general
-
purpose registers, plus any condition
-
code information. Along with the program counter,
this state information must be saved when an interrupt occurs, to allow the process to be
continued correctly afterward (Figure 4.3).



CPU
-
scheduling information: This information includes a process priority, pointers to
scheduling queues, and any other scheduling parameters. (Chapter 6 describes
process scheduling.)



Memory
-
management information: This information may include such inf
ormation as
the value of the base and limit registers, the page tables, or the segment tables
depending on the memory system used by the operating system (Chapter 9).



Accounting information:

This information includes the amount of CPU and real time
used,

time limits, account numbers, job or process number, and so on.



I/O status information: The information includes the list of I/O devices allocated to this
process, a list of open files, and so on.

The PCB simply serves as the repository for any informat
ion that may vary from process
to process.

4.1.4 Threads

the process model discussed so far has implied that a process is a program that
performs a single
thread
of execution. For example, if a process is running a word
processor program, there is a single

thread of instructions being executed. This single
thread of control only allows the process to perform one task at one time. The user could
not simultaneously type in characters and run the spell checker within the same
process. Many modern operating sys
tems have extended the process concept to allow
a process to have multiple threads of execution. They thus allow the process to perform
more than one task at a time. Chapter 5 explores multithreaded processes.

4.2


P牯捥獳⁓捨敤畬楮g

The objective of mult
iprogramming is to have some process running at all times, to
maximize CPU utilization. The objective of time sharing is to switch the CPU among
processes so frequently that users can interact with each program while it is running.
For a uniprocessor syste
m, there will have to wait until the CPU is free and can be
rescheduled.

4.2.1 Scheduling Queues

As processes enter the system, they are put into a
job queue.

This queue consists of all
processes in the system. The process that are residing in main memory
and are ready
and waiting to execute are kept on a list called the
ready queue.
This queue is generally
stored as a linked list. A ready
-
queue header contains pointers to the first and final
PCBs in the list. We extend each PCB to include a pointer field t
hat points to the next
PCB in the ready queue.


There are also other queues in the system. When a process is allocated the
CPU, it executes for a while and eventually quits, is interrupted, or waits for the
occurrence of a particular event, such as the com
pletion of an I/O request. In the case
of an I/O request, such a request may be to a dedicated tape drive, or to a shared
device, such as a disk. Since there are many processes in the system, the disk may be
busy with the I/O request of some other process.

The process therefore may have to
wait for the disk. The list of processes waiting for a particular I/O device is called a
device queue.
Each device has its own device queue (Figure 4.4).


A common representation for a discussion of process scheduling is
a
queueing
diagram,
such as that in Figure 4.5. Each rectangular box represents a queue. Two
types of queues are present: the ready queue and a set of device queues. The circles
represent the resources that serve the queues, and the arrows indicate the flo
w of
processes in the system.


A new process is initially put in the ready queue. It waits in the ready queue until
is selected for execution or is
dispatched.

Once the process is allocated the CPU and is
executing, one of several events could occur:



The

process could issue an I/O request, and then be placed in an I/O queue.



The process could create a new subprocess and wait for its termination.



The process could be removed forcibly from the CPU, as a result of an interrupt, and
be put back in the rea
dy queue.



Figure
4.
5

Que
ueing
-
d
iagr
am r
epres
enta
tion

of p
ro
cess

sch
eduli
ng.

In t
he
first
two
case
s, t
he pr
oces
s eve
ntua
lly
switche
s fr
om t
he w
aitin
g st
ate
to t
he re
ady
state,
and
is t
hen
put b
ack
in the

ready
queu
e. A

pro
cess
cont
inue
s thi
s cy
cl
e
unti
l it
term
inat
es,
at wh
ich
time

it
is re
moved
fro
m all
queu
es an
d ha
s it
s P
CB and

res
ourc
es
d
eallo
cate
d.