From e6e1a8b634377a8e7b11490368a290b61ec0656d Mon Sep 17 00:00:00 2001
From: Bradlee Speice <bspeice@BSPEICE-XUBUNTU.(none)>
Date: Sat, 17 Nov 2012 11:37:33 -0500
Subject: [PATCH] Add synchronization to dpturnbull's code

---
 FirstFit.java |  8 +++++---
 NextFit.java  | 11 ++++++-----
 2 files changed, 11 insertions(+), 8 deletions(-)

diff --git a/FirstFit.java b/FirstFit.java
index de0e91f..1b367a0 100644
--- a/FirstFit.java
+++ b/FirstFit.java
@@ -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;
+			}
 		}
 	}
 
diff --git a/NextFit.java b/NextFit.java
index 8bfbad8..ff66536 100644
--- a/NextFit.java
+++ b/NextFit.java
@@ -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;
+			}
 		}
 	}