\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Optimized Round Robin CPU Scheduling for Critical Processes},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{1970-01-01 (revised: 01 January 1970)}
\def\TheID{\makeatother }
\def\TheDate{1970-01-01}
\title{Optimized Round Robin CPU Scheduling for Critical Processes}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Debashish  Barman}

             \author[2]{Biswajit  Paul}

             \author[3]{Swastik  Bhattacharya}

             \author[4]{Dr. Sourav  De}

             \author[5]{Dr. Govind Prasad  Arya}

             \affil[1]{  Sikkim Manipal University}

\renewcommand\Authands{ and }

\date{\small \em Received: 1 January 1970 Accepted: 1 January 1970 Published: 1 January 1970}

\maketitle


\begin{abstract}
        


An operating system serves as a fundamental component of any computer system. Scheduling lies at the core of operating system functionality, involving the arrangement of processes to execute in a well-defined manner. The primary goal of scheduling is to enhance system efficiency and speed. Several fundamental scheduling algorithms exist, including First Come First Serve (FCFS), Round Robin, Priority-Based Scheduling, and Shortest Job First (SJF). This thesis primarily focuses on the Round Robin Scheduling algorithm and seeks to address certain limitations associated with it.One notable drawback of Round Robin Scheduling is the critical choice of the time quantum. If the time quantum is excessively large, the scheduling behavior closely resembles that of FCFS. Conversely, a smaller time quantum leads to a higher number of context switches. The central objective here is to overcome this limitation inherent to the traditional Round Robin scheduling algorithm, thereby maximizing CPU utilization and enhancing system efficiency.

\end{abstract}


