{"id":6280,"date":"2025-09-18T11:13:23","date_gmt":"2025-09-18T05:43:23","guid":{"rendered":"https:\/\/study.madeeasy.in\/?p=6280"},"modified":"2025-09-18T11:13:23","modified_gmt":"2025-09-18T05:43:23","slug":"critical-section-problem","status":"publish","type":"post","link":"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/critical-section-problem","title":{"rendered":"Conditions for Solving the Critical Section Problem"},"content":{"rendered":"<p style=\"text-align: justify;\"><strong> (i) Mutual Exclusion:<\/strong> No two processes may be simultaneously present inside the critical section at any point of time.<br \/>\nTo avoid race conditions, mutual exclusion is enforced.<\/p>\n<p style=\"text-align: justify;\"><strong>(ii) Progress:<\/strong> No process running outside the critical section should block the other interested process from entering into the critical section when the critical section is free.<\/p>\n<ul style=\"text-align: justify;\">\n<li>If there is only one process trying to enter into the critical section (CS), then it should definitely be allowed in CS.<\/li>\n<li>If two or more processes are trying to enter CS, then one process should definitely be allowed in CS.<\/li>\n<\/ul>\n<p style=\"text-align: justify;\"><strong>(iii) Bounded Waiting:<\/strong> No process should have to wait forever to enter into the critical section.<\/p>\n<ul>\n<li style=\"text-align: justify;\">There should be a bound on getting a chance to enter into CS.<\/li>\n<li style=\"text-align: justify;\">Some process is indefinitely waiting to enter into the critical section because the critical section is always busy by some other processes. This situation should not arise.<\/li>\n<li style=\"text-align: justify;\">If bounded waiting is not satisfied, it may lead to starvation.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>(i) Mutual Exclusion: No two processes may be simultaneously present inside the critical section at any point of time. To<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[94,3],"tags":[1856,1857],"class_list":["post-6280","post","type-post","status-publish","format-standard","hentry","category-operating-system","category-cs-it","tag-bounded-waiting","tag-mutual-exclusion"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6280","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=6280"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6280\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=6280"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=6280"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=6280"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}