[go: up one dir, main page]
Scribd
Upload
47 views2 pages

SJF

This Java code implements the shortest job first (SJF) CPU scheduling algorithm. It takes user input for the number of processes, their arrival times and burst times. It then calculates each process' completion time, turnaround time, and waiting time. Finally it outputs summaries including the average wait time and average turnaround time.

Uploaded by

asdfgah182
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
47 views2 pages

SJF

This Java code implements the shortest job first (SJF) CPU scheduling algorithm. It takes user input for the number of processes, their arrival times and burst times. It then calculates each process' completion time, turnaround time, and waiting time. Finally it outputs summaries including the average wait time and average turnaround time.

Uploaded by

asdfgah182
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

import java.util.

Scanner;

public class SJF {


public static void main(String args[])
{
Scanner sn=new Scanner(System.in);

System.out.print("Enter Number of process You Want");


int n=sn.nextInt();

int process[]=new int[n];


int arrival[]=new int[n];
int brust[]=new int[n];
int completion[]=new int[n];
int TAT[]=new int[n];
int WT[]=new int[n];

int oribrust[]=new int[n];


int flag[]=new int[n];

for(int i=0;i<n;i++)
{
System.out.print("Enter Process "+(i+1)+" Arrival Time :");
arrival[i]=sn.nextInt();

System.out.print("Enter Process "+(i+1)+" Brust Time :");


brust[i]=sn.nextInt();

oribrust[i]=brust[i];

flag[i]=0;
process[i]=i+1;
}
int tot=0;
int st=0;

while(true)
{
int max=99,c=n;
if(tot==n)
{
break;
}

for(int i=0;i<n;i++)
{
if(arrival[i]<=st && flag[i]==0 && brust[i]<max)
{
max=brust[i];
c=i;
}

if(c==n)
{
st++;
}
else
{
brust[c]--;
st++;
if(brust[c]==0)
{
tot++;
completion[c]=st;
flag[c]=1;
}
}
}
float total=0,wait=0;

System.out.print("\nProcess\t\tArrival\t\tBrust\tCompletion\t\tWT\
tTAT");
for(int i=0;i<n;i++)
{
TAT[i]=completion[i]-arrival[i];
total=total+TAT[i];

WT[i]=TAT[i]-oribrust[i];
wait=wait+WT[i];

System.out.print("\n"+process[i]+"\t\t"+arrival[i]+"\t\
t"+oribrust[i]+"\t\t"+completion[i]+"\t\t"+WT[i]+"\t\t"+TAT[i]);
}

System.out.print("\n\nAverge Wait Time :"+(wait/n));


System.out.print("\nAverge Turn Around Time :"+(total/n));
}
}

You might also like