• About WordPress
    • WordPress.org
    • Documentation
    • Support
    • Feedback
  • Log In
  • Register
  • Home
  • Courses
  • Past Paper
  • FYP
  • Interview Questions
  • University Events
  • Contact
  • Quiz & Assignment
Cuitutorial
  • Home
  • Courses
  • Past Paper
  • FYP
  • Interview Questions
  • University Events
  • Contact
  • Quiz & Assignment

Operating System

Home » Blog » Aging in operating system

Aging in operating system

  • Posted by saqib
  • Categories Operating System
  • Date January 6, 2023
  • Comments 0 comment

Aging in operating system

In Operating systems, Aging is a scheduling technique used to avoid Starvation. Fixed priority scheduling is a scheduling discipline in which tasks queued for utilizing a system resource is assigned each priority. A task with a high priority is allowed to access a specific system resource before a task with a lower priority is allowed to do the same.

Aging is a technique of gradually increasing the priority (by time quantum) of processes that wait in the system for a long time. By doing so, as time passes, the lower priority process becomes a higher priority process.

A disadvantage of this approach is that tasks assigned with a lower priority may be starved when many high priority tasks are queued. Aging is used to gradually increase the priority of a task based on its waiting time in the ready queue.





Problem

In priority-based scheduling algorithms, a major problem is an indefinite block or Starvation. A process that is ready to run but waiting for the CPU can be considered blocked. A priority scheduling algorithm can leave some low-priority processes waiting indefinitely. A steady stream of higher-priority processes can prevent a low-priority process from ever getting the CPU.

  • Increasing Process
    If priority ranges from 127(low) to 0(high), we could increase the priority of a waiting process by 1 Every 15 minutes. Eventually, even a process with an initial priority of 127 would take no more than 32 hours for the priority 127 processes to age to a priority-0 process.
  • Decreasing Process
    If a process P has a priority number as 127 at 0 minutes, then after every 15 minutes (time quantum), decreasing the priority number of the process P by 1. So, after 15 m, the priority of the process P will be 126. Again after 15 m, decreasing the priority number of process P by 1. So, after 30 m, the priority of the process P will become 125, and this process will continue. Process P will become a high priority process when the priority number comes closer to 0, and process P will get the CPU for its execution after a very long time.




Uses of Aging

Aging is used to ensure that jobs with lower priority will eventually complete their execution. This technique can be used to reduce the Starvation of low priority tasks. There are many ways to implement Aging, but all have the same principle that the priority of a process should increase as it waits in the ready queue. The increase in priority may or may not be equal to the waiting time of the process

  • Share:
author avatar
saqib

Previous post

Starvation in operating system
January 6, 2023

Next post

Programming fundamental Overview and Course Outline
February 20, 2023

You may also like

Starvation in operating system
6 January, 2023

Starvation in operating system It is a problem when the low-priority process gets jammed for a long duration of time because of high-priority requests being executed. A stream of high-priority requests stops the low-priority process from obtaining the processor or …

Dead Lock in operating system
3 January, 2023

Dead Lock in operating system   A Deadlock is a situation where each of the computer process waits for a resource which is being assigned to some another process. In this situation, none of the process gets executed since the …

Round Robin Scheduling Algorithm in Operating system
2 January, 2023

Round Robin Scheduling algorithm with Example The round-robin scheduling takes its name from the round-robin scheduling idea. This principle states that everyone will divide anything they possess equally among themselves. Round Robin scheduling algorithm is used in a time-sharing system. …

Leave A Reply Cancel reply

You must be logged in to post a comment.

admin@cuitutorial.com
Facebook-f Twitter Youtube Linkedin Instagram Stack-overflow Pinterest Github Quora Whatsapp
Courses
  • All Courses
  • Past Paper
  • Final year projects
  • Interview Questions
  • Contact
Important Pages
  • Privacy Policy
  • Terms of Service
  • Cookie Policy
Links
  • University Events
  • Team
Education & learning platform for All Computer science subjects
Final year projects
Past Paper
Interview questions
Programming, C/C++, Asp.net/MVC. Android, MySql, Jquery, Ajax, javascript, Php, Html5, Bootstrap4.
NTS, GAT, PPSC, FPSC

Copyright © 2021 | Cuitutorial