Property:Summary

From COMP15212 Wiki

Text A summary of the page.

Showing 20 pages using this property.
S
An animated demonstration of a synchronisation barrier.  +
T
An example I/O peripheral.  +
I
An example of filing system implementation  +
F
An example of filing system implementation.  +
P
An example to help explain paging.  +
R
An exception which restarts the processor or system.  +
U
An exploration of some of the Unix internal data <i>made human readable</i> and <i>pretending</i> to be files.  +
S
An important, all-spanning topic in computing. Within an operating system the primary concerns are to ensure that application processes can affect neither each other nor the operating system itself. This should include any leakage of illicit information.  +
I
An interrupt is a form of exception where the hardware calls for a software service.  +
W
An operating system is a <i>layer</i> of software which lies between the application(s) program(s) and the hardware.  +
M
An overview of the implications - and additional problems - of having more than one hardware processor working in the same memory space at the same time.  +
H
Another abstraction layer allowing several different operating systems to run concurrently on the same hardware without interfering with each other.  +
P
Any reasonably sophisticated processor will have more than one operating (privilege) mode. This lets the hardware detect that it is running a user application or <i>trusted</i> OS code and can prevent the former from seeing of changing any variables it does not specifically 'own'.  +
M
At its simplest, the (invisible) translation of the memory addresses a process wants to addresses of available, physical memory. I.e. this 'puts' the memory you bought in the places where you want to use it.  +
C
Caches are copies of data. This only works correctly under certain circumstances.  +
R
Code is re-entrant if several threads can be running the same section of code at the same time. It should be clear that each thread's <i>context</i> is completely independent.  +
Code is relocatable if it can be moved to any address in memory and executed there successfully.  +
L
Commonly used, probably optimised, application routines. Sometimes used to provide a more portable, user-friendly interface to an OS.  +
C
Context switching is changing from one running process to another. Typically this is done frequently to give the illusion of processes running concurrently  +
D
Deadlock is a problem in any multiprocessing system where there is a dependency cycle. At its simplest, process X is stuck waiting for process Y while process Y is also stuck waiting for process X.  +