mirror of
https://github.com/bspeice/itcs3146-project
synced 2024-11-12 11:08:43 -05:00
15efb51e4d
Fixed minor bug
79 lines
2.5 KiB
Java
79 lines
2.5 KiB
Java
/*Memory Management Program
|
|
* Used to test the algorithm and print out results.
|
|
*/
|
|
|
|
import java.io.File;
|
|
import java.util.Random;
|
|
import java.util.Scanner;
|
|
import java.util.StringTokenizer;
|
|
|
|
public class memoryManagement{
|
|
public static void main(String args[])throws Exception{
|
|
final int JOBAMOUNT = 1000;
|
|
final int MEMORYSIZE = 10000;
|
|
|
|
File file = new File("null");
|
|
Scanner keyboard = new Scanner(System.in);
|
|
Scanner fileScan;
|
|
StringTokenizer token;
|
|
Random rand = new Random();
|
|
|
|
String read = null;
|
|
int jobLength = 0;
|
|
long timeStart, timeEnd;
|
|
|
|
//*Job Info*
|
|
int[] id = new int[JOBAMOUNT];
|
|
int[] size = new int[JOBAMOUNT];
|
|
int[] time = new int[JOBAMOUNT];
|
|
|
|
//******Add your algorithm class here******//
|
|
baseAlgorithm alg = new dummyAlgorithm(MEMORYSIZE);
|
|
|
|
//Gets a file name, else creates five random jobs
|
|
do{
|
|
System.out.println("Type filename to load jobs from a file or just press enter for random jobs");
|
|
read = keyboard.nextLine();
|
|
file = new File(read + ".txt");
|
|
if(!read.equals("") && !file.exists())
|
|
System.out.println("File not found, try again");
|
|
}while(!read.equals("") && !file.exists());
|
|
|
|
//Create random jobs or read from the file and create jobs
|
|
if(read.equals("")){
|
|
System.out.print("Creating "+JOBAMOUNT+" random jobs...");
|
|
jobLength = JOBAMOUNT;
|
|
for(int i = 0; i < jobLength; i++){
|
|
id[i] = i+1;
|
|
size[i] = rand.nextInt(1000)+1;
|
|
time[i] = rand.nextInt(1000)+1;
|
|
}
|
|
System.out.println("complete");
|
|
}
|
|
else{
|
|
System.out.print("File found, reading file...");
|
|
fileScan = new Scanner(file);
|
|
for(jobLength = 0; fileScan.hasNextLine() ; jobLength++){
|
|
token = new StringTokenizer(fileScan.nextLine(),",");
|
|
id[jobLength] = jobLength+1;
|
|
size[jobLength] = Integer.parseInt(token.nextToken());
|
|
time[jobLength] = Integer.parseInt(token.nextToken());
|
|
}
|
|
fileScan.close();
|
|
System.out.println("complete");
|
|
System.out.println(jobLength+" jobs found on file");
|
|
}
|
|
|
|
//Send jobs to algorithm, time is calculated and printed out after completion
|
|
System.out.print("Sending jobs to algorithm...");
|
|
timeStart = System.currentTimeMillis();
|
|
for(int i = 0; i < jobLength; i++){
|
|
alg.allocate(id[i], size[i], time[i]);
|
|
}
|
|
timeEnd = System.currentTimeMillis() - timeStart;
|
|
System.out.println("complete");
|
|
System.out.println("Elapsed time for algorithm to complete "+ jobLength+" jobs is "+timeEnd+" milliseconds");
|
|
|
|
System.out.println("Completed Successfully");
|
|
}
|
|
} |