305 lines
7.7 KiB
Java
305 lines
7.7 KiB
Java
/* David P. Turnbull
|
|
ITCS3146
|
|
group project
|
|
this class sets up a First Fit memory scheme
|
|
*/
|
|
|
|
import java.lang.reflect.*;
|
|
|
|
//this section sets up the Car class
|
|
class FirstFit implements baseAlgorithm
|
|
{
|
|
|
|
//this section sets up the private elements of the class
|
|
private int jobId,
|
|
jobSize,
|
|
jobTime,
|
|
startLoc,
|
|
endLoc,
|
|
blkSize,
|
|
memSize = memoryManagement.MEMORYSIZE,
|
|
active,
|
|
noJobs=0,
|
|
s1=0,
|
|
compMemTest=0,
|
|
jobLoaded=0,
|
|
tableEntries=1;
|
|
private int[] tempVal = new int[6];
|
|
private int[][] memTable = new int[memSize+2][6];
|
|
private int[] memory = new int[memSize];
|
|
private Job[] jobArray = new Job[memoryManagement.JOBAMOUNT+10];
|
|
|
|
//this is a no argument constructor
|
|
public FirstFit()
|
|
{
|
|
memTable[0][0]=0; //job number
|
|
memTable[0][1]=0; //job size
|
|
memTable[0][2]=0; //start location in memory
|
|
memTable[0][3]=memSize-1; //end location in memory
|
|
memTable[0][4]=memSize; //mem blk size size
|
|
memTable[0][5]=-1; //status, 0=not active, 1=active, -1=special
|
|
}
|
|
|
|
|
|
//this method sets the job up
|
|
public void allocate(int ID, int size, int jTime)
|
|
{
|
|
//synchronized(memTable){
|
|
jobId = ID;
|
|
jobSize = size;
|
|
jobTime = jTime;
|
|
noJobs++;
|
|
s1=0;
|
|
|
|
//Bradlee's code ***********************************************************************************
|
|
try
|
|
{
|
|
Method deallocateMethod = this.getClass().getMethod("deallocate", new Class[]{int.class, int.class});
|
|
|
|
|
|
//checks to see if the job will fit in memory
|
|
if(jobSize>memSize)
|
|
{
|
|
System.out.println("\n\n*********************************************************"+
|
|
" THIS JOB IS TOO LARGE TO FIT INTO MEMORY"+
|
|
"*********************************************************");
|
|
System.exit(0);
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//this will loop until job is loaded into memory
|
|
do
|
|
{
|
|
|
|
//this section looks for a place to put the new job
|
|
do
|
|
{
|
|
if(memTable[s1][5]==-1 && memTable[s1][4]>=jobSize && memTable[s1][3]==memSize-1)
|
|
{
|
|
//runs only for the first job
|
|
if(noJobs==1)
|
|
{
|
|
synchronized(memTable){
|
|
memTable[s1][0] = jobId;
|
|
memTable[s1][1] = jobSize;
|
|
memTable[s1][2] = 0;
|
|
memTable[s1][3] = jobSize-1;
|
|
memTable[s1][4] = memTable[0][3]-memTable[0][2]+1;
|
|
memTable[s1][5] = 1;
|
|
Job newJob = new Job(jobTime, jobId, jobSize, memTable[s1][2], deallocateMethod, this);
|
|
fillMemory(jobId, jobSize, memTable[s1][2]);
|
|
jobArray[jobId - 1] = newJob;
|
|
newJob.start();
|
|
memTable[s1+1][0] = 0;
|
|
memTable[s1+1][1] = 0;
|
|
memTable[s1+1][2] = memTable[s1][3]+1;
|
|
memTable[s1+1][3] = memSize-1;
|
|
memTable[s1+1][4] = memSize-memTable[s1+1][2];
|
|
memTable[s1+1][5] = -1;
|
|
tableEntries++;
|
|
jobLoaded=1;
|
|
s1=memSize*2;
|
|
}
|
|
}
|
|
//runs after the first job and if the only available slot is at the end of memory
|
|
else
|
|
{
|
|
synchronized(memTable){
|
|
memTable[s1][0] = jobId;
|
|
memTable[s1][1] = jobSize;
|
|
memTable[s1][2] = memTable[s1-1][3]+1;
|
|
memTable[s1][3] = jobSize+memTable[s1][2]-1;
|
|
memTable[s1][4] = memTable[s1][3]-memTable[s1][2]+1;
|
|
memTable[s1][5] = 1;
|
|
Job newJob = new Job(jobTime, jobId, jobSize, memTable[s1][2], deallocateMethod, this);
|
|
fillMemory(jobId, jobSize, memTable[s1][2]);
|
|
jobArray[jobId - 1] = newJob;
|
|
newJob.start();
|
|
memTable[s1+1][0] = 0;
|
|
memTable[s1+1][1] = 0;
|
|
memTable[s1+1][2] = memTable[s1][3]+1;
|
|
memTable[s1+1][3] = memSize-1;
|
|
memTable[s1+1][4] = memSize-memTable[s1+1][2];
|
|
memTable[s1+1][5] = -1;
|
|
tableEntries++;
|
|
jobLoaded=1;
|
|
s1=memSize*2;
|
|
}
|
|
}
|
|
}
|
|
//checks for first available free block that has been deallocated
|
|
else if(memTable[s1][4]>=jobSize && memTable[s1][5]==0)
|
|
{
|
|
synchronized(memTable){
|
|
memTable[s1][0] = jobId;
|
|
memTable[s1][1] = jobSize;
|
|
memTable[s1][5] = 1;
|
|
Job newJob = new Job(jobTime, jobId, jobSize, memTable[s1][2], deallocateMethod, this);
|
|
fillMemory(jobId, jobSize, memTable[s1][2]);
|
|
jobArray[jobId - 1] = newJob;
|
|
newJob.start();
|
|
jobLoaded=1;
|
|
s1=memSize*2;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
s1++;
|
|
}
|
|
}while(s1<tableEntries);
|
|
|
|
//if job will not fit this section will compress memory
|
|
if(s1==tableEntries)
|
|
{
|
|
noJobs=noJobs-1;
|
|
compMem();
|
|
}
|
|
|
|
}while(jobLoaded==0);
|
|
s1=0;
|
|
jobLoaded=0;
|
|
|
|
|
|
|
|
} catch (Exception e)
|
|
{
|
|
}
|
|
//}
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//this method removes a job it does not check to see if the job exisits
|
|
public void deallocate(int jSize, int beginningLocation)
|
|
{
|
|
synchronized(memTable){
|
|
int deallocates1=0;
|
|
jobSize = jSize;
|
|
startLoc = beginningLocation;
|
|
//s1=0;
|
|
do
|
|
{
|
|
if(memTable[deallocates1][2] == startLoc)
|
|
{
|
|
memTable[deallocates1][0] = 0;
|
|
memTable[deallocates1][1] = 0;
|
|
memTable[deallocates1][5] = 0;
|
|
noJobs--;
|
|
deallocates1=memSize*2;
|
|
}
|
|
else
|
|
{
|
|
deallocates1++;
|
|
}
|
|
}while (deallocates1<tableEntries);
|
|
}
|
|
}
|
|
|
|
//this method compacts the memory
|
|
public void compMem()
|
|
{
|
|
compMemTest=tableEntries;
|
|
for(int c=0; c<=compMemTest; c++)
|
|
{
|
|
//this section checks to see if two unused blks are next to each other and then
|
|
//comdines them
|
|
if(memTable[c][5]==0 && memTable[c+1][5]==0)
|
|
{
|
|
synchronized(memTable){
|
|
tempVal[0] = memTable[c+1][0];
|
|
tempVal[1] = memTable[c+1][1];
|
|
tempVal[2] = memTable[c+1][2];
|
|
tempVal[3] = memTable[c+1][3];
|
|
tempVal[4] = memTable[c+1][4];
|
|
tempVal[5] = memTable[c+1][5];
|
|
memTable[c+1][0]=-1;
|
|
memTable[c+1][1]=-1;
|
|
memTable[c+1][2]=-1;
|
|
memTable[c+1][3]=-1;
|
|
memTable[c+1][4]=-1;
|
|
memTable[c+1][5]=-1;
|
|
memTable[c][0]=0;
|
|
memTable[c][1]=0;
|
|
memTable[c][3]=tempVal[3];
|
|
memTable[c][4]=memTable[c][4]+tempVal[4];
|
|
memTable[c][5]=0;
|
|
//this loop shifts the remaining jobs up
|
|
for(int srt=c+1; srt<tableEntries; srt++)
|
|
{
|
|
memTable[srt][0]=memTable[srt+1][0];
|
|
memTable[srt][1]=memTable[srt+1][1];
|
|
memTable[srt][2]=memTable[srt+1][2];
|
|
memTable[srt][3]=memTable[srt+1][3];
|
|
memTable[srt][4]=memTable[srt+1][4];
|
|
memTable[srt][5]=memTable[srt+1][5];
|
|
}
|
|
memTable[tableEntries-1][0]=-1;
|
|
memTable[tableEntries-1][1]=-1;
|
|
memTable[tableEntries-1][2]=-1;
|
|
memTable[tableEntries-1][3]=-1;
|
|
memTable[tableEntries-1][4]=-1;
|
|
memTable[tableEntries-1][5]=-1;
|
|
c--;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
s1=0;
|
|
for(int c1=0; c1<tableEntries; c1++)
|
|
{
|
|
if(memTable[c1][0]==-1)
|
|
{
|
|
s1++;
|
|
}
|
|
}
|
|
tableEntries=tableEntries-s1;
|
|
|
|
if(memTable[tableEntries-2][5]==0 && memTable[tableEntries-1][5]==-1)
|
|
{
|
|
memTable[tableEntries-2][3]=memTable[tableEntries-1][3];
|
|
memTable[tableEntries-2][4]=memTable[tableEntries-1][4]+memTable[tableEntries-2][4];
|
|
memTable[tableEntries-2][5]=-1;
|
|
tableEntries--;
|
|
}
|
|
}
|
|
|
|
//this method fills the memory location with the data
|
|
private void fillMemory(int job, int size, int start)
|
|
{
|
|
jobId=job;
|
|
jobSize=size;
|
|
startLoc=start;
|
|
|
|
synchronized(memory){
|
|
for(int fillCount=startLoc; fillCount<jobSize+startLoc; fillCount++)
|
|
{
|
|
memory[fillCount]=jobId;
|
|
}
|
|
}
|
|
}
|
|
|
|
//this method returns a String of all the elements stored in the object
|
|
public String toString()
|
|
{
|
|
String str;
|
|
str = ("\n\nJob ID\tJob Size\tStart Loc\tEnd Loc\tMem Blk Size\tStatus");
|
|
|
|
for(int cnt=0; cnt<tableEntries; cnt++)
|
|
{
|
|
str = (str+"\n"+memTable[cnt][0]+"\t"+memTable[cnt][1]+"\t\t"+memTable[cnt][2]+"\t\t"+
|
|
memTable[cnt][3]+"\t\t"+memTable[cnt][4]+"\t"+memTable[cnt][5]);
|
|
}
|
|
|
|
return str;
|
|
}
|
|
|
|
} |