Skip to content
geeksforgeeks
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Tutorials
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
  • Practice
    • Build your AI Agent
    • GfG 160
    • Problem of the Day
    • Practice Coding Problems
    • GfG SDE Sheet
  • Contests
    • Accenture Hackathon (Ending Soon!)
    • GfG Weekly [Rated Contest]
    • Job-A-Thon Hiring Challenge
    • All Contests and Events
  • Aptitude
  • Engineering Mathematics
  • Discrete Mathematics
  • Operating System
  • DBMS
  • Computer Networks
  • Digital Logic and Design
  • C Programming
  • Data Structures
  • Algorithms
  • Theory of Computation
  • Compiler Design
  • Computer Org and Architecture
Open In App
Next Article:
Difference Between Turn Around Time (TAT) and Waiting Time (WT) in CPU Scheduling
Next article icon

Difference Between Arrival Time and Burst Time in CPU Scheduling

Last Updated : 19 Sep, 2024
Comments
Improve
Suggest changes
Like Article
Like
Report

In CPU scheduling, there are two important terms called as “Arrival Time” and “Burst Time.” These two terms play a key role in understanding the way processes are managed in the operating system and specifically, when the CPU time is to be allocated towards different tasks. By knowing the difference between Arrival Time and Burst Time one is indeed in a position to know how the performance of processes within the system is and how the overall performance is offer affected.

What is Arrival Time (AT)?

Arrival time is the point of time in milliseconds at which a process arrives at the ready queue to begin the execution. It is merely independent of the CPU or I/O time and just depicts the time frame at which the process becomes available to complete its specified job. The process is independent of which process is there in the Running state. Arrival Time can be calculated as the difference between the Completion Time and the Turn Around Time of the process.

Arrival Time (A.T.) = Completion Time (C.T.) - Turn Around Time (T.A.T) 

Importance of Arrival Time

  • Order of Execution: It assists in understanding which processes should be selected for execution next one.
  • Scheduling Algorithms: Scheduling algorithms such as the FCFS largely rely on the Arrival Time in order to determine the CPU resource to allocate.
  • System Responsiveness: Sometimes, a process with a smaller Arrival Time is allocated a higher priority in some of the scheduling strategies.

What is Burst Time (BT)?

Burst Time refers to the time required in milliseconds by a process for its execution. The Burst Time takes into consideration the CPU time of a process. The I/O time is not taken into consideration. It is called the execution time or running time of the process. The process makes a transition from the Running state to the Completion State during this time frame. Burst time can be calculated as the difference between the Completion Time of the process and the Waiting Time, that is,

Burst Time (B.T.) = Completion Time (C.T.) - Waiting Time (W.T.) 

Importance of Burst Time

  • Process Completion: It directly impacts upon the time that would be required to complete a process’s run time.
  • Efficiency: The CPU also utilizes Burst Time in formulas for Introduce Priority (IP) in which resources are given to jobs that come with shorter Burst Time.
  • Turnaround Time: It affects not only the sojourn time a process takes within the system from the time it is entered till it is completed.

The following table illustrates the Arrival and Burst time of three processes P1, P2, and P3. A single CPU is allocated for the execution of these processes.

Processes Arrival Time (in ms) Burst Time (in ms)
P1 0 3
P2 4 2
P3 6 4

If we compute the Gantt chart, based on FCFS scheduling where the process that comes first in the ready queue is executed first. The process’s arrival decides the order of execution of the process for a time equal to its Burst time.

Gantt Chart

Since, the process P2 arrives at 4ms, and process P1 requires 3ms for its execution (=Burst Time), CPU waits for 1ms, that is the idle time for the CPU, where it doesn’t perform any process execution. The last process to get executed is P3. The following table illustrates the key differences in the Arrival and Burst Time respectively

Arrival Time Burst Time
Marks the entry point of the process in the queue. Marks the exit point of the process in the queue.
Computed before the execution of process. Computed after the execution of process.
Related to the Ready State of the CPU. Related to the Running State of the CPU.

