mirror-github-bspeice/itcs3146-project
1
0
Fork 0
mirror of https://github.com/bspeice/itcs3146-project synced 2024-12-22 06:38:23 -05:00
Code Issues Releases Wiki Activity

Revised to keep trying job until it loads

Browse Source
This commit is contained in:
dpturnbull 2012-11-09 20:30:52 -05:00
parent 7051efa9cb
commit a5abc7eeac
1 changed files with 4 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
FirstFit.java
View File

@ -15,11 +15,10 @@ class FirstFit implements baseAlgorithm
startLoc, startLoc,
endLoc, endLoc,
blkSize, blkSize,
memSize = DemoMemory.memory, memSize = memoryManagement.memory,
active, active,
noJobs=0, noJobs=0,
s1=0, s1=0,
chkCompress=0,
compMemTest=0, compMemTest=0,
tableEntries=1; tableEntries=1;
private int[] tempVal = new int[6]; private int[] tempVal = new int[6];
@ -38,7 +37,7 @@ class FirstFit implements baseAlgorithm
} }
//this method sets the job up need to modify the job class to return something //this method sets the job up
public void allocate(int ID, int size, int jTime) public void allocate(int ID, int size, int jTime)
{ {
jobId = ID; jobId = ID;
@ -77,7 +76,6 @@ class FirstFit implements baseAlgorithm
memTable[s1+1][3] = memSize-1; memTable[s1+1][3] = memSize-1;
memTable[s1+1][4] = memSize-memTable[s1+1][2]; memTable[s1+1][4] = memSize-memTable[s1+1][2];
memTable[s1+1][5] = -1; memTable[s1+1][5] = -1;
chkCompress=0;
tableEntries++; tableEntries++;
s1=memSize*2; s1=memSize*2;
} }
@ -99,7 +97,6 @@ class FirstFit implements baseAlgorithm
memTable[s1+1][4] = memSize-memTable[s1+1][2]; memTable[s1+1][4] = memSize-memTable[s1+1][2];
memTable[s1+1][5] = -1; memTable[s1+1][5] = -1;
tableEntries++; tableEntries++;
chkCompress=0;
s1=memSize*2; s1=memSize*2;
} }
} }
@ -110,7 +107,6 @@ class FirstFit implements baseAlgorithm
memTable[s1][1] = jobSize; memTable[s1][1] = jobSize;
memTable[s1][5] = 1; memTable[s1][5] = 1;
fillMemory(jobId, jobSize, memTable[s1][2]); fillMemory(jobId, jobSize, memTable[s1][2]);
chkCompress=0;
s1=memSize*2; s1=memSize*2;
} }
else else
@ -119,21 +115,12 @@ class FirstFit implements baseAlgorithm
} }
}while(s1<tableEntries); }while(s1<tableEntries);
//this section runs if the job will not fit after memory compaction
if(chkCompress==1)
{
chkCompress=0;
System.out.println("put job back in queue");
//need to return that this job needs to be returned to the queue
System.exit(0);
}
//if job will not fit this section will compress memory and try placing the job again //if job will not fit this section will compress memory and try placing the job again
if(s1==tableEntries && chkCompress==0) if(s1==tableEntries)
{ {
noJobs=noJobs-1; noJobs=noJobs-1;
compMem(); compMem();
chkCompress++;
allocate(ID, size, jobTime); allocate(ID, size, jobTime);
} }
} }