用c语言实现一个任务调度程序

好的，为您提供一个示例程序：

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

typedef struct task {
int id; // 任务 ID
int priority; // 任务优先级
int arrival_time; // 任务到达时间
int burst_time; // 任务运行时间
} Task;

Task *create_task(int id, int priority, int arrival_time, int burst_time) {
Task *task = (Task *) malloc(sizeof(Task));
task->id = id;
task->priority = priority;
task->arrival_time = arrival_time;
task->burst_time = burst_time;
return task;
}

void print_task(Task *task) {
printf("Task %d: priority = %d, arrival_time = %d, burst_time = %d\n",
task->id, task->priority, task->arrival_time, task->burst_time);
}

void swap(Task *tasks[], int i, int j) {
Task *temp = tasks[i];
tasks[i] = tasks[j];
tasks[j] = temp;
}

void sort_tasks(Task *tasks[], int n) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (tasks[j]->priority > tasks[j + 1]->priority) {
swap(tasks, j, j + 1);
} else if (tasks[j]->priority == tasks[j + 1]->priority) {
if (tasks[j]->arrival_time > tasks[j + 1]->arrival_time) {
swap(tasks, j, j + 1);
}
}
}
}
}

void schedule_tasks(Task *tasks[], int n) {
int current_time = tasks[0]->arrival_time;
while (n > 0) {
sort_tasks(tasks, n);
Task *current_task = tasks[0];
int remaining_time = current_task->burst_time;
printf("Scheduled ");
print_task(current_task);
free(current_task);
n--;
for (int i = 0; i < n; i++) {
tasks[i]->arrival_time -= current_time;
}
int i = 0;
while (i < n) {
if (tasks[i]->arrival_time <= 0) {
Task *t = tasks[i];
if (t->burst_time <= remaining_time) {
printf("Scheduled ");
print_task(t);
free(t);
n--;
remaining_time -= t->burst_time;
for (int j = i; j < n; j++) {
tasks[j] = tasks[j + 1];
}
} else {
t->burst_time -= remaining_time;
t->arrival_time -= remaining_time;
printf("Scheduled ");
print_task(create_task(t->id, t->priority, 0, remaining_time));
i++;
current_time += remaining_time;
remaining_time = 0;
}
} else {
i++;
}
}
current_time += current_task->burst_time;
}
}

int main() {
srand(time(0));
int n = 10;
Task *tasks[n];
for (int i = 0; i < n; i++) {
tasks[i] = create_task(i, rand() % 5, rand() % 10, rand() % 5 + 1);
print_task(tasks[i]);
}
printf("\n");
schedule_tasks(tasks, n);
return 0;
}