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

Minimizing waiting time for tasks waiting in the queue for execution is oneof the important scheduling cri-teria which took a wide area in schedulingpreemptive tasks. In this paper we present Changeable Time Quan-tum (CTQ)approach combined with the round-robin algorithm, we try to adjust the timequantum according to the burst times of the tasks in the ready queue. There aretwo important benefits of using (CTQ) approach: minimizing the average waitingtime of the tasks, consequently minimizing the average turnaround time, andkeeping the number of context switches as low as possible, consequentlyminimizing the scheduling overhead. In this paper, we consider the schedulingproblem for preemptive tasks, where the time costs of these tasks are known apriori. Our experimental results demonstrate that CTQ can provide much lowerscheduling overhead and better scheduling criteria.

Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum