Computer Science, Prifysgol Cymru Aberystwyth University of Wales
CS22210 (1995-96 session)
Operating Systems and Concurrency
Brief Description
This course introduces the basic principles of operating
systems and discusses the important underlying concepts, including the
problems of concurrency.
Aims, Objectives, Syllabus, Booklist
Further Details
- Number of lectures
- 24
- Number of seminars/tutorials
- 4
- Number of practicals
- 0
- Coordinator
- Dr. Fred Long
- Other staff involved
- Not yet known
- Pre-requisites
- None
- Co-requisites
-
CS21020
/C210
- Incompatibilities
- None
- Assessment
- Written exam - 100%
- Timing
- This module is offered only in Semester 1
Aims
The purpose of this module is to provide a basic introduction
to operating systems and the underlying concepts of processes,
resource management, security, and concurrent systems. Software
engineers should be aware of techniques associated with these
concepts which are needed in applications other than operating
systems.
Objectives
At the completion of this module a student should:
-
understand enough about operating systems to be able to
use them effectively;
-
be familiar with the concepts of resource management,
especially of processes, memory and filestore;
-
understand the problems that arise in concurrent systems,
and a range of techniques for tackling them;
-
have an appreciation of the issues involved in security of
computer systems.
Syllabus
-
Introduction to Operating
Systems - 3 Lectures
-
A brief historical overview with examples of important
systems. Different styles of operating system (e.g. real time,
batch, program development). Operating systems as a vehicle for the
portability of application programs. The gross structure of an
operating system: layered architecture and its benefits for
implementation and maintenance.
-
Processes and
Concurrency - 6 Lectures
-
The idea of a process and its life history. Process
control blocks, scheduling. Co-operating processes: exclusion,
synchronisation, inter-process communication. Semaphores, monitors,
messages. Multi-tasking in Ada, the rendezvous.
-
Resource
Management - 6 Lectures
-
Different types of resources. Deadlock prevention and
avoidance. Memory management. Segmentation, paging. Discard
algorithms, thrashing. Associative stores.
-
Program and
Human Interfaces - 1 Lecture
-
Operating system services. Human interface, command
languages.
-
Input-Output - 3 Lectures
-
Input-output services. Filing systems, disc space
management.
-
Distributed Systems - 3 Lectures
-
The need for distributed systems, tightly-coupled and
loosely coupled systems, the problems which they present to the
operating system.
-
Security - 2 Lectures
-
Discretionary and mandatory security. User authentication.
Encryption. System management.
Booklist
Students are likely to need ready access to the following
-
H.M. Deitel.
An Introduction to Operating Systems.
Addison Wesley, 2nd. edition, 1990.
-
Abraham Silberschatz and Peter B. Galvin.
Operating system concepts.
Addison-Wesley, Reading, Mass, 4th. edition, 1994.
- Notes
- Students will probably wish to choose one of the above.
The following should be consulted for different approaches or for further information
-
M.J. Bach.
The Design of the UNIX Operating System.
Prentice Hall, 1986.
Of value to students interested in the design of the UNIX Operating
System.
Version 4.1
Syllabus
John Hunt Departmental Advisor
jjh@aber.ac.uk
Dept of Computer Science, UW Aberystwyth (disclaimer)