Please send code. And documentation in code to understand. THe slation boand the

Question

Please send code. And documentation in code to understand.

THe slation boand the train un either the s. Write a program to simut iob scheduling in an operating system. Jolbs are gemerated at random vienes Eada iob is given both a randm pority from I to 4 where l is the highest prierity-aod a raadom amsun od i ob is given s priority fro time to complete its exectition both a random Jobs do not begin execution and run to completion, but instead share the precessor. The oprating systen executes a job for a fixed unit of time called a time slice. Al the end of the time slice the current job's evc tion is suspended. The job is then placed in a priority queuc. where it tion is suspended. The job is then placod in a priority queuc, where it waits for its next shat of procesor ime The job having the highest priority is then removed from the priority queue and esccwted for a tme slice. When a job is first generated, it will begin esecuting immedianely if the processor is free Othervise i wil be placed in the priority queue.

Explanation / Answer

simulation of job is going to find either Shortest Remaining Time First ( SRTF ) or preemptive sjf cpu scheduling.

import java.io.*;
public class SRTF
{
public static void main(String args[]) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n;
System.out.println(" Enter the number of Processes required: ");
n = Integer.parseInt(br.readLine());
int a[][] = new int[n + 1][4];
for(int k = 1; k <= n; k++)
{
System.out.println("Enter the Arrival Time for Process " + k + ": ");
proc[k][0] = Integer.parseInt(br.readLine());
System.out.println(" Enter the Burst Time for Process " + k + ": ");
a[k][1] = Integer.parseInt(br.readLine());
}
System.out.println();


int total_time = 0;
for(int k = 1; k <= n; k++)
{
total_time += a[k][1];
}
int time_chart[] = new int[total_time];

for(int k = 0; k < total_time; k++)
{
  
int sel_a = 0;
int min = 99999;
for(int j = 1; j <= n; j++)
{
if(a[j][0] <= k)
{
if(a[j][1] < min && a[j][1] != 0)
{
min = a[j][1];
sel_a = j;
}
}
}
  
  
time_chart[k] = sel_a;
  

a[sel_a][1]--;
  

for(int j = 1; j <= n; j++)
{
if(a[j][0] <= k)
{
if(a[j][1] != 0)
{
a[j][3]++;

if(j != sel_a)
a[j][2]++;
}
else if(j == sel_a)
a[j][3]++;
}
}
  
  
if(k != 0)
{
if(sel_a != time_chart[k - 1])
  
{
System.out.print("--" + k + "--P" + sel_a);
}
}
else
System.out.print(k + "--P" + sel_a);
if(k == total_time - 1)
System.out.print("--" + (k + 1));
  
}
System.out.println();
System.out.println();

  
System.out.println("P WT TT ");
for(int k = 1; k <= n; k++)
{
System.out.printf("%d %2dms %2dms",k,a[k][2],a[k][3]);
System.out.println();
}

System.out.println();


float WT = 0,TT = 0;
for(int k = 1; k <= n;k++)
{
WT += a[k][2];
TT += a[k][3];
}
WT /= n;
TT /= n;
System.out.println("The Average WT is: " + WT + "ms");
System.out.println("The Average TT is: " + TT + "ms");
}
  
}

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.