mirror-github-bspeice/itcs3146-project
1
0
Fork 0
mirror of https://github.com/bspeice/itcs3146-project synced 2025-11-03 18:10:29 -05:00
Code Issues Releases Wiki Activity

Add synchronization to dpturnbull's code

Browse Source
This commit is contained in:
Bradlee Speice
2012-11-17 11:37:33 -05:00
parent afc1ffcf54
commit e6e1a8b634
2 changed files with 11 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
FirstFit.java
View File

@ -275,9 +275,11 @@ class FirstFit implements baseAlgorithm
jobSize=size;
startLoc=start;
for(int fillCount=startLoc; fillCount<jobSize+startLoc; fillCount++)
{
memory[fillCount]=jobId;
synchronized(memory){
for(int fillCount=startLoc; fillCount<jobSize+startLoc; fillCount++)
{
memory[fillCount]=jobId;
}
}
}

11
NextFit.java
View File

@ -62,7 +62,7 @@ class NextFit implements baseAlgorithm
if(jobSize>memSize)
{
System.out.println("\n\n*********************************************************"+
" THIS JOB IS TO LARGE TO FIT INTO MEMORY"+
" THIS JOB IS TOO LARGE TO FIT INTO MEMORY"+
"*********************************************************");
System.exit(0);
}
@ -293,10 +293,11 @@ class NextFit implements baseAlgorithm
jobId=job;
jobSize=size;
startLoc=start;
for(int fillCount=startLoc; fillCount<jobSize+startLoc; fillCount++)
{
memory[fillCount]=jobId;
synchronized(memory){
for(int fillCount=startLoc; fillCount<jobSize+startLoc; fillCount++)
{
memory[fillCount]=jobId;
}
}
}