操作系统原理作业，首次适应分配，最佳适应分配

操作系统原理作业，首次适应分配，最佳适应分配

package package1;

import java.util.*;

class Stor implements Comparable<Stor> {
    public int size = 0;
    public int use = 0;
    public int begin = 0;
    public int live = 0;
    public String name = "";

    @Override
    public int compareTo(Stor o) {
        return this.live - o.live;
    }
}

class ThreadProcess extends Thread {
    Stor s[];
    Random random = new Random();

    public ThreadProcess(Stor s[]) {
        this.s = s;
    }

    @Override
    synchronized public void run() {
        super.run();
        int size = random.nextInt(200);
        while (size == 0) {
            size = random.nextInt(200);
        }
        System.out.printf("线程：%-5s请求空间：%-5d \n", currentThread().getName(), size);
        int i = 0;
        while (i < s.length) {
            if (s[i].size > size && s[i].name.equals("")) {
                s[i].name = currentThread().getName();
                s[i].use = size;
                s[i].begin = s[i].begin + s[i].use;
//                System.out.printf("序号：%-5d空间：%-5d开始位置：%-5d已使用：%-5d线程：%-5s \n", i, s[i].size, s[i].begin, s[i].use, s[i].name);
                break;
            }
            i++;
        }
    }
}class ThreadProcess_BF extends Thread {
    Stor s[];
    Random random = new Random();

    public ThreadProcess_BF(Stor s[]) {
        this.s = s;
    }

    @Override
    synchronized public void run() {
        super.run();
        Arrays.sort(s);
        int size = random.nextInt(200);
        while (size == 0) {
            size = random.nextInt(200);
        }
        System.out.printf("线程：%-5s请求空间：%-5d \n", currentThread().getName(), size);
        int i = 0;
        while (i < s.length) {
            if (s[i].size > size && s[i].name.equals("")) {
                s[i].name = currentThread().getName();
                s[i].use = size;
                s[i].begin = s[i].begin + s[i].use;
//                System.out.printf("序号：%-5d空间：%-5d开始位置：%-5d已使用：%-5d线程：%-5s \n", i, s[i].size, s[i].begin, s[i].use, s[i].name);
                break;
            }
            i++;
        }
    }
}


public class Test {
    public static void print(Stor s[]) {
        for (int i = 0; i < s.length; i++) {
            System.out.printf("序号：%-5d初始空间：%-5d开始位置：%-5d已使用：%-5d剩余空间：%-5d线程：%-5s \n", i, s[i].size, s[i].begin, s[i].use, s[i].size - s[i].use, s[i].name);
        }
    }

    public static void initStor(Stor s[]) {
        for (int i = 0; i < s.length; i++) {
            if (i == 0) {
                s[i].begin = 0;
                s[i].size = (i + 1) * 20;
                s[i].live = s[i].size;
//                s[i].size = new Random().nextInt(100);
            } else {
                s[i].begin = s[i - 1].begin + s[i - 1].size;
                s[i].size = (i + 1) * 20;
                s[i].live = s[i].size;
//                s[i].size = new Random().nextInt(100);
            }
        }
    }
    public static void FF(Stor ss[]) {
        System.out.println("--------------------------首次适应---------------------");
        Stor s[] = new Stor[ss.length];
        for(int i = 0; i < ss.length; i++){
            s[i] = new Stor();
        }
        copyStor(ss,s);

        ThreadProcess_BF t = new ThreadProcess_BF(s);
        Thread P1 = new Thread(t, "P1");
        Thread P2 = new Thread(t, "P2");
        Thread P3 = new Thread(t, "P3");
        Thread P4 = new Thread(t, "P4");
        P1.start();
        P2.start();
        P3.start();
        P4.start();
        try {
            Thread.sleep(100);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        print(s);
        System.out.println("--------------------------首次适应---------------------");
    }

    public static void copyStor(Stor sec[], Stor dse[]){
        for(int i = 0; i < sec.length; i++){
            dse[i].size = sec[i].size;
            dse[i].begin = sec[i].begin;
            dse[i].name = sec[i].name;
            dse[i].use = sec[i].use;
        }
    }

    public static void BF(Stor ss[]) {
        System.out.println("\n\n\n\n--------------------------最佳适应---------------------");
        Stor s[] = new Stor[ss.length];
        for(int i = 0; i < ss.length; i++){
            s[i] = new Stor();
        }
        copyStor(ss,s);

        ThreadProcess t = new ThreadProcess(s);
        Thread P1 = new Thread(t,"P1");
        Thread P2 = new Thread(t,"P2");
        Thread P3 = new Thread(t,"P3");
        Thread P4 = new Thread(t,"P4");
        P1.start();
        P2.start();
        P3.start();
        P4.start();
        try {
            Thread.sleep(100);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        print(s);
        System.out.println("--------------------------最佳适应---------------------");
    }

    public static void main(String[] args) {
        Stor s[] = new Stor[10];
        for (int i = 0; i < s.length; i++) {
            s[i] = new Stor();
        }
        initStor(s);
        FF(s);
        BF(s);
    }
}

结果