多级反馈队列调度算法c++

多级反馈队列调度算法是一种常见的进程调度算法，它将进程按照优先级划分为多个队列，并且每个队列都有一个时间片大小，优先级高的队列时间片小，优先级低的队列时间片大。当一个进程进入队列时，它被放置在最高优先级的队列中，如果它在该队列中运行完了时间片，但是还没有完成，则它会被移到下一个优先级的队列中，以此类推，直到完成或者到达最低优先级的队列。

下面是一个简单的多级反馈队列调度算法的C++实现：

#include <iostream>
#include <queue>
using namespace std;

struct Process {
    int pid; // 进程ID
    int priority; // 进程优先级
    int burst_time; // 进程执行时间
};

int main() {
    // 创建5个队列
    queue<Process> q0, q1, q2, q3, q4;

    // 初始化进程
    Process p1 = {1, 0, 8};
    Process p2 = {2, 1, 10};
    Process p3 = {3, 2, 6};
    Process p4 = {4, 3, 4};
    Process p5 = {5, 4, 2};

    // 将进程放入第0个队列
    q0.push(p1);
    q0.push(p2);
    q0.push(p3);
    q0.push(p4);
    q0.push(p5);

    // 模拟调度过程
    int time = 0;
    while (!q0.empty() || !q1.empty() || !q2.empty() || !q3.empty() || !q4.empty()) {
        if (!q0.empty()) {
            Process p = q0.front();
            q0.pop();
            cout << "Time " << time << ": Running process " << p.pid << " in queue 0" << endl;
            p.burst_time -= 1;
            time += 1;
            if (p.burst_time > 0) {
                q1.push(p);
            }
        } else if (!q1.empty()) {
            Process p = q1.front();
            q1.pop();
            cout << "Time " << time << ": Running process " << p.pid << " in queue 1" << endl;
            p.burst_time -= 1;
            time += 2;
            if (p.burst_time > 0) {
                q2.push(p);
            }
        } else if (!q2.empty()) {
            Process p = q2.front();
            q2.pop();
            cout << "Time " << time << ": Running process " << p.pid << " in queue 2" << endl;
            p.burst_time -= 1;
            time += 4;
            if (p.burst_time > 0) {
                q3.push(p);
            }
        } else if (!q3.empty()) {
            Process p = q3.front();
            q3.pop();
            cout << "Time " << time << ": Running process " << p.pid << " in queue 3" << endl;
            p.burst_time -= 1;
            time += 8;
            if (p.burst_time > 0) {
                q4.push(p);
            }
        } else if (!q4.empty()) {
            Process p = q4.front();
            q4.pop();
            cout << "Time " << time << ": Running process " << p.pid << " in queue 4" << endl;
            p.burst_time -= 1;
            time += 16;
        }
    }

    return 0;
}