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


Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:contributor>Blue Eyes Intelligence Engineering  &amp; Sciences Publication(BEIESP)</dc:contributor>
  <dc:creator>Sambath M,</dc:creator>
  <dc:creator>D. John Aravindhar,</dc:creator>
  <dc:creator>P. Harshavardhan Reddy,</dc:creator>
  <dc:creator>Lokesh Kumar Ravipati,</dc:creator>
  <dc:creator>Suthapalli  Sai Gowtham</dc:creator>
  <dc:creator>Korrapati Jagadeesh</dc:creator>
  <dc:creator>Vemula Raviteja</dc:creator>
  <dc:date>2020-02-29</dc:date>
  <dc:description>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’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.</dc:description>
  <dc:identifier>https://zenodo.org/record/5594146</dc:identifier>
  <dc:identifier>10.35940/ijeat.C6416.029320</dc:identifier>
  <dc:identifier>oai:zenodo.org:5594146</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>issn:2249-8958</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:source>International Journal of Engineering and Advanced Technology (IJEAT) 9(3) 3759-3761</dc:source>
  <dc:subject>scheduler, throughput, turnaround time</dc:subject>
  <dc:subject>ISSN</dc:subject>
  <dc:subject>Retrieval Number</dc:subject>
  <dc:title>Design of Optimal Scheduler for Process  Scheduling</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>
44
19
views
downloads
Views 44
Downloads 19
Data volume 7.6 MB
Unique views 40
Unique downloads 18

Share

Cite as