用c++的时间片轮转调度算法实现单处理机系统的进程调度

以下是用 C 语言实现时间片轮转调度算法的单处理机系统进程调度的示例代码：

#include <stdio.h>
#include <stdlib.h>

#define MAX_PROCESSES 10
#define TIME_QUANTUM 2

struct process {
    int pid;
    int arrival_time;
    int burst_time;
    int remaining_time;
    int completion_time;
    int turnaround_time;
    int waiting_time;
};

int main() {
    struct process processes[MAX_PROCESSES];
    int num_processes, i, j, time = 0, completed = 0, quantum_remaining = 0;

    printf("Enter the number of processes: ");
    scanf("%d", &num_processes);

    // Input the details of each process
    for (i = 0; i < num_processes; i++) {
        printf("\nEnter details of process %d:\n", i + 1);
        printf("Arrival time: ");
        scanf("%d", &processes[i].arrival_time);
        printf("Burst time: ");
        scanf("%d", &processes[i].burst_time);
        processes[i].remaining_time = processes[i].burst_time;
        processes[i].pid = i + 1;
    }

    // Perform time slice based scheduling
    printf("\nTime Slice based Scheduling using Round Robin Algorithm\n\n");
    printf("Time\tProcess ID\tRemaining Time\n");

    while (completed < num_processes) {
        // Check for new arrivals
        for (i = 0; i < num_processes; i++) {
            if (processes[i].arrival_time == time) {
                printf("\nProcess %d has arrived.", processes[i].pid);
            }
        }

        // Execute the current process for the time quantum or until it completes
        for (i = 0; i < num_processes; i++) {
            if (processes[i].remaining_time > 0) {
                if (quantum_remaining == 0) {
                    printf("\nTime quantum expired. Switching to process %d.", processes[i].pid);
                    quantum_remaining = TIME_QUANTUM;
                }

                if (quantum_remaining >= processes[i].remaining_time) {
                    quantum_remaining -= processes[i].remaining_time;
                    time += processes[i].remaining_time;
                    processes[i].remaining_time = 0;
                    processes[i].completion_time = time;
                    processes[i].turnaround_time = processes[i].completion_time - processes[i].arrival_time;
                    processes[i].waiting_time = processes[i].turnaround_time - processes[i].burst_time;
                    completed++;
                    printf("\n%d\t%d\t\t%d (Completed)", time, processes[i].pid, processes[i].remaining_time);
                } else {
                    processes[i].remaining_time -= quantum_remaining;
                    time += quantum_remaining;
                    quantum_remaining = 0;
                    printf("\n%d\t%d\t\t%d (Remaining)", time, processes[i].pid, processes[i].remaining_time);
                }
            }
        }
    }

    // Print the final statistics
    printf("\n\nProcess\tArrival Time\tBurst Time\tCompletion Time\tTurnaround Time\tWaiting Time");
    for (i = 0; i < num_processes; i++) {
        printf("\n%d\t\t%d\t\t%d\t\t%d\t\t%d\t\t\t%d", processes[i].pid, processes[i].arrival_time, processes[i].burst_time, processes[i].completion_time, processes[i].turnaround_time, processes[i].waiting_time);
    }

    return 0;
}

该代码使用 `struct process` 结构体来存储每个进程的详细信息，包括进程 ID、到达时间、执行时间、剩余时间、完成时间、周转时间和等待时间。它使用了时间片轮转调度算法，时间片大小为 2 个时间单位。在每个时间单位，它检查是否有新的进程到达，然后执行当前进程直到时间片结束或进程完成。完成的进程将计算其完成时间、周转时间和等待时间，并增加已完成进程的数量。在所有进程完成后，它将打印每个进程的统计信息。

需要注意的是，这只是一个示例代码，可能需要根据实际应用对其进行修改。