how Seema foress can be used to deal with reader write classical Types of Operating Systems

synchronisation problem • Batch Operating System: A Batch Operating System is a type of operating system that do
the computer directly. There is an operator who takes similar jobs having the same requir
them into batches. Advantages • The overall time the system takes to execute all the prog
With the evolution of multi-processors, tasks suffer due to over -
heads and traffic. To manage the resources efficiently, synchro - • Less time to execute all programs. • These operating systems are shared between multi
nization is needed. Synchronization ensures perfect execution small-scale businesses. • It can work in offline mode also. • It can give specific time to the
of processes and controlled access to shared resources. Syn- a computer is idle can process the jobs. Disadvantages • Sometimes, manual intervention
chronization in operating systems is often explained with the between two batches. • The CPU utilization is low because the time taken in loading and
help of real-life examples. very high compared to execution time. • Sometimes, jobs enter into an infinite loop due t
In this article, we will see a number of classical problems Meanwhile, if one job takes too much time, other jobs must wait. • Time-sharing Operati
of synchronization as examples of a large class of concurrency- sharing Operating System is a type of operating system that allows many users to share co
control problems. In our solutions to the problems, we use sem- (maximum utilization of the resources). It allows multiple users to access the same resou
aphores for synchronization, since that is the traditional way to applications, as long as they are logged in simultaneously. This operating system type is m
present such solutions. However, actual implementations of businesses, especially those that involve many simultaneous users. Time-sharing operatin
these solutions could use mutex locks instead of binary sema- to finish their jobs on a system at once. The time-sharing OS is the latest advancement in
phores. world; it is being accepted worldwide, also at an increasing rate. • Distributed Operating
Synchronization Problems with Semaphore Solution Operating System is a type of operating system that manages a group of different comput
These problems are used for testing nearly every newly pro- to be a single computer. These operating systems are designed to operate on a network o
posed synchronization scheme. The following problems of syn- allow multiple users to access shared resources and communicate with each other over t
chronization are considered as classical problems: include Microsoft Windows Server and various distributions of Linux designed for servers
1. Bounded-buffer (or Producer-Consumer) Prob-
of Distributed Operating System. 1. Client-Server Systems This strongly connected operati
lem,
appropriate for multiprocessors and homogenous multicomputer. It functions as a centra
2. Dining-Philosophers Problem,
3. Readers and Writers Problem, and approving Network Operating System: Network Operating System is a type of operati
4. Sleeping Barber Problem a server and provides the capability to manage data, users, groups, security, applications,
functions.Real-time Operating System: Real-time Operating System is a type of operating
real-time system and the time interval required to process and respond to inputs is very s
systems are designed to respond to events in real time. They are used in applications that
deterministic responses, such as embedded systems, industrial control systems, and robo
Operating Systems: Multi-User Operating Systems are designed to support multiple users
Examples include Linux and Unix. In a multiuser operating system, multiple numbers of u
different resources of a computer at the same time. The access is provided using a netwo
various personal computers attached to a mainframe computer system. A multi-user ope
the permission of multiple users for accessing a single machine at a timSingle-User Opera
(RTOS)?A real-time operating system (RTOS) is a special kind of operating sy
handle tasks that need to be completed quickly and on time. Unlike general-pu
systems (GPOS), which are good at multitasking and user interaction,

