wisemonkeys logo
FeedNotificationProfileManage Forms
FeedNotificationSearchSign in
wisemonkeys logo

Blogs

Traditional UNIX Scheduling

profile
Parth Patel
Sep 09, 2024
0 Likes
0 Discussions
224 Reads

Traditional UNIX scheduling, as used in  SVR3  and  4.3 BSD UNIX , is primarily designed for a  time-sharing interactive environment . The goal of the scheduling algorithm is to provide good  response time  for interactive users while ensuring that low-priority background jobs do not starve. Although modern UNIX systems have replaced this algorithm, understanding its structure offers valuable insights into  time-sharing scheduling .


 Multilevel Feedback with Round Robin:-


The traditional UNIX scheduler employs a  multilevel feedback queue  combined with a  round-robin scheduling  approach within each priority queue. This means processes are assigned to different queues based on their priority, and within each queue, processes take turns executing.


One-Second Preemption:-


The system uses  one-second preemption , meaning that if a running process does not block or complete within one second, it is preempted. This ensures that no single process can monopolize the CPU for too long, maintaining fairness across processes.


Priority Calculation:-


Process priority is determined based on the process type and  execution history . The following formulas are used to calculate CPU utilization and process priority:



Priority Recalculation:-


The priority of each process is recomputed  once per second , at which point a new scheduling decision is made. The  base priority  ensures processes remain within fixed priority bands. These bands group processes into different priority levels, such as  Swapper ,  Block I/O device control ,  File manipulation ,  Character I/O device control , and  User processes .


The bands are used to:


-  Optimize access to block devices  (like disk drives).


-  Respond quickly to system calls .



I/O-Bound vs. CPU-Bound Processes:-


Within the  user process band , the scheduler penalizes  processor-bound processes  (those using significant CPU time) and favors  I/O-bound processes  (those waiting for input/output operations). This helps improve system efficiency by ensuring that processes waiting for I/O can proceed quickly, while processes that are consuming large amounts of CPU time are deprioritized.


Scheduling Example:-


An example of process scheduling might involve three processes (A, B, and C), all starting at the same time with a  base priority  of 60. Ignoring the  nice value , the clock interrupts the system 60 times per second, incrementing a counter for the running process. Assuming none of the processes block themselves and no other processes are ready to run, they are scheduled based on their priorities, and preempted as necessary.


 Conclusion:-


The traditional UNIX scheduling algorithm is well-suited to general-purpose time-sharing environments. By using multilevel feedback, round-robin preemption, and execution history, it balances the needs of  interactive users  and  background tasks  while ensuring efficient use of system resources, especially I/O devices.


Comments ()


Sign in

Read Next

MODERN OPERATING SYSTEMS

Blog banner

BUFFER OVERFLOW_142

Blog banner

Metasploit

Blog banner

Why Khari and toast is the ideal Tea Break snack?

Blog banner

E-security systems | CCTV

Blog banner

Decrypting Cryptocurrency: Tracing Transactions in Cyber Investigations

Blog banner

Risk mitigation and management

Blog banner

GIS Mapping

Blog banner

Modern Teaching Methods: Why Inquiry-based & Experiential Learning Works Best

Blog banner

Security in Cloud Computing

Blog banner

Honeypot in cyber security

Blog banner

Cross site scripting Attack

Blog banner

MEMORY HIERARCHY

Blog banner

Self-Healing PPF Explained: How Does It Remove Minor Scratches from Your Car?

Blog banner

Explain website hacking issues

Blog banner

10 Signs your Computer has Virus

Blog banner

Synchronization

Blog banner

Bots and Cyber Security

Blog banner

Software Piracy & Online Data Protection in Digital World

Blog banner

"Geographic Information Systems (GIS) and its Applications in Urban Planning"

Blog banner

Revolutionary AI Tool: ChatGPT

Blog banner

Theads

Blog banner

geographic information system (GIS)

Blog banner

Virtual Memory

Blog banner

What is the point of living if we can die at any moment of our lives ?

Blog banner

Save Girl Child

Blog banner

Starvation

Blog banner

WINDOWS I/ O

Blog banner

Why Every Preschooler Learns at Their Own Pace?

Blog banner

Importance Of Blockchain

Blog banner

Predictive Analytics: How Data Science Predicts Trends(Weather ,Stock Market,Sales Forecasting ).

Blog banner

Earth with no trees

Blog banner

Street foods

Blog banner

Multiple-Processor Scheduling in Operating System

Blog banner

Digital Forensics Challenges and Tools

Blog banner

Kernel Modes: User Mode vs. Kernel Mode - 80

Blog banner

SNAPCHAT

Blog banner

Processes : Process description and control

Blog banner

Embaded operating system

Blog banner

indian premier league

Blog banner

A Journey By Train

Blog banner

Dekkers Algorithm

Blog banner