Skip to content

Instantly share code, notes, and snippets.

@SomeBottle
Last active April 4, 2022 06:28
Show Gist options
  • Save SomeBottle/a805c98c2960ff916353cc0292eeba13 to your computer and use it in GitHub Desktop.
Save SomeBottle/a805c98c2960ff916353cc0292eeba13 to your computer and use it in GitHub Desktop.
Process Scheduling - Robin Round with Time slices(时间片轮转调度算法)
'use strict';
// Robin Round(Using limited time slice) Algorithm 时间片轮转调度算法(抢占式)
let processes = [
['P1', 10, 0],
['P2', 1, 1],
['P3', 5, 2],
['P4', 1, 3],
['P5', 2, 4]
], // [进程名,运行时间,到达输入井时间(从0ms开始)]
readyQueue = [], // 就绪队列
running = null, // 运行中的进程
runningStart = 0, // 运行中的进程开始时间
globalTimer = 0, // 全局时间
finishTime = {}, // 进程完成时间
illustrations = {}, // 直观化输出
timeSlice = 2; // 时间片
function illustrate(name, pos, chr) { // 制作直观化输出
if (!illustrations[name]) illustrations[name] = [];
let arr = illustrations[name];
for (let i = 0; i < pos; i++) { // 填充数组中间的空部分
if (!arr[i]) arr[i] = '-';
}
arr[pos] = chr;
}
while (true) {
for (let i = 0, len = processes.length; i < len; i++) { // 模拟进程按不同时间到达就绪队列
let [name, spend, arrivalTime] = processes[i];
if (arrivalTime <= globalTimer) {
processes.splice(i, 1);
illustrate(name, globalTimer, '|'); // 用竖线标记到达时间
readyQueue.push({
name: name, // 进程信息
spend: spend, // 运行时间
arrivalTime: arrivalTime, // 到达就绪队列时间
finished: 0 // 进程已经执行的时间
});
i--;
len--;
}
}
if (processes.length === 0 && readyQueue.length === 0 && !running) {
break;
}
if (!running) {
running = readyQueue.shift();
runningStart = globalTimer;
illustrate(running.name, globalTimer, '#');
} else {
let { name, spend, finished, arrivalTime } = running;
if (finished >= spend) { // 进程已经执行完毕
running = null;
finishTime[name] = [arrivalTime, globalTimer - arrivalTime]; // [程序到达时间,周转时间]
continue; // 在当前进程完成的瞬间调度下一个进程,不要等globalTimer++
} else if (globalTimer - runningStart >= timeSlice) { // 时间片轮转
readyQueue.push(running);
running = null;
continue; // 在当前进程移走的瞬间调度下一个进程,不要等globalTimer++
} else {
illustrate(name, globalTimer, '#');
}
}
running.finished++;
globalTimer++;
}
console.log('All Processes are Completed.');
let sum = 0,
processNum = 0;
for (let i in illustrations) {
let [arriveTime, turn] = finishTime[i];
sum += turn;
processNum++;
console.log(`${i} ${illustrations[i].join('')} %c${turn}ms (Arrive at ${arriveTime}ms)`, 'color:#585858');
}
let average = sum / processNum;
console.log(`Average Turnaround Time: ${average}ms`);
@SomeBottle
Copy link
Author

|代表程序到达就绪队列时间,#代表程序在运行。

@SomeBottle
Copy link
Author

SomeBottle commented Apr 3, 2022

  • 这是一个抢占式算法
  • 适用于进程调度
  • 不会造成进程饥饿

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment