Skip to main content

Protection and security

 Protection and security

Protection in computer system

 

·         In the system with contiguous memory allocation,  protection is usually accomplished by the use of limit registers. Each program  is assigned a specific limit in term of address space . whenever any reference is made to an instruction of the limit register is checked to ensure that reference is within the bound of program otherwise the access to memory is denied.

·         In paging system, protection is achieved by the use of a page table. This page table list all the pages that a program can access.

·         In addition the table store access rights such as read, write or execute for each individual page.

·         In a system that uses segmentation, protection is accomplished by the use of segment table . each process has its segment table

 



·         In case of files stored on secondary storage devices suchj as disks, access rights are associated with each file system. Any user who tries to access a file may be denied the access depending upon the type of priviledge given to each other

·          Security refers to method of protecting information stored in the system, as well as the physical resource of the computer system from unauthorized access , malicious destruction or alteration and accidental introduction of inconsistency

·         Authorized users are those, whose identity are known and are allowed to use system resources whereas unauthorized users are those who are not allowed to use system resources.

 

Comments

Post a Comment

Popular posts from this blog

Multi user Operating System

  Multi user operating system ·           In a multi-user operating system, multiple number of user can access different resources of a computer at a same time. ·           The access is provided using a network that consists of various personal computer attached to a mainframe computer system.                                                              diagram of multi -user operating system       ·           The various personal computer can send and receive information to mainframe computer system. ·           The example    of multi-user OS are UNIX, windows 2000,novell netware.            sing...
Post a Comment
Read more

Exokernel architecture

Exokernel architecture Most of us know what kernels are and how do they work to make programmers’ lives easier. But, how many of us know what exokernels are? I hope you will be able to get a brief introduction on this terminology through this blog. Let’s start with a brief introduction on kernel. What is a kernel? A kernel is the foundational layer of an operating system that functions at a basic level, communicating with hardware and managing resources, such as CPU and the memory. It works as an interface between the user application and the hardware. There   are two main types of kernel 1. Micro kernel 2. Monolithic Kernel 1.  Monolithic architecture 2.      Layerd archtecture . 3.       Virtual machine architecture 4.       Exokernel architecture 5.      Client server architecture   6.       Micro kernel architecture Now let’s head into our main focus. What is an Exokern...
Post a Comment
Read more

Shortest Job First Scheduling (SJF)

  Shortest Job First Scheduling (SJF) ·          SJF ia also known as shortest-job-next(SJN) algorithm and is faster than FCFS. ·          In SJF, the process with the least estimated execution time is selected from the ready queue for   execution. ·          For this, SJF algorithm associates with each process, the length of its next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. ·          If tow processes have the same length of next CPU burst ,FCFS scheduling algorithm is used to break the tie. ·          SJF algorithm can be preemptive or non-preemptive.     Non-preeptive SJF ·          In non-preemptive SJF, scheduling, CPU is always assigned to the ...
Post a Comment
Read more

Scheduling Algorithms

     Scheduling Algorithms CPU scheduling algorithm deal with the problem of deciding which of the processes in the ready queue is to be allocated the CPU . six commonly used scheduling algorithms are: 1. first-come First-served(FCFS) 2. Shortest job First(SJF) 3. Priority scheduling 4. Round-Robin Scheduling(RR) 5. Multi-Level Queue Scheduling(MLQ) 6. Multi-Level Feedback Queue Scheduling (MFQ)       First-Come First-Served Scheduling (FCFS) ·       It is simplest and the most straight forward of all scheduling algorithms. ·       In this scheduling, the process that request the CPU first is allocated CPU first. Thus   the name first come first served. ·       We can say that in FCFS scheduling, a process is allocated CPU time according to the arrival time of a process. ·       The implementation of FCFS policy is easily manged with a FIFO queue...
Post a Comment
Read more

Multi Level Queue Scheduling (MLQ)

  Multi Level Queue Scheduling (MLQ) ·          Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common. ·          In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue ·          The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type ·          Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method ·          For example, consider a system with four different queues 1.   ...
Post a Comment
Read more