2015
DOI: 10.11591/ijece.v5i6.pp1480-1485
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Time Slice Calculation for Round Robin Process Scheduling Using NOC

Abstract: <p>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 pape… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…The proposed technique has managed to decrease the response and execution time but cost was high. Furthermore, Siva et.al [56] proposed RR based scheduling technique that used the average burst time of task to calculate the time quantum. So, it can adjust to the task that needs extra time than the allocated quantum time.…”
Section: Round Robinmentioning
confidence: 99%
“…The proposed technique has managed to decrease the response and execution time but cost was high. Furthermore, Siva et.al [56] proposed RR based scheduling technique that used the average burst time of task to calculate the time quantum. So, it can adjust to the task that needs extra time than the allocated quantum time.…”
Section: Round Robinmentioning
confidence: 99%
“…Similarly, .S. N. Rao, N. Srinivasu, S. V. N. Srinivasu, and G. R. K. Rao [47] introduced a Round Robin-based technique that calculates the time quantum from the average burst time of tasks on the ready queue that can be adjusted dynamically to the tasks that need more time than the allotted time quantum. Furthermore, A.…”
Section: Round Robinmentioning
confidence: 99%