Monday 28 October 2013

To create simulation of Queuing System in java

import java.util.*;
public class QueueingSystem
{
public static void main(String[] args)
{
int inter_arrival_time[]={0,2,4,1,2,6};
int service_time[]={2,1,3,2,1,4};
int i;
int arrival_time[]=new int[inter_arrival_time.length];
int service_start[]=new int[inter_arrival_time.length];
int service_end[]=new int[inter_arrival_time.length];
int idle[]=new int[inter_arrival_time.length];
int waiting[]=new int[inter_arrival_time.length];
float avgidle=0;
for(i=0;i<inter_arrival_time.length;i++)
{
System.out.println(" "+inter_arrival_time[i]);
for(int j=0;j<=i;j++)
arrival_time[i]=arrival_time[i]+inter_arrival_time[j];
}
System.out.println("Arrival time is ");
for(i=0;i<inter_arrival_time.length;i++)
System.out.println(arrival_time[i]);
service_start[0]=0;
for(i=0;i<inter_arrival_time.length;i++)
{
if(i==0)
{
service_end[0]=service_time[0]+arrival_time[0];
service_start[0]=arrival_time[0];
idle[0]=0;
waiting[0]=0;
}
else
{
if(service_end[i-1]==arrival_time[i])
{
service_start[i]=arrival_time[i];
service_end[i]=service_start[i]+service_time[i];
idle[i]=arrival_time[i]-service_end[i-1];
waiting[i]=service_end[i-1]-arrival_time[i];
}
else if(service_end[i-1]>arrival_time[i])
{
service_start[i]=service_end[i-1];
waiting[i]=service_end[i-1]-arrival_time[i];
idle[i]=0;
service_end[i]=service_time[i]+service_start[i];      
}
else if(service_end[i-1]<arrival_time[i])
{
service_start[i]=arrival_time[i];
idle[i]=arrival_time[i]-service_end[i-1];
avgidle+=idle[i];
service_end[i]=service_start[i]+service_time[i];
waiting[i]=0;
}
}
}
System.out.println("Service end time");
for(i=0;i<inter_arrival_time.length;i++)
System.out.println(service_end[i]);
System.out.println("Idle time");

for(i=0;i<inter_arrival_time.length;i++)
System.out.println(idle[i]);
System.out.println("Waiting time  time");

for(i=0;i<inter_arrival_time.length;i++)
System.out.println(waiting[i]);
System.out.println(avgidle/inter_arrival_time.length);
}
}

No comments:

Post a Comment