English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Round-Robin (RR) is the vastly used process scheduling algorithm where, all processes are allocated some time shares in a circular order. If a process is able to complete its execution within this time quantum share, it is removed from the ready queue else it goes back at the end of the queue. Round-Robin scheduling is simple, gives fair allocation of CPU to the process and is starvation free. However there is few performance issues related to it. One of them is that even if there is a fractional amount of time left for a process to complete it execution, and its time share expires, it is preempted. Now this process has to wait unnecessarily to get its next chance to complete this fractional remaining execution. In this paper the proposal for the modification which will eradicate this performance issue of the conventional round robin algorithm is proposed thereby making it fairer.

A New Approach for Dynamic Time Quantum Allocation in Round Robin Process Scheduling Algorithm