{"id":23336,"date":"2022-11-25T10:15:44","date_gmt":"2022-11-25T04:45:44","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/"},"modified":"2022-11-25T10:15:44","modified_gmt":"2022-11-25T04:45:44","slug":"solved-preemptive-priority-cpu-scheduling-algorithm-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/","title":{"rendered":"[Solved] Preemptive Priority CPU scheduling Algorithm [closed]"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-51388030\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"51388030\" data-parentid=\"51384465\" data-score=\"0\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>As stated in your question, &#8220;the priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first&#8221;. So, T1 is of more priority than T2, and T2 is of more priority than T3. This means whenever T1 arrives, it will pre-empt other tasks, and T2 will pre-empt task T3.<\/p>\n<p>Among tasks T1, T2 and T3, each of them are composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds respectively. And, each instance of T1, T2 and T3 requires an execution time of 1, 2 and 4 milliseconds, respectively.<\/p>\n<p>Hence, the corresponding Gantt chart would be:<\/p>\n<pre><code>T1 (0-1), T2 (1-2), T2 (2-3), T1 (3-4), T3 (4-5), T3 (5-6), T1 (6-7), T2 (7-8), T2 (8-9), \n                                                            T1 (9-10), T3 (10-11), T3 (11-12)...\n\/\/ so first instance of T3 finishes at the end of 12 seconds.\n<\/code><\/pre>\n<hr>\n<blockquote>\n<p>I took that beginning of 1st ms means all the process arrives at time<br \/>\n  = 1 and 0 to 1 time is IDLE. and when I take the gantt chart I get answer as 13, whereas answer = 12.<\/p>\n<\/blockquote>\n<p><em>The reason why your answer is not matching is because <strong>you have assumed incorrectly<\/strong>.<\/em><\/p>\n<p>The question clearly said that &#8220;given that all tasks initially arrive at the beginning of the 1st milliseconds&#8230;&#8221;, which means that the tasks arrived as soon as the timer started, i.e., as soon as the first millisecond started (labelled as 0-1 in my hint in the chart drawn above).<\/p>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\">1<\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved Preemptive Priority CPU scheduling Algorithm [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] As stated in your question, &#8220;the priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first&#8221;. So, T1 is of more priority than T2, and T2 is of more priority than T3. This means whenever T1 arrives, &#8230; <a title=\"[Solved] Preemptive Priority CPU scheduling Algorithm [closed]\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\" aria-label=\"More on [Solved] Preemptive Priority CPU scheduling Algorithm [closed]\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[1384,1367,1543,3747],"class_list":["post-23336","post","type-post","status-publish","format-standard","hentry","category-solved","tag-cpu","tag-operating-system","tag-process","tag-scheduling"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.5 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>[Solved] Preemptive Priority CPU scheduling Algorithm [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Preemptive Priority CPU scheduling Algorithm [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] As stated in your question, &#8220;the priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first&#8221;. So, T1 is of more priority than T2, and T2 is of more priority than T3. This means whenever T1 arrives, ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-11-25T04:45:44+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Preemptive Priority CPU scheduling Algorithm [closed]\",\"datePublished\":\"2022-11-25T04:45:44+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\"},\"wordCount\":228,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"cpu\",\"operating-system\",\"process\",\"scheduling\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\",\"name\":\"[Solved] Preemptive Priority CPU scheduling Algorithm [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-11-25T04:45:44+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Preemptive Priority CPU scheduling Algorithm [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Preemptive Priority CPU scheduling Algorithm [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Preemptive Priority CPU scheduling Algorithm [closed] - JassWeb","og_description":"[ad_1] As stated in your question, &#8220;the priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first&#8221;. So, T1 is of more priority than T2, and T2 is of more priority than T3. This means whenever T1 arrives, ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/","og_site_name":"JassWeb","article_published_time":"2022-11-25T04:45:44+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Preemptive Priority CPU scheduling Algorithm [closed]","datePublished":"2022-11-25T04:45:44+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/"},"wordCount":228,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["cpu","operating-system","process","scheduling"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/","name":"[Solved] Preemptive Priority CPU scheduling Algorithm [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-11-25T04:45:44+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-preemptive-priority-cpu-scheduling-algorithm-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Preemptive Priority CPU scheduling Algorithm [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/23336","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=23336"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/23336\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=23336"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=23336"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=23336"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}