2015 4th International Conference on Software Engineering and Computer Systems (ICSECS) 2015
DOI: 10.1109/icsecs.2015.7333108
|View full text |Cite
|
Sign up to set email alerts
|

Queueing theory study of round robin versus priority dynamic quantum time round robin scheduling algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 11 publications
0
7
0
Order By: Relevance
“…It is responsible to manage the tasks in the system. With the scheduling methodology such as round robin with time slicing, a task can be purposely halted during execution when timed out to have another task with the same priority level to start executing [10]. This is also called multitasking.…”
Section: Real-time Operating System 231 Concept Of Rtosmentioning
confidence: 99%
See 1 more Smart Citation
“…It is responsible to manage the tasks in the system. With the scheduling methodology such as round robin with time slicing, a task can be purposely halted during execution when timed out to have another task with the same priority level to start executing [10]. This is also called multitasking.…”
Section: Real-time Operating System 231 Concept Of Rtosmentioning
confidence: 99%
“…When the program returns, it does not move back to Task 3 as the scheduler detected that a higher priority task (BuzzerOn) is activated. BuzzerOn will now be served, but shortly after that, the system detected a hit impact on timeline 6 ms. BuzzerOn will be preempted and the system will move again to ISR [10]. The task TriggerAirBag will be set to active and when the program returns, it will move to TriggerAirBag as it has higher priority than BuzzerOn.…”
Section: Real-time Operating System 231 Concept Of Rtosmentioning
confidence: 99%
“…This new model also adopts and modifies Round Robin (RR), shortest processing time (SPT), and shortest remaining time (SRT) algorithms. RR is popular in computer (CPU and cloud) [13][14][15][16] and network [17][18][19][20] areas. This algorithm is widely used in computer and network areas due to the suit characteristic of these areas, where data or packet can be split into smaller chunks and in general, resources are not dedicated.…”
Section: Introductionmentioning
confidence: 99%
“…The relatively newly released advanced OS has specific CPU scheduling, which also requires many efficient processes to use the central processing unit at simultaneous times. [3] [4]. The scheduler is special system software that is responsible for handling resource scheduling from the queue services resource.…”
Section: Introductionmentioning
confidence: 99%