tWhat is Process Scheduling? Process scheduling is the activity of the process manager th
of the running process from the CPU and the selection of another process based on a par
Process scheduling is an essential part of a Multiprogramming operating system. Such op
more than one process to be loaded into the executable memory at a time and the loade
CPU using time multiplexing. Categories of Scheduling Scheduling falls into one of two ca
preemptive: In this case, a process’s resource cannot be taken before the process has fini
running process finishes and transitions to a waiting state, resources are switched. • Pree
the OS assigns resources to a process for a predetermined period. The process switches f
ready state or from waiting for state to ready state during resource allocation. This switch
the CPU may give other processes priority and substitute the currently active process for
process. Types of Process Schedulers There are three types of process schedulers: 1. Long
It brings the new process to the ‘Ready State’. It controls the Degree of Multi-programmin
processes present in a ready state at any point in time. It is important that the long-term
careful selection of both I/O and CPU-bound processes. I/Obound tasks are which use mu
input and output operations while CPUbound processes are which spend their time on th
scheduler increases efficiency by maintaining a balance between the two. They operate a
typically used in batch-processing systems. 2. Short-Term or CPU Scheduler It is responsib
process from the ready state for scheduling it on the running state. Note: Short-term sche
process to schedule it doesn’t load the process on running. Here is when all the schedulin
The CPU scheduler is responsible for ensuring no starvation due to high burst time proces
responsible for loading the process selected by the Short-term scheduler on the CPU (Rea
Context switching is done by the dispatcher only. A dispatcher does the following: • Switc
Switching to user mode. • Jumping to the proper location in the newly loaded program. 3
Scheduler It is responsible for suspending and resuming the process. It mainly does swap
from main memory to disk and vice versa). Swapping may be necessary to improve the pr
change in memory requirements has overcommitted available memory, requiring memor
helpful in maintaining a perfect balance between the I/O bound and the CPU bound. It re
multiprogramming. Some Other Schedulers • I/O schedulers: I/O schedulers are in charge
execution of I/O operations such as reading and writing to discs or networks. They can us
determine the order in which I/O operations are executed, such as FCFS (First-Come, First
Robin). • Real-time schedulers: In real-time systems, real-time schedulers ensure that criti
completed within a specified time frame. They can prioritize and schedule tasks using var

explain the concept of paging

Seek time is the time required to move the disk arm to the required Paging is a memory management scheme that eliminates the need for a I/O buffer
track. Rotational delay or latency is the time it takes for the contiguous allocation of physical memory. The process of retrieving pro-
beginning of the required sector to reach the head. Sum of seek cesses in the form of pages from the secondary storage into the main
memory is known as paging. The basic purpose of paging is to separate Buffers help improve system performance by allowing the CPU and I/O devices to
time (if any) and latency is the access time. speeds. They also help prevent data loss and ensure smooth interaction between
each procedure into pages. Additionally, frames will be used to split the
main memory. This scheme permits the physical address space of a system. Input and output buffers are both memory areas that temporarily store data b
Latency time in an operating system (OS) is the delay between process to be non – contiguous. between a device and a computer's processor Input/output buffering, or IO buffering, i
when a user takes an action and when it is received by the In paging, the physical memory is divided into fixed-size blocks that occurs between a processor (which produces the data) and a peripheral devi
destination. It is measured in milliseconds and can be caused by called page frames, which are the same size as the pages used by the the data) in order to smooth out the difference in rates at which the devices can re
many factors within the network. process. The process’s logical address space is also divided into fixed- data.What is I/O Buffering?I/O buffering is a technique used in computer syste
size blocks called pages, which are the same size as the page frames. efficiency of input and output (I/O) operations. It involves the temporary storag
Swapping in an operating system (OS) is a memory management When a process requests memory, the operating system allocates one or which is a reserved area of memory, to reduce the number of I/O operations an
more page frames to the process and maps the process’s logical of data between fast and slow devices or processesAn output buffer is a tempo
technique that temporarily moves processes from main memory to
pages to the physical page frames.
secondary memory, or vice versa: Swapping in OS is a memory for outgoing data before it's sent to an output device, such as a monitor or printer.
The mapping between logical pages and physical page frames is main -
management technique that temporarily swaps processes from useful because it allows the programmer to control when output is sent to the brow
tained by the page table, which is used by the memory management
main memory to secondary memory or vice versa which helps to unit to translate logical addresses into physical addresses. The page ta - sent. Without output buffering, the browser would receive the output in pieces.Typ
increase the degree of multi-programming and increase main ble maps each logical page number to a physical page frame number Techniques1. Single BufferUsing one buffer to store data temporarily. A buffer
memory utilisation. The address generated by the CPU is divided into operating system to the system portion of the main memory. Double BufferIn th

 Page number(p): Number of bits required to represent the pages

operating system Uses two buffers to allow continuous data transfer between t
devices
in Logical Address Space or Page number
 Page offset(d): Number of bits required to represent a particular
word in a page or page size of Logical Address Space or word
number of a page or page offset.