用C语言实现对N个进程采用高优先权优先进程调度算法的模拟

好的，下面是一个简单的用C语言实现对N个进程采用高优先权优先进程调度算法的模拟的示例代码。

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

#define MAX_PROCESS 10

struct Process {
    int id;
    int arrival_time;
    int burst_time;
    int priority;
};

struct ProcessQueue {
    struct Process* queue[MAX_PROCESS];
    int front;
    int rear;
    int size;
};

void initQueue(struct ProcessQueue* q) {
    q->front = 0;
    q->rear = 0;
    q->size = 0;
}

int isQueueEmpty(struct ProcessQueue* q) {
    return q->size == 0;
}

int isQueueFull(struct ProcessQueue* q) {
    return q->size == MAX_PROCESS;
}

void enqueue(struct ProcessQueue* q, struct Process* p) {
    if (isQueueFull(q)) {
        printf("Queue is full. Cannot enqueue process %d.\n", p->id);
        return;
    }
    q->queue[q->rear] = p;
    q->rear = (q->rear + 1) % MAX_PROCESS;
    q->size++;
}

struct Process* dequeue(struct ProcessQueue* q) {
    if (isQueueEmpty(q)) {
        printf("Queue is empty. Cannot dequeue process.\n");
        return NULL;
    }
    struct Process* p = q->queue[q->front];
    q->front = (q->front + 1) % MAX_PROCESS;
    q->size--;
    return p;
}

void printQueue(struct ProcessQueue* q) {
    if (isQueueEmpty(q)) {
        printf("Queue is empty.\n");
        return;
    }
    printf("Queue:\n");
    int i;
    for (i = q->front; i != q->rear; i = (i + 1) % MAX_PROCESS) {
        printf("  Process %d (arrival time: %d, burst time: %d, priority: %d)\n", q->queue[i]->id, q->queue[i]->arrival_time, q->queue[i]->burst_time, q->queue[i]->priority);
    }
}

int main() {
    int n;
    printf("Enter the number of processes: ");
    scanf("%d", &n);
    if (n > MAX_PROCESS) {
        printf("Number of processes cannot exceed %d.\n", MAX_PROCESS);
        return 1;
    }
    struct Process processes[MAX_PROCESS];
    int i;
    for (i = 0; i < n; i++) {
        printf("Enter arrival time, burst time, and priority for process %d: ", i);
        struct Process* p = (struct Process*)malloc(sizeof(struct Process));
        p->id = i;
        scanf("%d %d %d", &p->arrival_time, &p->burst_time, &p->priority);
        processes[i] = *p;
    }
    struct ProcessQueue queue;
    initQueue(&queue);
    int time = 0;
    while (!isQueueEmpty(&queue) || time == 0) {
        for (i = 0; i < n; i++) {
            if (processes[i].arrival_time == time) {
                enqueue(&queue, &processes[i]);
            }
        }
        if (!isQueueEmpty(&queue)) {
            struct Process* p = dequeue(&queue);
            printf("Process %d is running (arrival time: %d, burst time: %d, priority: %d) at time %d.\n", p->id, p->arrival_time, p->burst_time, p->priority, time);
            p->burst_time--;
            if (p->burst_time == 0) {
                printf("Process %d is finished at time %d.\n", p->id, time + 1);
            } else {
                enqueue(&queue, p);
            }
        }
        time++;
    }
    return 0;
}

该示例代码需要用户输入进程数量以及每个进程的到达时间、执行时间和优先级等信息。程序首先将所有进程按照到达时间插入到一个等待队列中，然后按照优先级从高到低依次执行队列中的进程。如果有多个进程的优先级相同，则按照先到达的顺序依次执行。在每个时间片中，程序会检查是否有新的进程到达，以及当前正在执行的进程是否已经完成。如果正在执行的进程完成了，那么程序会将其从队列中移除，否则程序会将其重新加入队列中等待下一次执行。最后，程序将输出每个进程的完成时间。

需要注意的是，该示例代码并没有考虑一些实际情况，例如进程的等待时间、响应时间和周转时间等指标，用户可以根据需要自行添加。