数据结构之时间片轮转--队列第二篇

最新推荐文章于 2024-01-16 11:18:28 发布

不徐不急

最新推荐文章于 2024-01-16 11:18:28 发布

阅读量833

点赞数 1

分类专栏： ACM 数据结构

本文链接：https://blog.csdn.net/lin_ty/article/details/95188389

版权

本文介绍了时间片轮转调度算法，并通过Aizu - ALDS1_3_B问题阐述其在队列操作中的应用。文章提供了一个简单的代码实现，展示了如何处理多个任务，每个任务有不同的运行时间。当时间片不足以完成任务时，任务会被移回队尾，继续等待执行。代码使用scanf和printf进行输入输出，适用于处理大规模任务（如n=100000）的情况。

摘要由CSDN通过智能技术生成

时间片轮转算法（Aizu - ALDS1_3_B：Queue）

题意：

There are n processes in a queue. 
Each process has namei and timei. 
The round-robin scheduling handles the processes in order. 
A round-robin scheduler gives each process a quantum (a time slot) and 
interrupts the process if it is not completed by then. 
The process is resumed and moved to the end of the queue, 
then the scheduler handles the next process in the queue.

For example, we have the following queue with the quantum of 100ms.

A(150) - B(80) - C(200) - D(200)
First, process A is handled for 100ms, 
then the process is moved to the end of the queue with the remaining time (50ms).

B(80) - C(200) - D(200) - A(50)
Next, process B is handled for 80ms. 
The process is completed with the time stamp of 180ms and removed from the queue.

C(200) - D(200) - A(50)
Your task is to write a program which simulates the round-robin scheduling .