2017
DOI: 10.11591/ijece.v7i6.pp3664-3668
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance

Abstract: In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads resulting in l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 2 publications
0
5
0
Order By: Relevance
“…Upon receiving a new request, the Data Centre Controller (DCC) searches for the least loaded or idle VM in the VM index table. This approach uses the first-come, first-served principle to distribute the load to the VM with the lowest index number when there have multiple servers [17].…”
Section: The Active Monitoring Load Balancer (Amlb) Algorithmmentioning
confidence: 99%
“…Upon receiving a new request, the Data Centre Controller (DCC) searches for the least loaded or idle VM in the VM index table. This approach uses the first-come, first-served principle to distribute the load to the VM with the lowest index number when there have multiple servers [17].…”
Section: The Active Monitoring Load Balancer (Amlb) Algorithmmentioning
confidence: 99%
“…The old approach, to introduce studies on computer organizat ion and architecture, is proposed by Patterson and Hennessy [26]. It rev iewed the hard ware section to understand computer organizat ion and architecture, and used assembly language and scheduling [14], while the Learning Outco me for Co mputer Engineering programme demands how the undergraduate student can design the CPU so that the computer can run in accordance with its concept of architecture and organization.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Usually, there are many chapters in many COA's handbook [13]. There is also exists many simple architecture of of an 8-bit CPU architectures such as Mic-1, M ic-2, [14][15][16][17], SAP-1, SAP-2, etc [18][19][20]. They are based on the architecture of Von Neumann machine [21].…”
Section: Introductionmentioning
confidence: 99%
“…The RR algorithm's performance depends on the time quantum used. There have been many efforts to pick the best time quantum [6]. Due to low performance, realtime operating systems apart from RR scheduling are infrequently employed in these algorithms [7].…”
Section: Introductionmentioning
confidence: 99%