\keywords{CPU scheduling, round robin scheduling, priority scheduling, time quantum, waiting time, turnaround time.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\begin{textblock*}{10cm}(1.05cm,3cm)
{{\textit{CrossRef DOI of original article:}} \underline{}}
\end{textblock*}\let\tabcellsep& 	 	 		 \par
Abstract-An operating system serves as a fundamental component of any computer system. Scheduling lies at the core of operating system functionality, involving the arrangement of processes to execute in a well-defined manner. The primary goal of scheduling is to enhance system efficiency and speed. Several fundamental scheduling algorithms exist, including First Come First Serve (FCFS), Round Robin, Priority-Based Scheduling, and Shortest Job First (SJF). This thesis primarily focuses on the Round Robin Scheduling algorithm and seeks to address certain limitations associated with it.\par
One notable drawback of Round Robin Scheduling is the critical choice of the time quantum. If the time quantum is excessively large, the scheduling behavior closely resembles that of FCFS. Conversely, a smaller time quantum leads to a higher number of context switches. The central objective here is to overcome this limitation inherent to the traditional Round Robin scheduling algorithm, thereby maximizing CPU utilization and enhancing system efficiency.\par
In this thesis, we propose an innovative algorithm that classifies processes into two categories: high-priority processes and low-priority processes. This novel scheme significantly reduces the average waiting time of high-priority processes, regardless of the presence of low-priority processes. The overall average waiting time varies based on the specific set of processes under consideration. Our analysis demonstrates that the proposed scheme consistently outperforms previously suggested methods, resulting in reduced average waiting times for the selected process sets. 
\section[{I. Introduction}]{I. Introduction}\par
PU scheduling is a fundamental practice in the realm of operating systems, orchestrating the execution of processes to efficiently utilize the CPU. This practice becomes necessary when a process must seize CPU control while another process is temporarily halted in a waiting state, typically due to resource unavailability, such as I/O operations. The primary objectives of CPU scheduling are to enhance system effectiveness, responsiveness, and fairness while maximizing CPU utilization.\par
Process scheduling, an integral component of multiprogramming operating systems, involves managing the transition of processes in and out of the CPU based on a specific strategy. These operating systems can load multiple processes into executable memory concurrently, allowing them to share the CPU through time multiplexing.\par
There are two principal categories of CPU scheduling algorithms: preemptive and non-preemptive. In preemptive scheduling, a process allocated to the CPU can be interrupted, and its running state may be changed to a waiting state. This approach is known for temporarily suspending logically runnable processes and is referred to as preemptive scheduling. However, frequent arrivals of high-priority processes in the ready queue can potentially lead to starvation for lower-priority processes. It's important to note that preemptive scheduling comes with the overhead of managing these process interruptions.\par
In contrast, non-preemptive scheduling ensures that once a process gains access to the CPU, it retains control until its execution is complete. The CPU cannot be forcibly taken away from the process until it finishes its execution. In this scenario, a process voluntarily releases the processor only after its task is done.\par
While various CPU scheduling algorithms exist, some common ones include First In First Out (FIFO), Shortest Job First (SJF), Priority Scheduling, and Round Robin CPU Scheduling. Each of these algorithms offers unique advantages and trade-offs in managing the CPU's allocation to processes. 
\section[{II. Literature Survey}]{II. Literature Survey}\par
In FCFS scheduling, jobs are executed in the order they arrive, following a "first come, first served" principle \hyperref[b0]{[1]}. This algorithm can operate in both nonpreemptive and preemptive modes depending on system requirements. It is easy to understand and implement, relying on a First-In-First-Out (FIFO) queue. However, FCFS suffers from the drawback of high average waiting times, limiting its overall performance.\par
Shortest Job First (SJF), also known as Shortest Job Next, prioritizes tasks based on their execution time \hyperref[b2]{[3]}. It can function as both a preemptive and nonpreemptive algorithm. SJF is particularly effective in reducing waiting times, making it a preferred choice in batch systems where CPU time requirements are known C in advance. However, it is impractical for interactive systems where predicting CPU time is challenging.\par
Priority scheduling is a non-preemptive algorithm commonly used in batch systems  {\ref [5]}. Each process is assigned a priority, with the highest-priority process scheduled first, followed by processes of equal priority in a first-come-first-served manner. Priorities can be assigned based on memory, time, or other resource requirements.\par
Round Robin is a preemptive scheduling algorithm where each process is allocated a fixed time quantum for execution  {\ref [8]}. When a process's time quantum expires, it is preempted, and another process is allowed to execute for its allocated time period. Context switching is necessary to manage preempted processes effectively.\par
Multiple-level queues are a manual scheduling algorithm \hyperref[b7]{[15]} that leverages various existing algorithms to categorize jobs based on common characteristics. Multiple queues are maintained for processes with similar attributes, each with its specific scheduling algorithm  {\ref [8]}. Priorities are assigned to each queue, enabling effective organization. For instance, OS-bound jobs can be grouped in one queue, while I/O-bound jobs reside in another. The Process Scheduler selects jobs from each queue based on the algorithm associated with that queue. Multi-level queue scheduling was developed for scenarios where processes naturally belong to different groups. 
\section[{III. Shortcomings of Existing Algorithm}]{III. Shortcomings of Existing Algorithm}\par
We have evaluated the conventional Round Robin (RR) algorithm as our baseline scheduling approach. The RR algorithm is generally considered efficient because it ensures that all processes in the process set have an equal opportunity for execution. However, our research has identified that our system comprises both critical processes with high priority and normal (low-priority) processes. A significant limitation of the RR algorithm is its lack of consideration for process priorities, which we regard as a major drawback.\par
To address this limitation, we have proposed a novel methodology aimed at enhancing the RR algorithm's effectiveness.\par
Let's now consider the following set of processes with a fixed time quantum of 4. Round Robin scheduling is known for its ability to ensure a fair chance for every process in the set to execute. Consequently, Figure  {\ref 1} illustrates the Gantt chart and waiting times for the given set of processes. 
\section[{Figure 1: Gantt chart of Existing Methodology}]{Figure 1: Gantt chart of Existing Methodology}\par
The average waiting time (AWT) for processes with both low and high priorities is presented in Figure \hyperref[fig_0]{2} below.  
\section[{Optimized Round Robin CPU Scheduling for Critical Processes}]{Optimized Round Robin CPU Scheduling for Critical Processes} 
\section[{Global Journal of Computer Science and Technology ( H ) XXIII Issue III Version I}]{Global Journal of Computer Science and Technology ( H ) XXIII Issue III Version I}
\begin{quote}
Year 2023\end{quote}
 
\section[{IV. Proposed Method}]{IV. Proposed Method}\par
The Round Robin algorithm operates under the premise of treating all jobs with equal priority, executing processes one at a time for a specific duration known as the Time Quantum (TQ). A process can continue running until either its time quantum (TQ) is exhausted or it completes its CPU burst time. Within the system, processes have varying priorities, distinguishing between high-priority critical tasks, which demand immediate CPU attention, such as shutting down the computer due to overheating or issuing alerts for unauthorized access, and normal-priority processes, which encompass all other standard tasks. 
\section[{V. Proposed Algorithm}]{V. Proposed Algorithm}\par
Our proposed algorithm is given below.\par
Step 1: Input process details, including the process name, priority, and burst time.\par
Step 2: Save the collected information in a queue labeled as "READYQ."\par
Step 3: Establish two distinct queues: "HIGHPQ" for high-priority processes and "LOWPQ" for regular-priority processes.\par
Step 4: Repeat steps 5 to 11 until the remaining CPU burst times for processes in both "HIGHPQ" and "LOWPQ" reach zero.\par
Step 5: Choose the next process from "HIGHPQ" or "LOWPQ" alternatively, with the initial selection favoring "HIGHPQ" to give higher-priority tasks precedence.\par
Step 6: If the selected process has a remaining CPU burst time greater than or equal to the time quantum, proceed to step 7; otherwise, go to step 8.\par
Step 7: Execute the chosen process for the duration of the time quantum.\par
Step 8: Continue executing the selected process until its remaining burst time reaches zero.\par
Step 9: Update the remaining CPU burst time of the corresponding process in the respective queue.\par
Step 10: Record the process's IN-TIME and OUT-TIME in a table known as the GANTTCHART.\par
Step 11: If the previous process was selected from "HIGHPQ," switch the next turn to "LOWPQ," and vice versa.\par
In this study, I have introduced an approach that ensures high-priority processes receive precedence in execution. The methodology I've suggested involves granting alternating opportunities to both high and low priority processes. It begins by selecting a process from the high-priority queue, followed by the selection of the next process from the low-priority queue. The following steps outline the proposed methodology.\par
HIGHPQ-This queue contains the processes of high priority. 
\section[{Process Name}]{Process Name}\par
Priority Burst Time Below, in Figure \hyperref[fig_2]{3}, you can observe the Gantt chart and waiting times for the processes listed in Table \hyperref[tab_1]{1}, using a time quantum of 4.  
\section[{Optimized Round Robin Scheduling for Critical Processes}]{Optimized Round Robin Scheduling for Critical Processes} 
\section[{Global Journal of Computer Science and Technology ( H ) XXIII Issue III Version I}]{Global Journal of Computer Science and Technology ( H ) XXIII Issue III Version I}
\begin{quote}
Year 2023\end{quote}
 
\section[{VI. Result and Analysis}]{VI. Result and Analysis}\par
The figure below illustrates the application of the proposed algorithm, resulting in an average waiting time for high-priority processes of approximately 7.5. This value is nearly half of the average waiting time observed when using the existing algorithm. Furthermore, the overall waiting time for the process set is significantly reduced through the implementation of the proposed algorithm. 
\section[{Figure 4: Result Analyses of Existing Vs Proposed Methodology}]{Figure 4: Result Analyses of Existing Vs Proposed Methodology}\par
The same result can be analyzed using bar chart shown in figure \hyperref[fig_3]{5}.  
\section[{Optimized Round Robin CPU Scheduling for Critical Processes}]{Optimized Round Robin CPU Scheduling for Critical Processes} 
\section[{Global Journal of Computer Science and Technology ( H ) XXIII Issue III Version I}]{Global Journal of Computer Science and Technology ( H ) XXIII Issue III Version I}
\begin{quote}
Year 2023\end{quote}
 
\section[{VII. Conclusion}]{VII. Conclusion}\par
In this study, I've maintained the core principle of traditional round-robin scheduling, which aims to ensure that all processes receive an equal opportunity to execute within a specific time quantum. The innovation lies in the strategic placement of high-priority processes at the rear of the ready queue, preventing them from being excessively delayed by late arrivals. The proposed approach is expected to reduce the average waiting time for high-priority processes, but it may lead to an increase in the average waiting time for normal priority processes. The overall average waiting time for all processes within the ready queue may exhibit improvement or remain unchanged, contingent on the specific mix of processes.\par
Although the proposed algorithm demonstrates enhanced performance for high-priority processes, there remains an ongoing drive for continued improvement. In the future, these results could potentially be refined by introducing variable time quantum strategies. Furthermore, optimizing the algorithm's execution can be accomplished by leveraging more efficient data structures.\begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-3.png}
\caption{\label{fig_2}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{figure5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.3016129032258065\textwidth}P{0.32903225806451614\textwidth}P{0.2193548387096774\textwidth}}
\tabcellsep Ready Queue\tabcellsep \\
Process Name\tabcellsep Priority\tabcellsep Burst Time\\
P0\tabcellsep 0\tabcellsep 5\\
P1\tabcellsep 1\tabcellsep 3\\
P2\tabcellsep 1\tabcellsep 12\\
P3\tabcellsep 0\tabcellsep 9\\
P4\tabcellsep 0\tabcellsep 8\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 			\label{foot_0}\footnote{\label{foot_0} © 2023 Global Journals} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Varma (2013)]{b17}\label{b17} 	 		‘A FINEST TIME QUANTUM FOR IMPROVING SHORTEST REMAINING BURST ROUND ROBIN (SRBRR) ALGORITHM’.  		 			P Surendra Varma 		.  	 	 		\textit{Journal of Global Research in Computer Science}  		March 2013. 4  (3)  p. .  	 
\bibitem[Abdulrahim et al. ()]{b12}\label{b12} 	 		‘A New Improved Round Robin (NIRR) CPU Scheduling Algorithm’.  		 			Abdulrazak Abdulrahim 		,  		 			E Saleh 		,  		 			Abdullahi 		,  		 			B Junaidu 		,  		 			Sahalu 		.  	 	 		\textit{International Journal of Computer Applications}  		2014. 90  (4)  p. .  	 
\bibitem[Behera et al. (2010)]{b8}\label{b8} 	 		‘A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis’.  		 			H S Behera 		,  		 			R Mohanty 		,  		 			D Nayak 		.  	 	 		\textit{International Journal of Computer Applications}  		August 2010. 5  (5)  p. .  	 
\bibitem[Singh (2012)]{b15}\label{b15} 	 		‘A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems’.  		 			Ishwari Singh 		,  		 			Rajput 		.  	 	 		\textit{IJIET)International Journal of Innovations in Engineering and Technology}  		3 Oct 2012. 1.  	 
\bibitem[Abdulrahim et al. ()]{b3}\label{b3} 	 		\textit{An},  		 			Abdulrazak Abdulrahim 		,  		 			Salisu Aliyu 		,  		 			Ahmad M Mustapha 		,  		 			\& Saleh 		,  		 			E Abdullahi 		.  		2014.  	 
\bibitem[Panda et al. ()]{b4}\label{b4} 	 		‘An Effective Round Robin Algorithm using Min-Max Dispersion Measure’.  		 			Sanjaya Panda 		,  		 			Sourav Kumar; Bhoi 		,  		 			Kumar 		.  	 	 		\textit{International Journal on Computer Science \& Engineering}  		Jan2012. 4  (1)  p. 45.  	 
\bibitem[Kumar and Kumar (2012)]{b0}\label{b0} 	 		‘An Effective Round Robin Algorithm using Min-Max Dispersion Measure’.  		 			Sanjay Kumar 		,  		 			Panda 		,  		 			Saurav Kumar 		,  		 			Bhoi 		.  	 	 		\textit{International Journal on Computer Science and Engineering}  		January 2012. 4  (1)  p. .  	 
\bibitem[Kumar and Khan ()]{b16}\label{b16} 	 		‘An Improved Round Robin CPU Scheduling Algorithm’.  	 	 		\textit{Journal of Global Research in Computer Science}  		 			Manish Kumar 		,  		 			Mishra 		,  		 			Abdul Kadir Khan 		 (eds.)  		2012. 3  (6)  p. .  	 
\bibitem[Kumar Yadav et al. ()]{b18}\label{b18} 	 		‘An Improved Round Robin Scheduling Algorithm for CPU Scheduling’.  		 			Rakesh Kumar Yadav 		,  		 			K Abhishek 		,  		 			Navin Mishra 		,  		 			Himanshu Prakash 		,  		 			Sharma 		.  	 	 		\textit{IJCSE) International Journal on Computer Science and Engineering}  		2010. 02  (04)  p. .  	 
\bibitem[Singh et al. ()]{b10}\label{b10} 	 		‘An Optimized Round Robin Scheduling Algorithm for CPU Scheduling’.  		 			Ajit Singh 		,  		 			Priyanka Goyal 		,  		 			Sahil Batra 		.  	 	 		\textit{IJCSE) International Journal on Computer Science and Engineering}  		2010. 02  (07)  p. .  	 
\bibitem[Rakesh Mohanty et al. ()]{b14}\label{b14} 	 		‘Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm’.  		 			H S Rakesh Mohanty 		,  		 			Khusbu Behera 		,  		 			Monisha Patwari 		,  		 			Dash 		.  	 	 		\textit{International Symposium on Computer Engineering \& Technology (ISCET)},  		2010. 17.  	 
\bibitem[Rakesh Mohanty et al. ()]{b2}\label{b2} 	 		‘Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm’.  		 			H S Rakesh Mohanty 		,  		 			Khusbu Behera 		,  		 			Monisha Patwari 		,  		 			Dash 		.  	 	 		\textit{Proc. of International Symposium on Computer Engineering \& Technology},  		 (of International Symposium on Computer Engineering \& Technology)  		2010. 2010. 17 p. .  	 
\bibitem[Designing Various CPU Scheduling Techniques using SCILAB Saini ()]{b5}\label{b5} 	 		‘Designing Various CPU Scheduling Techniques using SCILAB’.  	 	 		\textit{Saini},  		 (Mona)  		2014. 5 p. 2918.  	 
\bibitem[Kumar Bhoi et al. (2011)]{b13}\label{b13} 	 		‘Enhancing cpu performance using subcontrary mean dynamic round robin (smdrr) scheduling algorithm’.  		 			Sourav Kumar Bhoi 		,  		 			Sanjaya Kumar Panda 		,  		 			Debashee Tarai 		.  	 	 		\textit{JGRCS}  		December 2011. 2  (12)  p. .  	 
\bibitem[Silberschatz et al.]{b1}\label{b1} 	 		\textit{Operating System Concepts},  		 			Abraham Silberschatz 		,  		 			Peter Baer Galvin 		,  		 			Greg Gagne 		.  		 	 	 (Sixth Edition) 
\bibitem[Oyetunji and Oluleye ()]{b9}\label{b9} 	 		‘Performance Assessment of Some CPU Scheduling Algori-thms’.  		 			E O Oyetunji 		,  		 			A E Oluleye 		.  	 	 		\textit{Research Journal of Information Techno-logy}  		2009. 1  (1)  p. .  	 
\bibitem[Matarneh ()]{b7}\label{b7} 	 		‘Seif-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Proceses’.  		 			R J Matarneh 		.  	 	 		\textit{American Journal of Applied Sciences}  		2009. 6  (10)  p. .  	 
\bibitem[Rami and Matarneh ()]{b11}\label{b11} 	 		‘Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of Now Running Processes’.  		 			J Rami 		,  		 			Matarneh 		.  	 	 		\textit{American J. of Applied Sciences}  		2009. 6  (10)  p. .  	 
\bibitem[Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes. Matarneh, Rami j ()]{b6}\label{b6} 	 	 	 		\textit{Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes. Matarneh, Rami j},  		2009. 6 p. 1831.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
