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) Algorithm is considered as optimal in time sharedenvironment because the static time is equally shared among the processes. Ifthe time quantum taken is static then it undergoes degradation of the CPUperformance and leads to so many context switches. In this paper, we haveproposed a new effective dynamic RR algorithm SMDRR (Subcontrary Mean DynamicRound Robin) based on dynamic time quantum where we use the subcontrary mean orharmonic mean to find the time quantum. The idea of this approach is to makethe time quantum repeatedly adjusted according to the burst time of thecurrently running processes. Our experimental analysis shows that SMDRRperforms better than RR algorithm in terms of reducing the number of contextswitches, average turnaround time and average waiting time.

Enhancing CPU Performance using Subcontrary Mean Dynamic Round Robin (SMDRR) Scheduling Algorithm