Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Dynamic Time Slice Calculation for Round Robin Process Scheduling Using NOC

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 5 No. 6 (2015)

DOI
10.11591/ijece.v5i6.pp1480-1485
ISSN
2088-8708, 2088-8708
Terbit
2015-12-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-nc/4.0

Abstrak

Process scheduling means allocating a certain amount of CPU time to each of the user processes. One of the popular scheduling algorithms is the “Round Robin” algorithm, which allows each and every process to utilize the CPU for short time duration. Processes which finish executing during the time slice are removed from the ready queue. Processes which do not complete execution during the specified time slice are removed from the front of the queue, and placed at the rear end of the queue. This paper presents an improvisation to the traditional round robin scheduling algorithm, by proposing a new method. The new method represents the time slice as a function of the burst time of the waiting process in the ready queue. Fixing the time slice for a process is a crucial factor, because it subsequently influences many performance parameters like turnaround time, waiting time, response time and the frequency of context switches. Though the time slot is fixed for each process, this paper explores the fine-tuning of the time slice for processes which do not complete in the stipulated time allotted to them.

Jaringan kolaborasi para penulis

4 penulis · 6 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Koneru Lakshmaiah Education Foundation
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Dynamic Time Slice Calculation for Round Robin Process Scheduling Using NOC</dc:title><dc:creator>Siva Nageswara Rao, G</dc:creator><dc:creator>Srinivasu, N.</dc:creator><dc:creator>Srinivasu, S.V.N.</dc:creator><dc:creator>Koteswara Rao, G. Rama</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;Process scheduling means allocating a certain amount of CPU time to each of the user processes.  One of the popular scheduling algorithms is the “Round Robin” algorithm, which allows each and every process to utilize the CPU for short time duration.  Processes which finish executing during the time slice are removed from the ready queue.  Processes which do not complete execution during the specified time slice are removed from the front of the queue, and placed at the rear end of the queue. This paper presents an improvisation to the traditional round robin scheduling algorithm, by proposing a new method. The new method represents the time slice as a function of the burst time of the waiting process in the ready queue. Fixing the time slice for a process is a crucial factor, because it subsequently influences many performance parameters like turnaround time, waiting time, response time and the frequency of context switches.  Though the time slot is fixed for each process, this paper explores the fine-tuning of the time slice for processes which do not complete in the stipulated time allotted to them.&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2015-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v5i6.pp1480-1485</dc:identifier><dc:identifier>10.11591/ijece.v5i6.pp1480-1485</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 5 No 6 (2015); 1480</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/5774/4508</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>