{"id":3250,"date":"2025-06-06T14:40:32","date_gmt":"2025-06-06T14:40:32","guid":{"rendered":"https:\/\/diznr.com\/?p=3250"},"modified":"2025-06-06T14:40:32","modified_gmt":"2025-06-06T14:40:32","slug":"day-02part-03-various-types-of-times-in-process-scheduling-algorithm-arrival-tat-burst","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/day-02part-03-various-types-of-times-in-process-scheduling-algorithm-arrival-tat-burst\/","title":{"rendered":"Day 02Part 03- Various types of times in Process Scheduling algorithm, Arrival, Burst TAT."},"content":{"rendered":"<p>Day 02Part 03- Various types of times in Process Scheduling algorithm, Arrival, Burst TAT.<\/p>\n<p>[fvplayer id=&#8221;318&#8243;]<\/p>\n<h3 data-start=\"0\" data-end=\"84\"><strong data-start=\"4\" data-end=\"82\">\u00a0Day 02 | Part 03 \u2013 Process Scheduling Algorithm: Various Types of Times<\/strong><\/h3>\n<p data-start=\"86\" data-end=\"261\">Process scheduling in an operating system involves different types of times that determine the efficiency and execution sequence of processes. Let\u2019s explore them one by one:<\/p>\n<h3 data-start=\"268\" data-end=\"296\"><strong data-start=\"271\" data-end=\"296\">\u00a0Arrival Time (AT)<\/strong><\/h3>\n<p data-start=\"297\" data-end=\"451\"><strong data-start=\"300\" data-end=\"315\">Definition:<\/strong> The time when a process <strong data-start=\"340\" data-end=\"366\">enters the ready queue<\/strong>.<br data-start=\"367\" data-end=\"370\" \/>\u2714 <strong data-start=\"372\" data-end=\"384\">Example:<\/strong> If Process P1 arrives at time <strong data-start=\"415\" data-end=\"423\">0 ms<\/strong> and P2 at <strong data-start=\"434\" data-end=\"442\">2 ms<\/strong>, then:<\/p>\n<ul data-start=\"455\" data-end=\"501\">\n<li data-start=\"455\" data-end=\"476\">AT(P1) = <strong data-start=\"466\" data-end=\"474\">0 ms<\/strong><\/li>\n<li data-start=\"480\" data-end=\"501\">AT(P2) = <strong data-start=\"491\" data-end=\"499\">2 ms<\/strong><\/li>\n<\/ul>\n<h3 data-start=\"508\" data-end=\"534\"><strong data-start=\"511\" data-end=\"534\">\u00a0Burst Time (BT)<\/strong><\/h3>\n<p data-start=\"535\" data-end=\"688\"><strong data-start=\"538\" data-end=\"553\">Definition:<\/strong> The <strong data-start=\"558\" data-end=\"572\">total time<\/strong> required by a process to execute on the CPU.<br data-start=\"617\" data-end=\"620\" \/>\u00a0Also called <strong data-start=\"634\" data-end=\"652\">Execution Time<\/strong> or <strong data-start=\"656\" data-end=\"668\">CPU Time<\/strong>.<br data-start=\"669\" data-end=\"672\" \/><strong data-start=\"674\" data-end=\"686\">Example:<\/strong><\/p>\n<ul data-start=\"692\" data-end=\"839\">\n<li data-start=\"692\" data-end=\"739\">P1 requires <strong data-start=\"706\" data-end=\"714\">5 ms<\/strong> to complete execution.<\/li>\n<li data-start=\"743\" data-end=\"790\">P2 requires <strong data-start=\"757\" data-end=\"765\">8 ms<\/strong> to complete execution.<\/li>\n<li data-start=\"794\" data-end=\"839\">So, BT(P1) = <strong data-start=\"809\" data-end=\"817\">5 ms<\/strong>, BT(P2) = <strong data-start=\"828\" data-end=\"836\">8 ms<\/strong>.<\/li>\n<\/ul>\n<h3 data-start=\"846\" data-end=\"878\"><strong data-start=\"849\" data-end=\"878\">\u00a0Turnaround Time (TAT)<\/strong><\/h3>\n<p data-start=\"879\" data-end=\"982\"><strong data-start=\"882\" data-end=\"897\">Definition:<\/strong> The total time taken by a process from <strong data-start=\"937\" data-end=\"962\">arrival to completion<\/strong>.<br data-start=\"963\" data-end=\"966\" \/><strong data-start=\"968\" data-end=\"980\">Formula:<\/strong><\/p>\n<p><span class=\"katex-display\"><span class=\"katex\"><span class=\"katex-mathml\">TAT=CompletionTime(CT)\u2212ArrivalTime(AT)TAT = Completion Time (CT) &#8211; Arrival Time (AT)<\/span><span class=\"katex-html\" aria-hidden=\"true\"><span class=\"base\"><span class=\"mord mathnormal\">T<\/span><span class=\"mord mathnormal\">A<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mrel\">=<\/span><\/span><span class=\"base\"><span class=\"mord mathnormal\">C<\/span><span class=\"mord mathnormal\">o<\/span><span class=\"mord mathnormal\">m<\/span><span class=\"mord mathnormal\">pl<\/span><span class=\"mord mathnormal\">e<\/span><span class=\"mord mathnormal\">t<\/span><span class=\"mord mathnormal\">i<\/span><span class=\"mord mathnormal\">o<\/span><span class=\"mord mathnormal\">n<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mord mathnormal\">im<\/span><span class=\"mord mathnormal\">e<\/span><span class=\"mopen\">(<\/span><span class=\"mord mathnormal\">CT<\/span><span class=\"mclose\">)<\/span><span class=\"mbin\">\u2212<\/span><\/span><span class=\"base\"><span class=\"mord mathnormal\">A<\/span><span class=\"mord mathnormal\">rr<\/span><span class=\"mord mathnormal\">i<\/span><span class=\"mord mathnormal\">v<\/span><span class=\"mord mathnormal\">a<\/span><span class=\"mord mathnormal\">lT<\/span><span class=\"mord mathnormal\">im<\/span><span class=\"mord mathnormal\">e<\/span><span class=\"mopen\">(<\/span><span class=\"mord mathnormal\">A<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mclose\">)<\/span><\/span><\/span><\/span><\/span><\/p>\n<p data-start=\"1047\" data-end=\"1130\"><strong data-start=\"1049\" data-end=\"1061\">Example:<\/strong> If a process arrives at <strong data-start=\"1086\" data-end=\"1094\">0 ms<\/strong> and completes at <strong data-start=\"1112\" data-end=\"1121\">10 ms<\/strong>, then:<\/p>\n<ul data-start=\"1134\" data-end=\"1162\">\n<li data-start=\"1134\" data-end=\"1162\">AT = <strong data-start=\"1142\" data-end=\"1160\">10 &#8211; 0 = 10 ms<\/strong><\/li>\n<\/ul>\n<h3 data-start=\"1169\" data-end=\"1197\"><strong data-start=\"1172\" data-end=\"1197\">\u00a0Waiting Time (WT)<\/strong><\/h3>\n<p data-start=\"1198\" data-end=\"1316\"><strong data-start=\"1201\" data-end=\"1216\">Definition:<\/strong> The total time a process spends <strong data-start=\"1249\" data-end=\"1279\">waiting in the ready queue<\/strong> before execution.<br data-start=\"1297\" data-end=\"1300\" \/><strong data-start=\"1302\" data-end=\"1314\">Formula:<\/strong><\/p>\n<p><span class=\"katex-display\"><span class=\"katex\"><span class=\"katex-mathml\">WT=TurnaroundTime(TAT)\u2212BurstTime(BT)WT = Turnaround Time (TAT) &#8211; Burst Time (BT)<\/span><span class=\"katex-html\" aria-hidden=\"true\"><span class=\"base\"><span class=\"mord mathnormal\">W<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mrel\">=<\/span><\/span><span class=\"base\"><span class=\"mord mathnormal\">T<\/span><span class=\"mord mathnormal\">u<\/span><span class=\"mord mathnormal\">r<\/span><span class=\"mord mathnormal\">na<\/span><span class=\"mord mathnormal\">ro<\/span><span class=\"mord mathnormal\">u<\/span><span class=\"mord mathnormal\">n<\/span><span class=\"mord mathnormal\">d<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mord mathnormal\">im<\/span><span class=\"mord mathnormal\">e<\/span><span class=\"mopen\">(<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mord mathnormal\">A<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mclose\">)<\/span><span class=\"mbin\">\u2212<\/span><\/span><span class=\"base\"><span class=\"mord mathnormal\">B<\/span><span class=\"mord mathnormal\">u<\/span><span class=\"mord mathnormal\">rs<\/span><span class=\"mord mathnormal\">tT<\/span><span class=\"mord mathnormal\">im<\/span><span class=\"mord mathnormal\">e<\/span><span class=\"mopen\">(<\/span><span class=\"mord mathnormal\">BT<\/span><span class=\"mclose\">)<\/span><\/span><\/span><\/span><\/span><\/p>\n<p data-start=\"1379\" data-end=\"1395\"><strong data-start=\"1381\" data-end=\"1393\">Example:<\/strong><\/p>\n<ul data-start=\"1399\" data-end=\"1472\">\n<li data-start=\"1399\" data-end=\"1442\">If TAT = <strong data-start=\"1410\" data-end=\"1419\">10 ms<\/strong>, BT = <strong data-start=\"1426\" data-end=\"1434\">5 ms<\/strong>, then<\/li>\n<li data-start=\"1446\" data-end=\"1472\">WT = <strong data-start=\"1453\" data-end=\"1470\">10 &#8211; 5 = 5 ms<\/strong><\/li>\n<\/ul>\n<h3 data-start=\"1479\" data-end=\"1510\"><strong data-start=\"1482\" data-end=\"1510\">\u00a0Completion Time (CT)<\/strong><\/h3>\n<p data-start=\"1511\" data-end=\"1652\"><strong data-start=\"1514\" data-end=\"1529\">Definition:<\/strong> The time at which a process <strong data-start=\"1558\" data-end=\"1580\">finishes execution<\/strong>.<br data-start=\"1581\" data-end=\"1584\" \/><strong data-start=\"1586\" data-end=\"1598\">Example:<\/strong> If process P1 finishes execution at <strong data-start=\"1635\" data-end=\"1644\">12 ms<\/strong>, then<\/p>\n<ul data-start=\"1656\" data-end=\"1678\">\n<li data-start=\"1656\" data-end=\"1678\">CT(P1) = <strong data-start=\"1667\" data-end=\"1676\">12 ms<\/strong><\/li>\n<\/ul>\n<h3 data-start=\"1685\" data-end=\"1714\"><strong data-start=\"1688\" data-end=\"1714\">\u00a0Response Time (RT)<\/strong><\/h3>\n<p data-start=\"1715\" data-end=\"1815\"><strong data-start=\"1718\" data-end=\"1733\">Definition:<\/strong> The time from <strong data-start=\"1748\" data-end=\"1782\">arrival to the first execution<\/strong> of a process.<br data-start=\"1796\" data-end=\"1799\" \/><strong data-start=\"1801\" data-end=\"1813\">Formula:<\/strong><\/p>\n<p><span class=\"katex-display\"><span class=\"katex\"><span class=\"katex-mathml\">RT=FirstExecutionTime\u2212ArrivalTime(AT)RT = First Execution Time &#8211; Arrival Time (AT)<\/span><span class=\"katex-html\" aria-hidden=\"true\"><span class=\"base\"><span class=\"mord mathnormal\">RT<\/span><span class=\"mrel\">=<\/span><\/span><span class=\"base\"><span class=\"mord mathnormal\">F<\/span><span class=\"mord mathnormal\">i<\/span><span class=\"mord mathnormal\">rs<\/span><span class=\"mord mathnormal\">tE<\/span><span class=\"mord mathnormal\">x<\/span><span class=\"mord mathnormal\">ec<\/span><span class=\"mord mathnormal\">u<\/span><span class=\"mord mathnormal\">t<\/span><span class=\"mord mathnormal\">i<\/span><span class=\"mord mathnormal\">o<\/span><span class=\"mord mathnormal\">n<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mord mathnormal\">im<\/span><span class=\"mord mathnormal\">e<\/span><span class=\"mbin\">\u2212<\/span><\/span><span class=\"base\"><span class=\"mord mathnormal\">A<\/span><span class=\"mord mathnormal\">rr<\/span><span class=\"mord mathnormal\">i<\/span><span class=\"mord mathnormal\">v<\/span><span class=\"mord mathnormal\">a<\/span><span class=\"mord mathnormal\">lT<\/span><span class=\"mord mathnormal\">im<\/span><span class=\"mord mathnormal\">e<\/span><span class=\"mopen\">(<\/span><span class=\"mord mathnormal\">A<\/span><span class=\"mord mathnormal\">T<\/span><span class=\"mclose\">)<\/span><\/span><\/span><\/span><\/span><\/p>\n<p data-start=\"1879\" data-end=\"1895\"><strong data-start=\"1881\" data-end=\"1893\">Example:<\/strong><\/p>\n<ul data-start=\"1899\" data-end=\"2003\">\n<li data-start=\"1899\" data-end=\"1974\">If a process arrives at <strong data-start=\"1925\" data-end=\"1933\">0 ms<\/strong> but starts execution at <strong data-start=\"1958\" data-end=\"1966\">3 ms<\/strong>, then<\/li>\n<li data-start=\"1978\" data-end=\"2003\">RT = <strong data-start=\"1985\" data-end=\"2001\">3 &#8211; 0 = 3 ms<\/strong><\/li>\n<\/ul>\n<h3 data-start=\"2010\" data-end=\"2034\"><strong data-start=\"2013\" data-end=\"2034\">\u00a0Summary Table:<\/strong><\/h3>\n<div class=\"overflow-x-auto contain-inline-size\">\n<table data-start=\"2035\" data-end=\"2585\">\n<thead data-start=\"2035\" data-end=\"2072\">\n<tr data-start=\"2035\" data-end=\"2072\">\n<th data-start=\"2035\" data-end=\"2048\">Time Type<\/th>\n<th data-start=\"2048\" data-end=\"2061\">Definition<\/th>\n<th data-start=\"2061\" data-end=\"2072\">Formula<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"2116\" data-end=\"2585\">\n<tr data-start=\"2116\" data-end=\"2197\">\n<td><strong data-start=\"2118\" data-end=\"2139\">Arrival Time (AT)<\/strong><\/td>\n<td>When process arrives in the queue<\/td>\n<td>Given in question<\/td>\n<\/tr>\n<tr data-start=\"2198\" data-end=\"2264\">\n<td><strong data-start=\"2200\" data-end=\"2219\">Burst Time (BT)<\/strong><\/td>\n<td>Total execution time<\/td>\n<td>Given in question<\/td>\n<\/tr>\n<tr data-start=\"2265\" data-end=\"2340\">\n<td><strong data-start=\"2267\" data-end=\"2292\">Turnaround Time (TAT)<\/strong><\/td>\n<td>Time from arrival to completion<\/td>\n<td><code data-start=\"2329\" data-end=\"2338\">CT - AT<\/code><\/td>\n<\/tr>\n<tr data-start=\"2341\" data-end=\"2409\">\n<td><strong data-start=\"2343\" data-end=\"2364\">Waiting Time (WT)<\/strong><\/td>\n<td>Time spent waiting in queue<\/td>\n<td><code data-start=\"2397\" data-end=\"2407\">TAT - BT<\/code><\/td>\n<\/tr>\n<tr data-start=\"2410\" data-end=\"2494\">\n<td><strong data-start=\"2412\" data-end=\"2436\">Completion Time (CT)<\/strong><\/td>\n<td>When process finishes execution<\/td>\n<td>Given or calculated<\/td>\n<\/tr>\n<tr data-start=\"2495\" data-end=\"2585\">\n<td><strong data-start=\"2497\" data-end=\"2519\">Response Time (RT)<\/strong><\/td>\n<td>Time from arrival to first execution<\/td>\n<td><code data-start=\"2561\" data-end=\"2583\">First Execution - AT<\/code><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<h3 data-start=\"2592\" data-end=\"2619\"><strong data-start=\"2596\" data-end=\"2619\">\u00a0Example Problem:<\/strong><\/h3>\n<p data-start=\"2620\" data-end=\"2642\"><strong data-start=\"2620\" data-end=\"2640\">Given Processes:<\/strong><\/p>\n<div class=\"overflow-x-auto contain-inline-size\">\n<table data-start=\"2643\" data-end=\"2752\">\n<thead data-start=\"2643\" data-end=\"2664\">\n<tr data-start=\"2643\" data-end=\"2664\">\n<th data-start=\"2643\" data-end=\"2653\">Process<\/th>\n<th data-start=\"2653\" data-end=\"2658\">AT<\/th>\n<th data-start=\"2658\" data-end=\"2664\">BT<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"2687\" data-end=\"2752\">\n<tr data-start=\"2687\" data-end=\"2708\">\n<td>P1<\/td>\n<td>0<\/td>\n<td>5<\/td>\n<\/tr>\n<tr data-start=\"2709\" data-end=\"2730\">\n<td>P2<\/td>\n<td>1<\/td>\n<td>3<\/td>\n<\/tr>\n<tr data-start=\"2731\" data-end=\"2752\">\n<td>P3<\/td>\n<td>2<\/td>\n<td>8<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<p data-start=\"2754\" data-end=\"2829\">If scheduled using <strong data-start=\"2773\" data-end=\"2806\">FCFS (First Come First Serve)<\/strong>, find TAT, WT, and RT.<\/p>\n<p data-start=\"2836\" data-end=\"2894\" data-is-last-node=\"\" data-is-only-node=\"\">Would you like me to solve this example step by step?<\/p>\n<h3 data-start=\"2836\" data-end=\"2894\"><a href=\"https:\/\/aissmspoly.org.in\/wp-content\/uploads\/2020\/01\/CPU-Scheduling-and-Algorithm-.pdf\" target=\"_blank\" rel=\"noopener\">Day 02Part 03- Various types of times in Process Scheduling algorithm, Arrival, Burst TAT.<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.vbspu.ac.in\/e-content\/Scheduling-Algorithm.pdf\" target=\"_blank\" rel=\"noopener\">Operating System : Scheduling Algorithm &#8211; Jaunpur<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/sriindu.ac.in\/wp-content\/uploads\/2019\/03\/unit-2.pdf\" target=\"_blank\" rel=\"noopener\">PROCESSES AND CPU Scheduling<\/a><\/h3>\n<p data-start=\"0\" data-end=\"215\">In <strong data-start=\"3\" data-end=\"25\">Process Scheduling<\/strong> (a key topic in Operating Systems and commonly tested in GATE), understanding the <strong data-start=\"108\" data-end=\"134\">various types of times<\/strong> is crucial. Below is a concise explanation of each important time type involved:<\/p>\n<hr data-start=\"217\" data-end=\"220\" \/>\n<h2 data-start=\"222\" data-end=\"252\">\ud83d\udd52 <strong data-start=\"228\" data-end=\"252\">1. Arrival Time (AT)<\/strong><\/h2>\n<ul data-start=\"253\" data-end=\"396\">\n<li data-start=\"253\" data-end=\"326\">\n<p data-start=\"255\" data-end=\"326\"><strong data-start=\"255\" data-end=\"269\">Definition<\/strong>: The time at which a process enters the <strong data-start=\"310\" data-end=\"325\">ready queue<\/strong>.<\/p>\n<\/li>\n<li data-start=\"327\" data-end=\"396\">\n<p data-start=\"329\" data-end=\"396\"><strong data-start=\"329\" data-end=\"340\">Example<\/strong>: If a process arrives at time 0, its Arrival Time is 0.<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"398\" data-end=\"401\" \/>\n<h2 data-start=\"403\" data-end=\"448\">\ud83d\udd27 <strong data-start=\"409\" data-end=\"448\">2. Burst Time (BT) \/ Execution Time<\/strong><\/h2>\n<ul data-start=\"449\" data-end=\"659\">\n<li data-start=\"449\" data-end=\"530\">\n<p data-start=\"451\" data-end=\"530\"><strong data-start=\"451\" data-end=\"465\">Definition<\/strong>: The <strong data-start=\"471\" data-end=\"485\">total time<\/strong> required by a process to execute <strong data-start=\"519\" data-end=\"529\">on CPU<\/strong>.<\/p>\n<\/li>\n<li data-start=\"531\" data-end=\"586\">\n<p data-start=\"533\" data-end=\"586\"><strong data-start=\"533\" data-end=\"541\">Note<\/strong>: It does <strong data-start=\"551\" data-end=\"558\">not<\/strong> include time spent waiting.<\/p>\n<\/li>\n<li data-start=\"587\" data-end=\"659\">\n<p data-start=\"589\" data-end=\"659\"><strong data-start=\"589\" data-end=\"600\">Example<\/strong>: If a process needs 5 ms of CPU time, its Burst Time is 5.<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"661\" data-end=\"664\" \/>\n<h2 data-start=\"666\" data-end=\"699\">\ud83d\udd04 <strong data-start=\"672\" data-end=\"699\">3. Completion Time (CT)<\/strong><\/h2>\n<ul data-start=\"700\" data-end=\"846\">\n<li data-start=\"700\" data-end=\"769\">\n<p data-start=\"702\" data-end=\"769\"><strong data-start=\"702\" data-end=\"716\">Definition<\/strong>: The time at which a process <strong data-start=\"746\" data-end=\"768\">finishes execution<\/strong>.<\/p>\n<\/li>\n<li data-start=\"770\" data-end=\"846\">\n<p data-start=\"772\" data-end=\"846\"><strong data-start=\"772\" data-end=\"783\">Example<\/strong>: If a process completes at time 12, its Completion Time is 12.<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"848\" data-end=\"851\" \/>\n<h2 data-start=\"853\" data-end=\"887\">\ud83d\udcca <strong data-start=\"859\" data-end=\"887\">4. Turnaround Time (TAT)<\/strong><\/h2>\n<ul data-start=\"888\" data-end=\"1142\">\n<li data-start=\"888\" data-end=\"958\">\n<p data-start=\"890\" data-end=\"958\"><strong data-start=\"890\" data-end=\"904\">Definition<\/strong>: The total time taken from <strong data-start=\"932\" data-end=\"957\">arrival to completion<\/strong>.<\/p>\n<\/li>\n<li data-start=\"959\" data-end=\"1022\">\n<p data-start=\"961\" data-end=\"975\"><strong data-start=\"961\" data-end=\"972\">Formula<\/strong>:<\/p>\n<p><span class=\"katex-display\"><span class=\"katex\"><span class=\"katex-mathml\">TAT=CT\u2212AT\\text{TAT} = \\text{CT} &#8211; \\text{AT}<\/span><span class=\"katex-html\" aria-hidden=\"true\"><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">TAT<\/span><\/span><span class=\"mrel\">=<\/span><\/span><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">CT<\/span><\/span><span class=\"mbin\">\u2212<\/span><\/span><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">AT<\/span><\/span><\/span><\/span><\/span><\/span><\/li>\n<li data-start=\"1023\" data-end=\"1085\">\n<p data-start=\"1025\" data-end=\"1085\"><strong data-start=\"1025\" data-end=\"1043\">Interpretation<\/strong>: How long a process stayed in the system.<\/p>\n<\/li>\n<li data-start=\"1086\" data-end=\"1142\">\n<p data-start=\"1088\" data-end=\"1142\"><strong data-start=\"1088\" data-end=\"1099\">Example<\/strong>: If AT = 2, CT = 10 \u2192 TAT = 10 &#8211; 2 = <strong data-start=\"1137\" data-end=\"1142\">8<\/strong><\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"1144\" data-end=\"1147\" \/>\n<h2 data-start=\"1149\" data-end=\"1178\">\u23f3 <strong data-start=\"1154\" data-end=\"1178\">5. Waiting Time (WT)<\/strong><\/h2>\n<ul data-start=\"1179\" data-end=\"1381\">\n<li data-start=\"1179\" data-end=\"1259\">\n<p data-start=\"1181\" data-end=\"1259\"><strong data-start=\"1181\" data-end=\"1195\">Definition<\/strong>: The time a process spends in the <strong data-start=\"1230\" data-end=\"1245\">ready queue<\/strong>, not running.<\/p>\n<\/li>\n<li data-start=\"1260\" data-end=\"1323\">\n<p data-start=\"1262\" data-end=\"1276\"><strong data-start=\"1262\" data-end=\"1273\">Formula<\/strong>:<\/p>\n<p><span class=\"katex-display\"><span class=\"katex\"><span class=\"katex-mathml\">WT=TAT\u2212BT\\text{WT} = \\text{TAT} &#8211; \\text{BT}<\/span><span class=\"katex-html\" aria-hidden=\"true\"><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">WT<\/span><\/span><span class=\"mrel\">=<\/span><\/span><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">TAT<\/span><\/span><span class=\"mbin\">\u2212<\/span><\/span><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">BT<\/span><\/span><\/span><\/span><\/span><\/span><\/li>\n<li data-start=\"1324\" data-end=\"1381\">\n<p data-start=\"1326\" data-end=\"1381\"><strong data-start=\"1326\" data-end=\"1337\">Example<\/strong>: If TAT = 8 and BT = 5 \u2192 WT = 8 &#8211; 5 = <strong data-start=\"1376\" data-end=\"1381\">3<\/strong><\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"1383\" data-end=\"1386\" \/>\n<h2 data-start=\"1388\" data-end=\"1419\">\ud83d\udd50 <strong data-start=\"1394\" data-end=\"1419\">6. Response Time (RT)<\/strong><\/h2>\n<ul data-start=\"1420\" data-end=\"1656\">\n<li data-start=\"1420\" data-end=\"1499\">\n<p data-start=\"1422\" data-end=\"1499\"><strong data-start=\"1422\" data-end=\"1436\">Definition<\/strong>: Time from <strong data-start=\"1448\" data-end=\"1459\">arrival<\/strong> to <strong data-start=\"1463\" data-end=\"1498\">first time the process gets CPU<\/strong>.<\/p>\n<\/li>\n<li data-start=\"1500\" data-end=\"1565\">\n<p data-start=\"1502\" data-end=\"1565\"><strong data-start=\"1502\" data-end=\"1513\">Used in<\/strong>: Preemptive algorithms like Round Robin, SRTF, etc.<\/p>\n<\/li>\n<li data-start=\"1566\" data-end=\"1656\">\n<p data-start=\"1568\" data-end=\"1582\"><strong data-start=\"1568\" data-end=\"1579\">Formula<\/strong>:<\/p>\n<p><span class=\"katex-display\"><span class=\"katex\"><span class=\"katex-mathml\">RT=First\u00a0CPU\u00a0Start\u00a0Time\u2212Arrival\u00a0Time\\text{RT} = \\text{First CPU Start Time} &#8211; \\text{Arrival Time}<\/span><span class=\"katex-html\" aria-hidden=\"true\"><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">RT<\/span><\/span><span class=\"mrel\">=<\/span><\/span><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">First\u00a0CPU\u00a0Start\u00a0Time<\/span><\/span><span class=\"mbin\">\u2212<\/span><\/span><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">Arrival\u00a0Time<\/span><\/span><\/span><\/span><\/span><\/span><\/li>\n<\/ul>\n<hr data-start=\"1658\" data-end=\"1661\" \/>\n<h2 data-start=\"1663\" data-end=\"1700\">\ud83d\udcd8 Example Table for Clarification<\/h2>\n<div class=\"_tableContainer_16hzy_1\">\n<div class=\"_tableWrapper_16hzy_14 group flex w-fit flex-col-reverse\">\n<table class=\"w-fit min-w-(--thread-content-width)\" data-start=\"1702\" data-end=\"2004\">\n<thead data-start=\"1702\" data-end=\"1760\">\n<tr data-start=\"1702\" data-end=\"1760\">\n<th data-start=\"1702\" data-end=\"1712\" data-col-size=\"sm\">Process<\/th>\n<th data-start=\"1712\" data-end=\"1717\" data-col-size=\"sm\">AT<\/th>\n<th data-start=\"1717\" data-end=\"1722\" data-col-size=\"sm\">BT<\/th>\n<th data-start=\"1722\" data-end=\"1727\" data-col-size=\"sm\">CT<\/th>\n<th data-start=\"1727\" data-end=\"1743\" data-col-size=\"sm\">TAT = CT &#8211; AT<\/th>\n<th data-start=\"1743\" data-end=\"1760\" data-col-size=\"sm\">WT = TAT &#8211; BT<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1822\" data-end=\"2004\">\n<tr data-start=\"1822\" data-end=\"1882\">\n<td data-start=\"1822\" data-end=\"1832\" data-col-size=\"sm\">P1<\/td>\n<td data-col-size=\"sm\" data-start=\"1832\" data-end=\"1837\">0<\/td>\n<td data-col-size=\"sm\" data-start=\"1837\" data-end=\"1842\">5<\/td>\n<td data-col-size=\"sm\" data-start=\"1842\" data-end=\"1847\">5<\/td>\n<td data-col-size=\"sm\" data-start=\"1847\" data-end=\"1864\">5<\/td>\n<td data-col-size=\"sm\" data-start=\"1864\" data-end=\"1882\">0<\/td>\n<\/tr>\n<tr data-start=\"1883\" data-end=\"1943\">\n<td data-start=\"1883\" data-end=\"1893\" data-col-size=\"sm\">P2<\/td>\n<td data-col-size=\"sm\" data-start=\"1893\" data-end=\"1898\">1<\/td>\n<td data-col-size=\"sm\" data-start=\"1898\" data-end=\"1903\">3<\/td>\n<td data-col-size=\"sm\" data-start=\"1903\" data-end=\"1908\">8<\/td>\n<td data-col-size=\"sm\" data-start=\"1908\" data-end=\"1925\">7<\/td>\n<td data-col-size=\"sm\" data-start=\"1925\" data-end=\"1943\">4<\/td>\n<\/tr>\n<tr data-start=\"1944\" data-end=\"2004\">\n<td data-start=\"1944\" data-end=\"1954\" data-col-size=\"sm\">P3<\/td>\n<td data-col-size=\"sm\" data-start=\"1954\" data-end=\"1959\">2<\/td>\n<td data-col-size=\"sm\" data-start=\"1959\" data-end=\"1964\">2<\/td>\n<td data-col-size=\"sm\" data-start=\"1964\" data-end=\"1969\">10<\/td>\n<td data-col-size=\"sm\" data-start=\"1969\" data-end=\"1986\">8<\/td>\n<td data-col-size=\"sm\" data-start=\"1986\" data-end=\"2004\">6<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<div class=\"sticky end-(--thread-content-margin) h-0 self-end select-none\">\n<div class=\"absolute end-0 flex items-end\"><\/div>\n<\/div>\n<\/div>\n<\/div>\n<hr data-start=\"2006\" data-end=\"2009\" \/>\n<p data-start=\"2011\" data-end=\"2126\" data-is-last-node=\"\" data-is-only-node=\"\">Would you like a solved example with Gantt chart for a specific scheduling algorithm (like FCFS, SJF, Round Robin)?<\/p>\n<h3 data-start=\"2011\" data-end=\"2126\"><a href=\"http:\/\/www.sbdeorahonline.co.in\/attendence\/classnotes\/files\/1590219948.pdf\" target=\"_blank\" rel=\"noopener\">Day 02Part 03- Various types of times in Process Scheduling algorithm, Arrival, Burst TAT.<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.ijstm.com\/images\/short_pdf\/172a.pdf\" target=\"_blank\" rel=\"noopener\">PROCESS SCHEDULING ALGORITHMS: A REVIEW<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"http:\/\/www.facweb.iitkgp.ac.in\/~shamik\/spring2023\/caos\/os-ch5.pdf\" target=\"_blank\" rel=\"noopener\">Chapter 5: Process Scheduling<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.24-edu.com\/assets\/uploads\/attachment-1665772802.pdf\" target=\"_blank\" rel=\"noopener\">Chapter 6: CPU Scheduling<\/a><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>Day 02Part 03- Various types of times in Process Scheduling algorithm, Arrival, Burst TAT. [fvplayer id=&#8221;318&#8243;] \u00a0Day 02 | Part 03 \u2013 Process Scheduling Algorithm: Various Types of Times Process scheduling in an operating system involves different types of times that determine the efficiency and execution sequence of processes. Let\u2019s explore them one by one: [&hellip;]<\/p>\n","protected":false},"author":66,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[78],"tags":[],"class_list":["post-3250","post","type-post","status-publish","format-standard","hentry","category-operating-system"],"_links":{"self":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3250","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/users\/66"}],"replies":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/comments?post=3250"}],"version-history":[{"count":0,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3250\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/media?parent=3250"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/categories?post=3250"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/tags?post=3250"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}