Journal article Open Access

Design of Optimal Scheduler for Process Scheduling

Sambath M,; D. John Aravindhar,; P. Harshavardhan Reddy,; Lokesh Kumar Ravipati,; Suthapalli Sai Gowtham; Korrapati Jagadeesh; Vemula Raviteja


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">scheduler, throughput, turnaround time</subfield>
  </datafield>
  <controlfield tag="005">20211023134844.0</controlfield>
  <controlfield tag="001">5594146</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Professor Department of Computer Science  &amp; Engineering, Hindustan Institute of Technoogy and Science, Chennai,  India</subfield>
    <subfield code="a">D. John Aravindhar,</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">UG Scholar, Department of Computer Science  &amp; Engineering, Hindustan Institute of Technoogy and Science, Chennai,  India</subfield>
    <subfield code="a">P. Harshavardhan Reddy,</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">UG Scholar, Department of Computer Science  &amp; Engineering, Hindustan Institute of Technoogy and Science, Chennai,  India</subfield>
    <subfield code="a">Lokesh Kumar Ravipati,</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">UG Scholar, Department of Computer Science  &amp; Engineering, Hindustan Institute of Technoogy and Science, Chennai,  India</subfield>
    <subfield code="a">Suthapalli  Sai Gowtham</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">UG Scholar, Department of Computer Science  &amp; Engineering, Hindustan Institute of Technoogy and Science, Chennai,  India</subfield>
    <subfield code="a">Korrapati Jagadeesh</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">UG Scholar, Department of Computer Science  &amp; Engineering, Hindustan Institute of Technoogy and Science, Chennai,  India</subfield>
    <subfield code="a">Vemula Raviteja</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Publisher</subfield>
    <subfield code="4">spn</subfield>
    <subfield code="a">Blue Eyes Intelligence Engineering  &amp; Sciences Publication(BEIESP)</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">401614</subfield>
    <subfield code="z">md5:2c0e1a74beb960e02c724035c2658b75</subfield>
    <subfield code="u">https://zenodo.org/record/5594146/files/C6416029320.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2020-02-29</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o">oai:zenodo.org:5594146</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="c">3759-3761</subfield>
    <subfield code="n">3</subfield>
    <subfield code="p">International Journal of Engineering and Advanced Technology (IJEAT)</subfield>
    <subfield code="v">9</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Assistant Professor,Department of Computer Science  &amp; Engineering, Hindustan Institute of Technoogy and Science, Chennai,  India</subfield>
    <subfield code="a">Sambath M,</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Design of Optimal Scheduler for Process  Scheduling</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">ISSN</subfield>
    <subfield code="0">(issn)2249-8958</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">Retrieval Number</subfield>
    <subfield code="0">(handle)C6416029320/2020©BEIESP</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;CPU Scheduling takes plays an important role in multiprogramming systems. There are several programs present in memory. It is the responsibility of operating systems to select the process and assign it to CPU. There are various algorithms available for CPU Scheduling. The algorithm&amp;rsquo;s performance depends on various factors like arrival time, priority etc. This paper helps to select the best algorithm by comparing various algorithms under the same condition and analyzed them based on various factors like waiting time, turnaround time, CPU utilization, Throughput.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">issn</subfield>
    <subfield code="i">isCitedBy</subfield>
    <subfield code="a">2249-8958</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.35940/ijeat.C6416.029320</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
</record>
44
19
views
downloads
Views 44
Downloads 19
Data volume 7.6 MB
Unique views 40
Unique downloads 18

Share

Cite as