Add files via upload

Author: yaraalt

CPU.java

@@ -0,0 +1,86 @@
+
+
+import java.util.Queue;
+
+public class CPU 
+{ public static boolean available;
+public static int countNormally;
+public static int countAbNormally;
+public static OS os;
+
+
+	public static void main(String[] args) 
+	{  available = true;
+
+	os = new OS();
+	Queue<PCB> ready = os.CPUScheduler();
+
+	// CPU Scheduler
+	while(ready.size() > 0) 
+	{ PCB p = null;
+	available = true;
+
+	if(available) 
+	{ available = false;
+	System.out.println("\t-- Dispatching Process --\n");
+	
+	p = ready.poll();
+	p.run();
+	
+    while(trackProcess(p)) 
+	if(!trackProcess(p)) 
+	{ os.ramSize += p.jobSize;
+	break; } } 
+			
+	if(os.ramSize > os.min && os.jobs.size() > 0) 
+	{ System.out.println("\t-- Avilable memory in RAM: CPUScheduler is called -- \n");
+	os.CPUScheduler(); } }
+	
+	// Simulation finished
+
+	
+	// For output file    
+	os.generateOutput(countNormally, countAbNormally); } 
+	
+	
+	
+	// This method will return false if process is terminated
+	public static boolean trackProcess(PCB p) 
+	{ p.cut++;
+	int num = (int)(Math.random()*100);
+		
+	if(p.cut > p.ecu) 
+	{ termination(p, false);
+	return false; }
+	
+	else 
+	if(num <= 10) 
+	{ termination(p, true);
+	return false; } 
+	
+	else 
+	if( num <= 15) 
+	{ termination(p, false);
+	return false;  }
+	
+	return true; }
+
+	
+	
+	public static void termination(PCB p, boolean normal) 
+	{ p.terminate();
+	available = true;
+
+	os.ramSize += p.jobSize;
+
+	System.out.printf("Process Termination \nPID: %d     CUT: %d     Size: %d KB     ", p.pid, p.cut, p.jobSize);
+
+	if(normal) 
+	{ countNormally++;
+	System.out.println("Normal termination. \n"); } 
+	
+	else 
+	{ countAbNormally++;
+	System.out.println("Abnormal termination. \n"); } } }
+
+

Input.java

@@ -0,0 +1,90 @@
+
+
+import java.io.File;
+import java.io.FileOutputStream;
+import java.io.PrintWriter;
+import java.util.Scanner;
+import java.util.Queue;
+import java.util.LinkedList;
+
+public class Input 
+{ public Queue<Job> jobs;	
+public int count;	
+int min;
+int max;
+int total;
+int n; // number of jobs
+
+	public Input() 
+	{ jobs= new LinkedList<Job>();
+	count= 0; 
+	min= 256;
+	max= 0;
+	total= 0;
+	n= (int)((Math.random()*(500 - 100) + 100)); }
+
+	
+	
+	public Job generateJob() 
+	{ int id= count++;
+	int ecu= (int)((Math.random()*(512 - 16) + 16));
+	int jobSize= (int)((Math.random()*(256 - 16) + 16));
+
+	if(jobSize < min)
+	min= jobSize;
+
+	if(max < jobSize)
+	max= jobSize;
+
+	total += jobSize;
+	Job obj= new Job(id, ecu, jobSize);
+	return obj;  }
+
+
+
+	public void generateInput() 
+	{ File f= new File("Jobs.txt");
+	FileOutputStream fOut;
+	PrintWriter writer;
+	
+	try 
+	{ fOut = new FileOutputStream(f);
+	writer= new PrintWriter(fOut);  
+
+	Job obj= null;
+	for(int i= 0; i < n; i++) 
+	{ obj= generateJob();
+	writer.println(obj.jID + "\t" + obj.ECU + "\t" + obj.jobSize + "\n");  }
+
+	writer.close();
+	fOut.close(); } 
+	catch (Exception e) 
+	{ e.getMessage(); } } 
+
+
+
+	public void fillJQueue() 
+	{ File f= new File("Jobs.txt");
+	Scanner input;
+	
+	try 
+	{ input= new Scanner(f);
+
+	Job obj;
+	int id;
+	int ecu;
+	int size;
+	while(input.hasNext()) 
+	{ id= input.nextInt();
+	ecu= input.nextInt();
+	size= input.nextInt();
+	obj= new Job(id, ecu, size);
+
+	jobs.add(obj); } 
+
+	input.close(); } 
+	catch (Exception e) 
+	{ e.getMessage(); } } }
+
+
+

Job.java

@@ -0,0 +1,18 @@
+
+
+
+public class Job
+{ public int jID;
+public int jobSize;
+public int ECU; 
+
+
+	public Job(int id, int ecu, int size)
+	{ jID= id;
+	ECU= ecu;
+	jobSize= size; } 
+
+
+	public String toString()
+	{ String str= jID + " " + ECU;
+	return str; } }

JobComparator.java

@@ -0,0 +1,9 @@
+
+
+import java.util.Comparator;
+
+public class JobComparator implements  Comparator<Job> 
+{	
+	public int compare(Job a, Job b) 
+	{ return a.jobSize - b.jobSize; }
+}