PR进程调度java代码

以下是一个基于PR（优先级调度）算法的Java代码示例：

import java.util.*;

public class PriorityScheduler {

    public static void main(String[] args) {

        // 创建一个优先队列，用于存储进程
        PriorityQueue<Process> queue = new PriorityQueue<>();

        // 添加进程到优先队列
        queue.add(new Process("P1", 0, 5, 3));
        queue.add(new Process("P2", 1, 3, 2));
        queue.add(new Process("P3", 2, 6, 1));
        queue.add(new Process("P4", 3, 2, 4));
        queue.add(new Process("P5", 4, 4, 2));

        // 初始化时间片
        int timeSlice = 1;

        // 执行进程调度
        while (!queue.isEmpty()) {
            Process currentProcess = queue.poll();
            System.out.println("执行进程：" + currentProcess.getName());
            currentProcess.execute(timeSlice);
            if (currentProcess.isFinished()) {
                System.out.println("进程 " + currentProcess.getName() + " 执行完毕");
            } else {
                queue.add(currentProcess);
            }
        }
    }
}

class Process implements Comparable<Process> {

    private String name;
    private int arrivalTime;
    private int burstTime;
    private int priority;
    private int remainingTime;

    public Process(String name, int arrivalTime, int burstTime, int priority) {
        this.name = name;
        this.arrivalTime = arrivalTime;
        this.burstTime = burstTime;
        this.priority = priority;
        this.remainingTime = burstTime;
    }

    public String getName() {
        return name;
    }

    public boolean isFinished() {
        return remainingTime == 0;
    }

    public void execute(int timeSlice) {
        remainingTime -= timeSlice;
    }

    @Override
    public int compareTo(Process other) {
        return Integer.compare(priority, other.priority);
    }
}

在这个示例中，我们使用了一个优先队列来存储进程，并按照优先级对进程进行排序。每次从队列中取出优先级最高的进程进行执行，并根据时间片执行一段时间。如果该进程在时间片结束前完成了执行，就将其从队列中移除。否则，将其重新加入队列，并等待下一次调度。