Conclusion

Therefore, in CPU scheduling, both Arrival Time and Burst Time are rudimentary. Arrival Time determines at what time a process becomes eligible for execution while Burst Time indicates how long the process will require the services of the CPU to complete. It is necessary to realize the differences and their importance in order to fine-tune scheduling algorithms based on CPU and enhance the efficiency of a given system.



Next Article
Difference Between Turn Around Time (TAT) and Waiting Time (WT) in CPU Scheduling

Y

yippeee25
Improve
Article Tags :
  • Difference Between
  • GATE CS
  • Operating Systems

Similar Reads

  • Difference Between Turn Around Time (TAT) and Waiting Time (WT) in CPU Scheduling
    As for the evaluation of the performance of various algorithms in CPU scheduling, Turn Around Time (TAT) and Waiting Time (WT) used as measurement criteria. These two metrics are important because they define the effectiveness with which the processes go through a system. Turn Around Time means the
    5 min read
  • Difference Between User-CPU-Time and System-CPU-Time in UNIX
    Unix systems distinguish between different categories of time to help users understand where their application spent its processing time. They have a time utility that allows a user to see where their application took significant time to process. The syntax of this utility is as follows: time <co
    6 min read
  • Difference between Seek Time and Disk Access Time in Disk Scheduling
    Seek Time: A disk is divided into many circular tracks. Seek Time is defined as the time required by the read/write head to move from one track to another. Example, Consider the following diagram, the read/write head is currently on track 1. Now, on the next read/write request, we may want to read d
    3 min read
  • Difference between Table-driven and Cyclic Scheduling
    Clock-driven scheduling is the scheduling algorithm in which the scheduling points are determined by the clock interrupts. Clock-driven scheduling is of two types: 1. Table-driven Scheduling : In table-driven scheduling, the start timing of all tasks are precomputed and it is stored in a table at th
    2 min read
  • Difference between Time Sharing OS and Real-Time OS
    Prerequisite - Types of Operating Systems Time sharing operating system allows concurrent execution of programs through rapid switching thereby giving each process the same amount of time to execute. In this operating system Switching method/function is available. This switching is incredibly quick
    2 min read
  • Difference between Transfer Time and Disk Access Time in Disk Scheduling
    1. Transfer Time : Time required to transfer the required amount of data. It can be calculated by the given formula Transfer time, = Data to be transfer / transfer rate Data to be transfer is given in the question and transfer rate is sometimes given and sometimes it may not be given. It can be calc
    2 min read
  • Difference between FCFS and Priority CPU scheduling
    1. First Come First Served (FCFS) : First Come First Served (FCFS) is the simplest type of algorithm. It is a non-preemptive algorithm i.e. the process cannot be interrupted once it starts executing. The FCFS is implemented with the help of a FIFO queue. The processes are put into the ready queue in
    3 min read
  • Priority CPU Scheduling with different arrival time - Set 2
    Prerequisite -Program for Priority Scheduling - Set 1Priority scheduling is a non-preemptive algorithm and one of the most common scheduling algorithms in batch systems. Each process is assigned first arrival time (less arrival time process first) if two processes have same arrival time, then compar
    11 min read
  • Difference between SJF and LJF CPU scheduling algorithms
    Shortest Job First: The shortest job first (SJF) algorithm is a CPU scheduling algorithm designed to reorder the jobs so that the process having the smallest burst time is chosen for the next execution. It is used to reduce the average waiting time for other processes waiting for execution. This may
    4 min read
  • Difference Between console.time and console.timeEnd in JavaScript
    In JavaScript, console.time and console.timeEnd are powerful tools used for performance measurement. These methods allow developers to measure the time a block of code takes to execute, which is particularly useful for optimizing performance and debugging. Table of Content What is console. time?What
    2 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences