操作系统内存分配算法模拟实现(2)

} } r = r.next; behind_r = r.next; front_r = front_r.next; //记录第一块空闲分区的上一块 while(behind_r != null){ } System.out.println(\重定向成功，继续为作业分配内存...\if(behind_r.state){ } else{ } behind_r = r.next; r.size += behind_r.size; r.next = behind_r.next; front_r.next = behind_r; r.next = behind_r.next; behind_r.next = r; front_r = behind_r; public void addJob(){ //添加作业 } public void delJob(){ //销毁作业 String cur_job_name = new String(\int newSize; //新作业所需内存大小 String nJobName = new String(\Scanner scanner=new Scanner(System.in); System.out.print(\请输入新任务的名称：\nJobName = scanner.nextLine(); System.out.print(\请输入新任务所需内存大小：\newSize = scanner.nextInt(); memAllocation(newSize,nJobName); } boolean flag = false; //指示作业是否删除成功 FreeBlock q=flist.head.next; Scanner scanner=new Scanner(System.in); System.out.print(\请输入需要回收的作业名称:\cur_job_name = scanner.nextLine(); while(q != null){ } if(flag){ } else{ } System.out.println(\删除作业未成功！\System.out.println(\删除作业成功！\if(q.job_name == cur_job_name){ } else{ } q = q.next; //找到要删除的作业的下一个结点 q.state = false; q.job_name = \memRecovery(q); //回收内存 flag = true; break; public void printJobInfo(){ //打印作业信息 FreeBlock p = flist.head.next; int pro_num = 1; //用户程序号 int mem_num = 1; //内存分区块号 System.out.println(\用户程序信息----------\while(p != null){ if(p.state){ } } } } System.out.println(\用户程序\ +\占用第\分区块\pro_num++; mem_num++; p = p.next; public void printFreeSubareaInfo(){ } 其它类的实现 FreeBlock p = flist.head.next; //打印空闲分区信息 int leav_size = 0; //剩余内存大小 int mem_num = 1; //内存分区块号 System.out.println(\空闲分区信息----------\System.out.println(\分区块号\\t大小\while(p != null){ } System.out.println(\剩余内存总打小为\if(!p.state){ } mem_num++; p = p.next; System.out.println(\leav_size += p.size; 空闲分区块类： package com.kaiping.memorymanage; public class FreeBlock { int size; //空闲块大小 //false表示空闲，true表示已经装入作业 boolean state; String job_name; //装入的作业名称 FreeBlock next; //下一空闲块的自引用 public FreeBlock(int s){ } } 空闲分区链类： package com.kaiping.memorymanage; import java.util.Scanner; public class FreeList { FreeBlock fblock; FreeBlock head; int fblockNum; int flistsize; } public boolean isEmpty(){ } public void insertFBlock(int size){ FreeBlock newBlock = new FreeBlock(size); if(fblock == null){ } else{ fblock = newBlock; head.next = fblock; return (fblock == null); //空闲块数 int sumMemCount; //内存总大小 //空闲分区总和 public FreeList(){ fblock = null; head = new FreeBlock(0); size = s; state = false; job_name = new String(\ next = null; } } fblock.next = newBlock; fblock = fblock.next; public void deleteFBlock(FreeBlock dblock){ } public void InitFBlock(){ int leavesCount; int bsize=0; //为化入分区内存总大小 //分区块大小 FreeBlock temp = head; while(temp != null){ } if(temp.next == dblock){ } temp = temp.next; temp.next = dblock.next; break; Scanner scanner=new Scanner(System.in); System.out.print(\初始多大空间，请输入一整数：\sumMemCount = scanner.nextInt(); leavesCount = sumMemCount; flistsize = sumMemCount; //初始空闲分区大小为内存大小 System.out.print(\需将内存分为多少分区块，请输入一整数：\fblockNum = scanner.nextInt(); System.out.println(\初始化内存分区----------\for(int i=1; i <= fblockNum; i++){ if(i == fblockNum){ } else{ System.out.print(\请输入第\块分区大小：\insertFBlock(leavesCount);

百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读，免费范文网，提供经典小说综合文库操作系统内存分配算法模拟实现(2)在线全文阅读。