操作系统动态内存分配 精品.doc_第1页
操作系统动态内存分配 精品.doc_第2页
操作系统动态内存分配 精品.doc_第3页
操作系统动态内存分配 精品.doc_第4页
操作系统动态内存分配 精品.doc_第5页
已阅读5页,还剩2页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

package .gaojingdian.arithmetic;import java.io.IOException;import java.util.ArrayList;import java.util.LinkedList;import java.util.List;import .gaojingdian.DataFrame.PCB;import .gaojingdian.DataFrame.Subarea;import .gaojingdian.MainMemorySubarea.MainMemorySubarea;import .gaojingdian.MainMemorySubarea.RevokeMemory;/* * 最佳适应算法 * */public class BestFit extends FCFSprivate List readyList=new ArrayList(); /就绪队列private List allocationList=new LinkedList();/已分分配分区队列private static MainMemorySubarea mms=null;private PCB lastPCB=null;private Subarea revokeSubarea=null;/当前要释放的分区private List emptySubarea=null;/空闲队列private List list=null;/中间容器staticmms=new MainMemorySubarea();/用FCFS调度算法从后备队列中往内存中调入满足条件的作业,并用最佳适应算法为作业分配内存空间private void enterReadyList() throws IOExceptionmms.initFreeList();if(emptySubarea=null)emptySubarea=mms.getSubareaList();for(int i=0;ilist.size();i+)int j=0;j=this.getIndex(list.get(i);if(j!=-1)readyList.add(list.get(i);if(emptySubarea.get(j).getSize()-list.get(i).getProcessSize()=Subarea.unalteredSize)Subarea rsb=new Subarea();rsb.setSize(emptySubarea.get(j).getSize();rsb.setBeginAddress(emptySubarea.get(j).getBeginAddress();rsb.setPcbId(list.get(i).getId();allocationList.add(rsb);emptySubarea.remove(emptySubarea.get(j);elseSubarea sa=emptySubarea.get(j);Subarea rsb=new Subarea();rsb.setSize(list.get(i).getProcessSize();rsb.setBeginAddress(sa.getBeginAddress();rsb.setPcbId(list.get(i).getId();allocationList.add(rsb);sa.setBeginAddress(sa.getBeginAddress()+list.get(i).getProcessSize();sa.setSize(sa.getSize()-list.get(i).getProcessSize();list.get(i).setLogo2(1);break;if(j=-1)list.get(i).setLogo1(1);/执行进程,并回收内存空间public void bestFit() throws IOExceptionPCB pcb=null;int temp=10000;int index=0;while(true)list=super.selectProcess(readyList, lastPCB);this.enterReadyList();temp=10000;if(readyList.size()!=0)if(this.getCount()!=readyList.size()for(int i=0;ireadyList.size();i+)if(readyList.get(i).getArriveTime()temp&readyList.get(i).getLogo()=0&readyList.get(i).getLogo2()=1&readyList.get(i).getLogo1()=0)temp=readyList.get(i).getArriveTime();index=i;pcb=readyList.get(index);if(lastPCB=null)pcb.setBeginTime(pcb.getArriveTime();elsepcb.setBeginTime(lastPCB.getEndTime();pcb.setEndTime(pcb.getBeginTime()+pcb.getRunTime();pcb.setLogo(1);lastPCB=pcb;revokeSubarea=RevokeMemory.selectRevoke(allocationList,pcb);RevokeMemory.revokeMemory(emptySubarea,revokeSubarea);elsebreak;/判断就绪队列中还有没有为被执行的进程private int getCount()int count=0;for(int i=0;ireadyList.size();i+)if(readyList.get(i).getLogo()=1)count+;return count;/返回空闲分区中大小最合适的分区的下标private int getIndex(PCB pcb)int temp=10000;int index=-1;for(int i=0;iemptySubarea.size();i+)if(pcb.getProcessSize()=emptySubarea.get(i).getSize()&(emptySubarea.get(i).getSize()-pcb.getProcessSize()temp)temp=emptySubarea.get(i).getSize()-pcb.getProcessSize();index=i;return index;public List getAllocationList() return allocationList;public void setAllocationList(List allocationList) this.allocationList = allocationList;public List getEmptySubarea() return emptySubarea;public void setEmptySubarea(List emptySubarea) this.emptySubarea = emptySubarea;public List getReadyList() return readyList;public void setReadyList(List readyList) this.readyList = readyList;package .gaojingdian.arithmetic;import java.io.IOException;import java.util.ArrayList;import java.util.LinkedList;import java.util.List;import .gaojingdian.DataFrame.PCB;import .gaojingdian.DataFrame.Subarea;import .gaojingdian.MainMemorySubarea.MainMemorySubarea;import .gaojingdian.MainMemorySubarea.RevokeMemory;import .gaojingdian.Test.Test;import .gaojingdian.WorkList.WorkLists;/* * 首次适应算法 * author gaojingdian * */public class FirstFit extends FCFSprivate List readyList=new ArrayList(); /就绪队列private List allocationList=new LinkedList();/已分分配分区队列private static MainMemorySubarea mms=null;private PCB lastPCB=null;private Subarea revokeSubarea=null;/当前要释放的分区private List emptySubarea=null;/空闲队列private List list=null;/中间容器staticmms=new MainMemorySubarea();/用FCFS调度算法从后备队列中往内存中调入满足条件的作业,并用首次适应算法为作业分配内存空间private void enterReadyList() throws IOExceptionmms.initFreeList();if(emptySubarea=null)emptySubarea=mms.getSubareaList();for(int i=0;ilist.size();i+)int j=0;for(;jemptySubarea.size();j+)if(list.get(i).getProcessSize()=emptySubarea.get(j).getSize()readyList.add(list.get(i);if(emptySubarea.get(j).getSize()-list.get(i).getProcessSize()=Subarea.unalteredSize)Subarea rsb=new Subarea();rsb.setSize(emptySubarea.get(j).getSize();rsb.setBeginAddress(emptySubarea.get(j).getBeginAddress();rsb.setPcbId(list.get(i).getId();allocationList.add(rsb);emptySubarea.remove(emptySubarea.get(j);elseSubarea sa=emptySubarea.get(j);Subarea rsb=new Subarea();rsb.setSize(list.get(i).getProcessSize();rsb.setBeginAddress(sa.getBeginAddress();rsb.setPcbId(list.get(i).getId();allocationList.add(rsb);sa.setBeginAddress(sa.getBeginAddress()+list.get(i).getProcessSize();sa.setSize(sa.getSize()-list.get(i).getProcessSize();list.get(i).setLogo2(1);break;if(j=emptySubarea.size()list.get(i).setLogo1(1);/执行进程,并回收内存空间public void firstFit() throws IOExceptionPCB pcb=null;int temp=10000;int index=0;while(true)list=super.selectProcess(readyList, lastPCB);this.enterReadyList();temp=10000;if(readyList.size()!=0)if(this.getCount()!=readyList.size()for(int i=0;ireadyList.size();i+)if(readyList.get(i).getArriveTime()temp&readyList.get(i).getLogo()=0&readyList.get(i).getLogo2()=1&readyList.get(i).getLogo1()=0)temp=readyList.get(i).getArriveTime();index=i;pcb=readyList.get(index);if(lastPCB=null)pcb.setBeginTime(pcb.getArriveTime();elsepcb.setBeginTime(lastPCB.getEndTime();pcb.setEndTime(pcb.getBeginTime()+pcb.getRunTime();pcb.setLogo(1);lastPCB=pcb

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论