{"id":399,"date":"2024-06-28T13:11:48","date_gmt":"2024-06-28T13:11:48","guid":{"rendered":"https:\/\/study.madeeasy.in\/?p=399"},"modified":"2025-07-16T14:45:04","modified_gmt":"2025-07-16T09:15:04","slug":"what-is-i-o-system-in-operating-system","status":"publish","type":"post","link":"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-i-o-system-in-operating-system","title":{"rendered":"I\/O System"},"content":{"rendered":"\r\n<h2 style=\"text-align: justify;\">Objectives of I\/O system:<\/h2>\r\n<ul style=\"text-align: justify;\">\r\n<li>Take an application I\/O request and send it to the physical device.<\/li>\r\n<li>Take whatever response comes back from the device and send it to the application.<\/li>\r\n<li>Optimize the performance of the various I\/O requests.<\/li>\r\n<\/ul>\r\n<p style=\"text-align: justify;\"><strong>I\/O requests:<\/strong> In general, there may be many I\/O requests for a device at the same time. These requests may come from multiple processes or the same process.<\/p>\r\n<p style=\"text-align: justify;\"><strong>I\/O Issues:<\/strong> The operating system is able to improve overall system performance if it can keep the various devices as busy as possible. It is important for the operating system to handle device interrupts as quickly as possible.<\/p>\r\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_79_1 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-light-blue ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-i-o-system-in-operating-system\/#DISK-SCHEDULING\" >DISK SCHEDULING<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-i-o-system-in-operating-system\/#Goal-of-disk-scheduling\" >Goal of disk scheduling:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-i-o-system-in-operating-system\/#DISK-SCHEDULING-ALGORITHMS\" >DISK SCHEDULING ALGORITHMS<\/a><\/li><\/ul><\/nav><\/div>\n<h3 style=\"text-align: justify;\"><span class=\"ez-toc-section\" id=\"DISK-SCHEDULING\"><\/span>DISK SCHEDULING<span class=\"ez-toc-section-end\"><\/span><\/h3>\r\n<p style=\"text-align: justify;\"><strong>Purpose of Disk Scheduling:<\/strong> Select a disk request from the queue of I\/O requests and decide when to process this I\/O request.<\/p>\r\n<p style=\"text-align: justify;\"><strong>Issues in Disk Scheduling:<\/strong> Throughput (the number of disk requests that are completed in some period), Fairness (some disk requests may have to wait a long time before being served).<\/p>\r\n<h3 style=\"text-align: justify;\"><span class=\"ez-toc-section\" id=\"Goal-of-disk-scheduling\"><\/span>Goal of disk scheduling:<span class=\"ez-toc-section-end\"><\/span><\/h3>\r\n<ul style=\"text-align: justify;\">\r\n<li>High throughput<\/li>\r\n<li>Fairness and<\/li>\r\n<li>In any disk system with a moving read\/write head, the seek time between cylinders takes a significant amount of time. This travelling head time should be minimized.<\/li>\r\n<\/ul>\r\n<h3 style=\"text-align: justify;\"><span class=\"ez-toc-section\" id=\"DISK-SCHEDULING-ALGORITHMS\"><\/span>DISK SCHEDULING ALGORITHMS<span class=\"ez-toc-section-end\"><\/span><\/h3>\r\n<ul>\r\n<li style=\"text-align: justify;\">FCFS scheduling: first-come-first-served<\/li>\r\n<li style=\"text-align: justify;\">SSTF scheduling: shortest-seek-time-first<\/li>\r\n<li style=\"text-align: justify;\">SCAN scheduling<\/li>\r\n<li style=\"text-align: justify;\">C-SCAN scheduling: circular SCAN<\/li>\r\n<li style=\"text-align: justify;\">LOOK scheduling<\/li>\r\n<li style=\"text-align: justify;\">C-LOOK scheduling<\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n<p style=\"text-align: center;\"><a class=\"btn btn-danger\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/operating-system\/what-is-page-fault-in-os-operating-system\/\" target=\"_blank\" rel=\"noopener\">&lt;&lt; Previous<\/a> | <a class=\"btn btn-success\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/subjects\/what-is-an-operating-system-and-its-types\/\" target=\"_blank\" rel=\"noopener\"> Next &gt;&gt;<\/a><\/p>\r\n<p>&nbsp;<\/p>\r\n","protected":false},"excerpt":{"rendered":"<p>Objectives of I\/O system: Take an application I\/O request and send it to the physical device. Take whatever response comes<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[94,3],"tags":[117,118,119],"class_list":["post-399","post","type-post","status-publish","format-standard","hentry","category-operating-system","category-cs-it","tag-disk-schedule","tag-disk-scheduling-algorithms","tag-i-o-system"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/399","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=399"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/399\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=399"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=399"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=399"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}