CPU Scheduling in Operating
Systems
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
CPU Scheduling in Operating Systems, Schemes and Mind Maps of Operating Systems
terminologies of Scheduling algorithm
Typology: Schemes and Mind Maps
2021/2022
1 / 7
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download CPU Scheduling in Operating Systems and more Schemes and Mind Maps Operating Systems in PDF only on Docsity!
CPU Scheduling in Operating
Systems
What are the different types of CPU Scheduling Algorithms?
What is the need for CPU scheduling algorithm? What are the different terminologies to
take care of in any CPU Scheduling
algorithm?
Things to take care while designing a
CPU Scheduling algorithm?
What is Process Scheduling?
Why do we need to schedule processes?
What is a process?
How is process memory used for efficient operation?
HOW IS PROCESS MEMORY USED FOR
EFFICIENT OPERATION?
The Process memory is divided into four sections for
efficient operation:
The stack is used for local variables. The space in the
stack is reserved for local variables when it is announced.
Heap is used for flexible, or dynamic memory allocation
and is managed by calls to new, delete, malloc, free, etc.
The data class is made up of global and static variables,
distributed and executed before the main action.
The text category is composed of integrated program
code, which is read from fixed storage when the program is
launched.
What are the different terminologies to take care of in
any CPU Scheduling algorithm?
Arrival Time:
Time at which the process arrives in the ready queue.
Completion
Time:
Time at which process completes its execution.
Burst Time:
Time required by a process for CPU execution.
Turn Around
Time