Professional Documents
Culture Documents
Va
ts
Definition
Pa
rd
ee
Memory Management
Processor Management
Device Management
File Management
Security
Job accounting
Va
ts
Memory Management
rd
ee
Pa
Main memory provides a fast storage that can be access directly by the
CPU. So for a program to be executed, it must in the main memory.
Operating System does the following activities for memory management.
Keeps tracks of primary memory i.e. what part of it are in use by whom, what
part are not in use.
In multiprogramming, OS decides which process will get memory when and how
much.
De-allocates the memory when the process no longer needs it or has been
terminated.
Processor Management
In multiprogramming environment, OS decides which process gets the
processor when and how much time. This function is called process
scheduling. Operating System does the following activities for processor
management.
Keeps tracks of processor and status of process. Program responsible for this
task is known as traffic controller.
ts
Device Management
Va
ee
I/O controller.
Decides which process gets the device when and for how much time.
De-allocates devices.
Pa
rd
File Management
A file system is normally organized into directories for easy navigation and
usage. These directories may contain files and other directions. Operating
System does the following activities for file management.
Keeps track of information, location, uses, status etc. The collective facilities are
often known as file system.
Job accounting -- Keeping track of time and resources used by various jobs
and users.
ts
Error detecting aids -- Production of dumps, traces, error messages and other
Va
ee
rd
Pa
Operating systems are there from the very first computer generation.
Operating systems keep evolving over the period of time. Following are few
of the important types of operating system which are most commonly used.
CPU is often idle, because the speeds of the mechanical I/O devices is slower
than CPU.
ts
ee
Va
Multiple jobs are executed by the CPU by switching between them, but the
switches occur so frequently. Thus, the user can receives an immediate
response. For example, in a transaction processing, processor execute each
user program in a short burst or quantum of computation. That is if n users
are present, each user can get time quantum. When the user submits the
rd
Pa
Problem of reliability.
processors
communicate
with
one
another
through
various
Va
ts
ee
available at another.
Speedup the exchange of data with one another via electronic mail.
If one site fails in a distributed system, the remaining sites can potentially
Pa
rd
continue operating.
Upgrades to new technologies and hardwares can be easily integrated into the
system.
ts
systems.
Va
rd
ee
Pa
ts
Soft real time systems are less restrictive. Critical real-time task gets
priority over other tasks and retains the priority until it completes. Soft
real-time systems have limited utility than hard real-time systems.For
example, Multimedia, virtual reality, Advanced Scientific Projects like
ee
Va
rd
Pa
Program execution
I/O operations
Communication
Error Detection
Resource Allocation
Protection
Program execution
Operating system handles many kinds of activities from user programs to
system programs like printer spooler, name servers, file server etc. Each of
these activities is encapsulated as a process.
A process includes the complete execution context (code to execute, data to
manipulate, registers, OS resources in use). Following are the major
activities of an operating system with respect to program management.
Loads a program into memory.
Pa
rd
ee
Va
ts
I/O Operation
I/O operation means read or write operation with any file or any specific I/O
device.
Operating system provides the access to the required I/O device when required.
ts
The operating system gives the permission to the program for operation on file.
Pa
rd
ee
Va
Communication
The both processes can be on the one computer or on different computer but
are connected through computer network.
Error handling
Error can occur anytime and anywhere. Error may occur in CPU, in I/O
devices or in the memory hardware. Following are the major activities of an
operating system with respect to error handling.
OS constantly remains aware of possible errors.
Va
Resource Management
ts
rd
ee
Pa
Protection
Considering a computer systems having multiple users the concurrent
execution of multiple processes, then the various processes must be
protected from each another's activities.
OS ensures that external I/O devices are protected from invalid access
attempts.
Va
ts
ee
Batch processing
Pa
rd
OS keeps a number a jobs in memory and executes them without any manual
information.
Jobs are processed in the order of submission i.e first come first served fashion.
When job completes its execution, its memory is released and the output for the
job gets copied into an output spool for later printing or processing.
Advantages
Batch processing takes much of the work of the operator to the computer.
Increased performance as a new job get started as soon as the previous job
Va
ts
ee
Disadvantages
Difficult to debug program.
Due to lack of protection scheme, one batch job can affect pending jobs.
Multitasking
Pa
rd
Multitasking refers to term where multiple jobs are executed by the CPU
simultaneously by switching between them.Switches occur so frequently
that the users may interact with each program while it is running. Operating
system does the following activities related to multitasking.
The user gives instructions to the operating system or to a program directly, and
receives an immediate response.
Operating System handles multitasking in the way that it can handle multiple
operations / executes multiple programs at a time.
time-shared
operating
system
uses
concept
of
CPU
scheduling
and
Pa
as a process.
rd
ee
Va
ts
When a process executes, it typically executes for only a very short time before
it either finishes or needs to perform I/O.
Since interactive I/O typically runs at people speeds, it may take a long time to
completed. During this time a CPU can be utilized by another process.
Operating system allows the users to share the computer simultaneously. Since
each action or command in a time-shared system tends to be short, only a little
CPU time is needed for each user.
As the system switches CPU rapidly from one user/program to the next, each
user is given the impression that he/she has his/her own CPU, whereas actually
one CPU is being shared among many users.
Multiprogramming
When two or more programs are residing in memory at the same time, then
sharing
the
processor
is
referred
to
the
multiprogramming.
Multiprogramming assumes a single shared processor. Multiprogramming
increases CPU utilization by organizing jobs so that the CPU always has one
to execute.
Pa
rd
ee
Va
ts
This set of jobs is a subset of the jobs kept in the job pool.
The operating system picks and begins to execute one of the job in the memory.
Advantages
User feels that many programs are allotted CPU almost simultaneously.
Disadvantages
Interactivity
Interactivity refers that a User is capable to interact with computer system.
Operating system does the following activities related to interactivity.
OS provides user an interface to interact with system.
OS managers input devices to take inputs from the user. For example,
Va
ts
keyboard.
OS manages output devices to show outputs to the user. For example, Monitor.
OS Response time needs to be short since the user submits and waits for the
Pa
result.
rd
ee
In such systems, Operating Systems typically read from and react to sensor
data.
The Operating system must guarantee response to events within fixed periods of
time to ensure correct performance.
Distributed Environment
Distributed environment refers to multiple independent CPUs or processors
in a computer system. Operating system does the following activities
related to distributed environment.
ts
Spooling
rd
ee
Va
OS maintains the spooling buffer which provides a waiting station where data
Pa
Advantages
The spooling operation uses a disk as a very large buffer.
Spooling is capable of overlapping I/O operation for one job with processor
ts
Pa
rd
ee
Va
Object Program
Code to be executed.
Data
Data to be used for executing the program.
Resources
While executing the program, it may require some resources.
Status
Verifies the status of the process execution.A process can run to completion
only when all requested resources have been allocated to the process. Two
or more processes could be executing the same program, each using their
own data and resources.
Pa
rd
ee
Va
ts
S.N.
Program
A program by itself is not a process. It is a static entity made up of program
statement while process is a dynamic entity. Program contains the
instructions to be executed by processor.
A program takes a space at single place in main memory and continues to
stay there. A program does not perform any action by itself.
Process States
As a process executes, it changes state. The state of a process is defined as
the current activity of the process.
Process can have one of the following five states at a time.
State & Description
New
The process is being created.
Ready
The process is waiting to be assigned to a processor. Ready processes are
waiting to have the processor allocated to them by the operating system so
that they can run.
Running
Process instructions are being executed (i.e. The process that is currently
being executed).
Waiting
The process is waiting for some event to occur (such as the completion of
an I/O operation).
Terminated
The process has finished execution.
Pa
rd
ee
Va
ts
S.N.
ts
Va
ee
block (PCB) also called a task control block. PCB is the data structure used
by the operating system. Operating system groups all information that
needs about particular process.
PCB contains many pieces of information associated with a specific process
rd
Pointer
Pointer points to another process control block. Pointer is used for
maintaining the scheduling list.
Process State
Process state may be new, ready, running, waiting and so on.
Program Counter
Program Counter indicates the address of the next instruction to be
executed for this process.
Pa
S.N.
CPU registers
CPU registers include general purpose register, stack pointers, index
registers and accumulators etc. number of register and type of register
totally depends upon the computer architecture.
Accounting information
This information includes the amount of CPU and real time used, time
limits, job or process numbers, account numbers etc.
Pa
rd
ee
Va
ts
contents of the registers are saved on a stack and the pointer to the
particular stack frame is stored in the PCB. By this technique, the hardware
state can be restored so that the process can be scheduled to run again.
ts
the removal of the running process from the CPU and the selection of
another process on the basis of a particular strategy.
Process scheduling is an essential part of a Multiprogramming operating
ee
Scheduling Queues
Va
system. Such operating systems allow more than one process to be loaded
into the executable memory at a time and loaded process shares the CPU
using time multiplexing.
Pa
rd
ts
p
Va
Device queue
rd
Ready queue
Pa
ee
A newly arrived process is put in the ready queue. Processes waits in ready
queue for allocating the CPU. Once the CPU is assigned to a process, then
that process will execute. While executing the process, any one of the
following events can occur.
The process could issue an I/O request and then it would be placed in an I/O
queue.
The process could create new sub process and will wait for its termination.
The process could be removed forcibly from the CPU, as a result of interrupt and
put back in the ready queue.
Running
When new process is created by Operating System that process enters into
the system as in the running state.
Not Running
Processes that are not running are kept in queue, waiting for their turn to
execute. Each entry in the queue is a pointer to a particular process. Queue
is implemented by using linked list. Use of dispatcher is as follows. When a
process is interrupted, that process is transferred in the waiting queue. If
the process has completed or aborted, the process is discarded. In either
case, the dispatcher then selects a process from the queue to execute.
Va
ts
S.N.
ee
Schedulers
Pa
rd
Va
ts
ee
Pa
rd
Short Term
Scheduler
Medium Term
Scheduler
It is a job scheduler
It is a CPU scheduler
It is a process swapping
scheduler.
Speed is fastest
among other two
It provides lesser
control over degree of
multiprogramming
It is almost absent or
minimal in time sharing
system
It is also minimal in
time sharing system
It is a part of Time
sharing systems.
It selects processes
from pool and loads
them into memory for
execution
It selects those
processes which are
ready to execute
Speed is in between
both short and long term
scheduler.
Pa
rd
ee
Va
ts
S.N.
Context Switch
A context switch is the mechanism to store and restore the state or context
of a CPU in Process Control block so that a process execution can be
resumed from the same point at a later time. Using this technique a context
ts
Pa
rd
ee
Va
Scheduling Information
Changed State
I/O State
Accounting
ee
Va
ts
rd
Pa
We'll discuss four major scheduling algorithms here which are following
Priority Scheduling
ts
Va
P0
0-0=0
P1
5-1=4
P2
8-2=6
P3
16 - 3 = 13
Pa
rd
ee
Process
Impossible to implement
Processer should know in advance how much time process will take.
Va
ts
P0
3-0=3
P1
0-0=0
P2
16 - 2 = 14
P3
8-3=5
Pa
rd
ee
Process
Processes with same priority are executed on first come first serve basis.
Va
ts
P0
9-0=9
P1
6-1=5
P2
14 - 2 = 12
P3
0-0=0
Pa
rd
ee
Process
Once a process is executed for given time period. Process is preempted and
other process executes for given time period.
P0
(0-0) + (12-3) = 9
P1
(3-1) = 2
P2
P3
(9-3) + (17-12) = 11
Pa
rd
ee
Va
ts
Process
ee
rd
Pa
ts
Va
Pa
rd
ee
Va
ts
Thread
Thread is
light
weight
taking
lesser
resources
than a
process.
Thread
switching
does not
need to
interact
with
operating
system.
All
threads
can share
same set
of open
files, child
processes.
While one
thread is
blocked
and
waiting,
second
thread in
the same
task can
Pa
rd
ee
Va
ts
S.N.
run.
Multiple
threaded
processes
use fewer
resources.
One
thread
can read,
write or
change
another
thread's
data.
Advantages of Thread
Va
ts
Efficient communication.
Pa
rd
ee
Types of Thread
Threads are implemented in following two ways
Advantages
Pa
rd
ee
Va
ts
thread.
Disadvantages
Kernel can simultaneously schedule multiple threads from the same process on
Va
ts
Advantages
multiple processes.
If one thread in a process is blocked, the Kernel can schedule another thread of
Disadvantages
Kernel threads are generally slower to create and manage than the user
threads.
rd
Pa
ee
Transfer of control from one thread to another within same process requires a
mode switch to the Kernel.
Multithreading Models
Some operating system provide a combined user level thread and Kernel
level thread facility. Solaris is a good example of this combined approach.
In a combined system, multiple threads within the same application can run
in parallel on multiple processors and a blocking system call need not block
the entire process. Multithreading models are three types
Pa
rd
ee
Va
ts
ts
Va
There is one to one relationship of user level thread to the kernel level
ee
thread.This model provides more concurrency than the many to one model.
It also another thread to run when a thread makes a blocking system call.
It support multiple thread to execute in parallel on microprocessors.
Pa
rd
Pa
rd
ee
Va
ts
S.N.
Va
ts
Pa
rd
ee
is 1209000, then the program can legally access all addresses from 300000
through 411999.
Compile time -- When it is known at compile time where the process will
reside, compile time binding is used to generate the absolute code.
Load time -- When it is not known at compile time where the process will reside
in memory, then the compiler generates re-locatable code.
Execution time -- If the process can be moved during its execution from one
memory segment to another, then binding must be delayed to be done at run
time
Dynamic Loading
ts
Va
Dynamic Linking
ee
Pa
rd
and data into a executable file that can be loaded into memory and
executed. Operating system can link system level libraries to a program.
When it combines the libraries at load time, the linking is called static
linking and when this linking is done at the time of execution, it is called as
dynamic linking.
In static linking, libraries linked at compile time, so program code size
becomes bigger whereas in dynamic linking libraries linked at execution
time so program code size remains smaller.
Virtual and physical addresses are the same in compile-time and load-time
address-binding schemes. Virtual and physical addresses differ in
execution-time address-binding scheme.
The set of all logical addresses generated by a program is referred to as a
logical address space. The set of all physical addresses corresponding to
these logical addresses is referred to as a physical address space.
The run-time mapping from virtual to physical address is done by the
memory management unit (MMU) which is a hardware device. MMU uses
following mechanism to convert virtual address to physical address.
The value in the base register is added to every address generated by a user
process which is treated as offset at the time it is sent to memory. For example,
ts
if the base register value is 10000, then an attempt by the user to use address
Va
ee
addresses.
Swapping
Pa
rd
= 1/10 second
rd
ee
Va
ts
= 100 milliseconds
Pa
Memory Allocation
Memory Allocation
Description
Single-partition allocation
Multiple-partition allocation
ts
Va
Fragmentation
rd
ee
As processes are loaded and removed from memory, the free memory
space is broken into little pieces. It happens after sometimes that processes
can not be allocated to memory blocks considering their small size and
memory blocks remains unused. This problem is known as Fragmentation.
Pa
Fragmentation
Description
External fragmentation
Internal fragmentation
Paging
External fragmentation is avoided by using paging technique. Paging is a
technique in which physical memory is broken into blocks of the same size
called pages (size is power of 2, between 512 bytes and 8192 bytes). When
a process is to be executed, it's corresponding pages are loaded into any
available memory frames.
Logical address space of a process can be non-contiguous and a process is
allocated physical memory whenever the free memory frame is available.
Operating system keeps track of all free frames. Operating system needs n
free frames to run a program of size n pages.
ts
Page offset (d) -- page offset is combined with base address to define the
Va
Pa
rd
ee
ts
Va
Segmentation
ee
Pa
rd
segments or code segment for each process, data segment for operating
system and so on. Segmentation can be implemented using or without
using paging.
Unlike paging, segment are having varying sizes and thus eliminates
internal fragmentation. External fragmentation still exists but to lesser
extent.
ts
Va
table which contains base address of each segment in physical memory and a
rd
Segment offset (o) -- segment offset is first checked against limit and then is
combined with base address to define the physical memory address.
Pa
ee
limit of segment.
ee
rd
Pa
ts
Va
User written error handling routines are used only when an error occured in the
ts
data or computation.
Certain options and features of a program may be used rarely.
Many tables are assigned a fixed amount of address space even though only a
Va
ee
The ability to execute a program that is only partially in memory would counter
Less number of I/O would be needed to load or swap each user program into
memory.
Pa
rd
many benefits.
Each user program could take less physical memory, more programs could be
run the same time, with a corresponding increase in CPU utilization and
throughput.
ts
Va
ee
Pa
Demand Paging
rd
Marking a page will have no effect if the process never attempts to access
the page. While the process executes and accesses pages that are memory
rd
ee
Va
ts
Pa
Access to a page marked invalid causes a page-fault trap. This trap is the
result of the operating system's failure to bring the desired page into
memory. But page fault can be handled as following
ts
Va
Description
Step 1
Step 2
Step 3
Step 4
Schedule a disk operation to read the desired page into the newly
allocated frame.
Step 5
When the disk read is complete, modify the internal table kept
with the process and the page table to indicate that the page is
now in memory.
Pa
rd
ee
Step
Step 6
Advantages
Following are the advantages of Demand Paging
Unconstrained
multiprogramming.
There
no
limit
on
degree
of
ts
multiprogramming.
is
Va
Disadvantages
ee
techniques.
Pa
rd
interrupts are greater than in the case of the simple paged management
Reference String
The string of memory references is called reference string. Reference
For a given page size we need to consider only the page number, not the entire
Va
ts
address.
ee
page p will never cause a page fault. Page p will be in memory after the first
For
example,
rd
the
following
sequence
of
addresses
Pa
123,215,600,1234,76,96
Oldest page in main memory is the one which will be selected for replacement.
Easy to implement, keep a list, replace pages from the tail and add new pages
at the head.
Va
ts
ee
Replace the page that will not be used for the longest period of time . Use the
rd
Pa
OPT or MIN.
Page which has not been used for the longest time in main memory is the one
which will be selected for replacement.
Easy to implement, keep a list, replace pages by looking back into time.
ee
Va
ts
rd
Write new page in the frame of free pool, mark the page table and restart the
Pa
process.
Now write the dirty page out of disk and place the frame holding replaced page
in free pool.
Page with the smallest count is the one which will be selected for replacement.
This algorithm suffers from the situation in which a page is used heavily during
the initial phase of a process, but then is never used again.
This algorithm is based on the argument that the page with the smallest count
was probably just brought in and has yet to be used.
Va
ts
ee
The device communicates with the machine via a connection point termed
aport (for example, a serial port). If one or more devices use a common set
Daisy chain
Pa
rd
When device A has a cable that plugs into device B, and device B has a
cable that plugs into device C, and device C plugs into a port on the
computer, this arrangement is called a daisy chain. It usually operates as
a bus.
Controller
A controller is a collection of electronics that can operate a port, a bus, or a
device. A serial-port controller is an example of a simple device controller.
This is a single chip in the computer that controls the signals on the wires of
a serial port.
I/O port
An
I/O
port
typically
consists
of
four
the status , control,data-in, and data-out registers.
registers,
Status Register
The status register contains bits that can be read by the host. These bits
indicate states such as whether the current command has completed,
whether a byte is available to be read from the data-in register, and
whether there has been a device error.
Control register
The control register can be written by the host to start a command or to
change the mode of a device. For instance, a certain bit in the control
register of a serial port chooses between full-duplex and half-duplex
communication, another enables parity checking, a third bit sets the word
length to 7 or 8 bits, and other bits select one of the speeds supported by
the serial port.
Data-in register
The data-in register is read by the host to get input.
Data-out register
The data out register is written by the host to send output.
Pa
rd
ee
Va
ts
S.N.
called
Polling
Polling is a process by which a host waits for controller response.It is a
looping process, reading the status register over and over until the busy bit
of status register becomes clear. The controller uses/sets the busy bit when
it is busy working on a command, and clears the busy bit when it is ready
to accept the next command. The host signals its wish via the commandready bit in the command register. The host sets the command-ready bit
when a command is available for the controller to execute.
In the following example, the host writes output through a port,
coordinating with the controller by handshaking
The host repeatedly reads the busy bit until that bit becomes clear.
The host sets the write bit in the command register and writes a byte into the
data-out register.
The host sets the command-ready bit.
When the controller notices that the command-ready bit is set, it sets the busy
ts
Va
bit.
The controller reads the command register and sees the write command.
It reads the data-out register to get the byte, and does the I/O to the device.
The controller clears the command-ready bit, clears the error bit in the status
rd
ee
register to indicate that the device I/O succeeded, and clears the busy bit to
I/O devices
Pa
Human readable
Human Readable devices are suitable for communicating with the computer
user. Examples are printers, video display terminals, keyboard etc.
Machine readable
Machine Readable devices are suitable for communicating with electronic
equipment. Examples are disk and tape drives, sensors, controllers and
actuators.
Communication
Communication devices are suitable for communicating with remote
devices. Examples are digital line drivers and modems.
Data rate
There may be differences of several orders of magnitude between the data
transfer rates.
Application
Different devices have different use in the system.
Complexity of Control
A disk is much more complex whereas printer requires simple control
interface.
Unit of transfer
Data may be transferred as a stream of bytes or characters or in larger
blocks.
Data representation
Different data encoding schemes are used for different devices.
Error Conditions
The nature of errors differs widely from one device to another.
Pa
rd
ee
Va
ts
S.N.
ts
Pa
rd
ee
Va
acknowledge.
Description
ee
Device Controllers
Va
ts
Step
Pa
rd
network card
graphics adapter
disk controller
DVD-ROM controller
serial port
USB
sound card
Va
ts
maskable interrupt - Such interrupts can be switched off by the CPU before
ee
Pa
rd
ts
Va
Read-write, read only, or write only - Some devices perform both input and
output, but others support only one data direction that is read only.
ee
Clocks
Pa
rd
Clocks are also called timers. The clock software takes the form of a device
driver though a clock is neither a blocking device nor a character based
device. The clock software is the clock driver. The exact function of the
clock driver may vary depending on operating system. Generally, the
functions of the clock driver include the following.
S.N.
Task
Description
clock tick.
Another function
performed by
clock driver is
doing CPU
accounting. CPU
accounting implies
telling how long
the process has
run.
Watchdog timers
are the timers set
by certain parts of
Pa
rd
ee
Va
ts
As a process is
started, the
scheduler
initializes the
quantum counter
in clock ticks for
the process. The
clock driver
decrements the
quantum counter
by 1, at every
clock interrupt.
When the counter
gets to zero ,
clock driver calls
the scheduler to
set up another
process. Thus
clock driver helps
in preventing
processes from
running longer
than time slice
allowed.
ts
Va
scheduler rearranges the order of the queue to improve the overall system
rd
ee
that stores data while they are transferred between two devices or between a
Pa
Caching - Kernel maintains cache memory which is region of fast memory that
holds copies of data. Access to the cached copy is more efficient than access to
the original.
Spooling and Device Reservation A spool is a buffer that holds output for a
device, such as a printer, that cannot accept interleaved data streams. The
spooling system copies the queued spool files to the printer one at a time. In
some operating systems, spooling is managed by a system daemon process. In
other operating systems, it is handled by an in kernel thread.
Error Handling An operating system that uses protected memory can guard
against many kinds of hardware and application errors.
Device driver
Device driver is a program or routine developed for an I/O device. A device
driver implements I/O operations or behaviours on a specific class of
devices. For example a system supports one or a number of multiple brands
of terminals, all slightly different terminals may have a single terminal
driver. In the layered structure of I/O system, device driver lies between
interrupt handler and device independent I/O software. The job of a device
driver are following.
ts
rd
ee
Va
File
Pa
File Structure
File structure is a structure, which is according to a required format that
operating system can understand.
When operating system defines different file structures, it also contains the code
to support these file structure. Unix, MS-DOS support minimum number of file
structure.
File Type
File type refers to the ability of the operating system to distinguish different
ts
types of file such as text files source files and binary files etc. Many
operating systems support many types of files. Operating system like MSDOS and UNIX have the following types of files:
Va
Ordinary files
The user can apply various operations on such files like add, modify, delete or
Pa
Directory files
rd
ee
These files contain list of file names and other information related to these files.
Special files:
These files represent physical device like disks, terminals, printers, networks,
tape drive etc.
Block special files - data is handled in blocks as in the case of disks and tapes.
Sequential access
Direct/Random access
Sequential access
Va
ts
Direct/Random access
Each record has its own address on the file with by the help of which it can be
ee
The records need not be in any sequence within the file and they need not be in
Pa
rd
An index is created for each file which contains pointers to various blocks.
Index is searched sequentially and its pointer is used to access the file directly.
Space Allocation
Files are allocated disk spaces by operating system. Operating systems
deploy following three main ways to allocate disk space to files.
Contiguous Allocation
Linked Allocation
Indexed Allocation
Contiguous Allocation
Easy to implement.
Linked Allocation
Each file carries a list of links to disk blocks.
No external fragmentation
Pa
Indexed Allocation
rd
ee
Va
ts
Each file has its own index block which stores the addresses of disk space
occupied by the file.
Program Threats
System Threats
Va
ts
ee
Authentication
Pa
rd
User card/key - User need to punch card in card slot, or enter key generated
by key generator in option provided by operating system to login into the
system.
Random numbers - Users are provided cards having numbers printed along
with corresponding alphabets. System asks for numbers corresponding to few
alphabets randomly chosen.
Secret key - User are provided a hardware device which can create a secret id
mapped with user id. System asks for such secret id which is to be generated
Va
ts
ee
Program Threats
login.
Pa
rd
Trojan Horse - Such program traps user login credentials and stores them to
send to malicious user who can later on login to computer and can access
system resources.
Logic Bomb - Logic bomb is a situation when a program misbehaves only when
certain conditions met otherwise it works as a genuine program. It is harder to
detect.
System Threats
Va
ts
ee
Pa
entire network.
rd
processes to get required resources. Worms processes can even shut down an
S.N.
Classification
Type
Description
Type A
Type B
Va
ts
access control.
resource, such
as
storage
objects,
supports
ee
Type C
Pa
rd
Type D
Kernel - Kernel is the core part of Linux. It is responsible for all major activities
of this operating system. It is consists of various modules and it interacts
directly with the underlying hardware. Kernel provides the required abstraction
Va
ts
rd
Pa
ee
ts
Mode which has no access to system hardwares and kernel code. User
programs/ utilities use System libraries to access Kernel functions to get
system's low level tasks.
Va
Basic Features
ee
Open Source - Linux source code is freely available and it is community based
Pa
rd
rd
ee
Va
ts
Architecture
Pa
ee
rd
Pa
ts
Va