My favorites
▼
|
Sign in
fifo-spt-rr
FIFO, SPT and RR for single queuing system
Project Home
Wiki
Issues
Source
Export to GitHub
READ-ONLY: This project has been
archived
. For more information see
this post
.
Search
Search within:
All issues
Open issues
New issues
Issues to verify
for
Advanced search
Search tips
Subscriptions
Issue
1
attachment: sim_priority.java
(13.9 KB)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
import java.util.Random;
import java.text.DecimalFormat;
public class sim_priority
{
// Class variables
public static double clock, meanInterArrivalTime, meanServiceTime, sigma, totalBusy, sumResponseTime, maxArival;
public static int totalCustomers, queueLength, maxQueueLength, numberOfDepartures, longService;
public static int cusIndex1,cusIndex2,i;
public static int priority[];
public static double cusService[];
public static double clockService[];
public static double cusArival[];
public static double cusInterArival[];
public static double cusWaiting[];
public static Random stream;
public static Random rand3; //random generator for priorities
public static void initialization()
{
clock = 0.0;
queueLength = 0;
totalBusy = 0;
maxQueueLength = 0;
sumResponseTime = 0;
numberOfDepartures = 0;
longService = 0;
cusIndex2 = 0;
// Create first arrival event
// Event evt = new Event(arrival, exponential(stream, meanInterArrivalTime));
}
public static double exponential(Random rng, double mean)
{
return -mean * Math.log(rng.nextDouble());
}
public static double SaveNormal;
public static int NumNormals = 0;
public static final double PI = 3.1415927;
public static double normal (Random rng,double mean, double sigma)
{
double ReturnNormal;
if(NumNormals==0)
{
double r1 = rng.nextDouble();
double r2 = rng.nextDouble();
ReturnNormal = Math.sqrt(-2*Math.log(r1))*Math.cos(2*PI*r2);
SaveNormal = Math.sqrt(-2*Math.log(r1))*Math.sin(2*PI*r2);
NumNormals = 1;
}
else
{
NumNormals = 0;
ReturnNormal = SaveNormal;
}
return ReturnNormal*sigma+mean;
}
public static void main(String argv[])
{
boolean loop_1 = true;
boolean condition1 = true;
boolean condition2 = false;
meanInterArrivalTime = 4.5;
meanServiceTime = 4.0;
sigma = 0.6;
totalCustomers = 500;
DecimalFormat df = new DecimalFormat("#.00");
long seed = 1232;
//long seed = Long.parseLong(argv[0]);
stream = new Random(seed);
rand3 = new Random();
//stream = new Random(stream.nextLong()); // initialize rng stream
//priority = 1+rand3.nextInt(5); //priority between 1 and number of Processes
initialization();
priority = new int[totalCustomers+1];
cusArival = new double[totalCustomers+1];
cusService = new double[totalCustomers+1];
clockService = new double[totalCustomers+1];
cusInterArival = new double[totalCustomers+1];
cusWaiting = new double[totalCustomers+1];
cusIndex1 = 1;
cusArival[cusIndex1] = 0.0;
maxArival = cusArival[cusIndex1];
cusService[cusIndex1] = normal(stream, meanServiceTime,sigma);
clockService[cusIndex1] = cusService[1];
cusWaiting[cusIndex1] = 0.0;
System.out.println("Customer "+cusIndex1+": Priority="+priority[cusIndex1]+", Interarrival Time="+cusInterArival[cusIndex1]+", Arrival Time="+cusArival[cusIndex1]+", Service Time="+cusService[cusIndex1]+", Waiting Time="+cusWaiting[cusIndex1]);
// Loop until "TotalCustomers" have departed
i = 2;
while(numberOfDepartures < totalCustomers)
{
if(loop_1 == false)
{
for(;i<=totalCustomers;i++)
{
clockService[cusIndex1] = clockService[cusIndex1-1] + cusService[cusIndex1];
if(clockService[cusIndex1] > cusArival[i])
{
queueLength++;
priority[i] = 1+rand3.nextInt(queueLength); //priority between 1 and length of queue
if(maxQueueLength < queueLength)
{
maxQueueLength = queueLength;
}
// Start sorting
if(queueLength >= 2)
{
int m,n,temp_p;
double temp_s,temp_a;
for(m = cusIndex1 + 1; m <= (cusIndex1 + 1 + queueLength-1); m++)
{
for(n = m; n <= (cusIndex1 + queueLength-1); n++)
{
if(priority[m] > priority[n+1])
{
temp_p = priority[m];
cusService[m] = priority[n+1];
priority[n+1] = temp_p;
temp_s = cusService[m];
cusService[m] = cusService[n+1];
cusService[n+1] = temp_s;
temp_a = cusArival[m];
cusArival[m] = cusArival[n+1];
cusArival[n+1] = temp_a;
}
}
}
}
// End sorting
if(i < totalCustomers)
{
cusInterArival[i+1] = exponential(stream, meanInterArrivalTime);
//cusArival[i] = cusArival[i-1] + cusInterArival[i];
cusArival[i+1] = maxArival + cusInterArival[i+1];
maxArival = cusArival[i+1];
cusService[i+1] = normal(stream, meanServiceTime,sigma);
}
if(i == totalCustomers)
{
break;
}
}
else
{
if(queueLength >= 1 && cusIndex1 > 1)
{
condition2 = true;
}
break;
}
}
}
if(loop_1 == true)
{
for(;i<=totalCustomers;i++)
{
cusInterArival[i] = exponential(stream, meanInterArrivalTime);
//cusArival[i] = cusArival[i-1] + cusInterArival[i];
cusArival[i] = maxArival + cusInterArival[i];
maxArival = cusArival[i];
cusService[i] = normal(stream, meanServiceTime,sigma);
if(clockService[cusIndex1] > cusArival[i])
{
queueLength++;
priority[i] = 1+rand3.nextInt(queueLength); //priority between 1 and length of queue
if(maxQueueLength < queueLength)
{
maxQueueLength = queueLength;
}
// Start sorting
if(queueLength >= 2)
{
int m,n,temp_p;
double temp_s,temp_a;
for(m = cusIndex1 + 1; m <= (cusIndex1 + 1 + queueLength-1); m++)
{
for(n = m; n <= (cusIndex1 + queueLength-1); n++)
{
if(priority[m] > priority[n+1])
{
temp_p = priority[m];
cusService[m] = priority[n+1];
priority[n+1] = temp_p;
temp_s = cusService[m];
cusService[m] = cusService[n+1];
cusService[n+1] = temp_s;
temp_a = cusArival[m];
cusArival[m] = cusArival[n+1];
cusArival[n+1] = temp_a;
}
}
}
}
if(i == totalCustomers)
{
condition1 = false;
break;
}
// End sorting
}
else
{
if(queueLength >= 1)
{
loop_1 = false;
if(cusIndex1 > 1)
{
condition2 = true;
}
}
break;
}
}
}
if(queueLength == 0 && i == totalCustomers)
{
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
numberOfDepartures++;
cusIndex1++;
clockService[cusIndex1] = cusArival[cusIndex1] + cusService[cusIndex1];
cusWaiting[cusIndex1] = clockService[cusIndex1] - cusService[cusIndex1] - cusArival[cusIndex1];
cusWaiting[cusIndex1] = clockService[cusIndex1] - cusService[cusIndex1] - cusArival[cusIndex1];
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
numberOfDepartures++;
}
if(i == totalCustomers && numberOfDepartures < totalCustomers && queueLength >= 1)
{
if(condition1 == true)
{
clockService[cusIndex1] = clockService[cusIndex1-1] + cusService[cusIndex1];
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
}
if(condition1 == false)
{
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
}
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
numberOfDepartures++;
cusIndex1++;
int p,q;
p = cusIndex1;
q = queueLength;
for(cusIndex1 = cusIndex1; cusIndex1 <= (p + q)-1; cusIndex1++)
{
clockService[cusIndex1] = clockService[cusIndex1-1] + cusService[cusIndex1];
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
numberOfDepartures++;
queueLength--;
if(cusIndex1 == totalCustomers)
{
break;
}
}
if(numberOfDepartures < totalCustomers)
{
clockService[cusIndex1] = cusArival[cusIndex1] + cusService[cusIndex1];
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
numberOfDepartures++;
}
}
if(numberOfDepartures < totalCustomers && i < totalCustomers)
{
if(queueLength == 0)
{
loop_1 = true;
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
i++;
cusIndex1++;
clockService[cusIndex1] = cusArival[cusIndex1] + cusService[cusIndex1];
}
if(queueLength >= 1 && cusIndex1 == 1)
{
clockService[cusIndex1] = clockService[cusIndex1-1] + cusService[cusIndex1];
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
queueLength--;
cusIndex1++;
}
if(queueLength >= 1 && cusIndex1 > 1 && condition2 == true)
{
cusWaiting[cusIndex1] = clockService[cusIndex1] - (cusService[cusIndex1] + cusArival[cusIndex1]);
System.out.println("Customer "+cusIndex1+": Interarrival Time="+df.format(cusInterArival[cusIndex1])+", Arrival Time="+df.format(cusArival[cusIndex1])+", Service Time="+df.format(cusService[cusIndex1])+", Waiting Time="+df.format(cusWaiting[cusIndex1]));
queueLength--;
cusIndex1++;
clockService[cusIndex1] = clockService[cusIndex1-1] + cusService[cusIndex1];
if(queueLength == 0)
{
condition2 = false;
}
}
numberOfDepartures++;
}
}
double totalWaiting = 0.0;
double totalTurnAround = 0.0;
for(cusIndex1 = 1; cusIndex1 <= totalCustomers; cusIndex1++)
{
totalWaiting = totalWaiting + cusWaiting[cusIndex1];
totalTurnAround = totalTurnAround + (cusWaiting[cusIndex1] + cusService[cusIndex1]);
}
System.out.println("Average Waiting Time = "+df.format(totalWaiting/totalCustomers));
System.out.println("Average Turnaround Time = "+df.format(totalTurnAround/totalCustomers));
System.out.println("maxQueueLength = "+maxQueueLength);
System.out.println("Total simulation time = "+df.format(clockService[totalCustomers]));
}
}
Powered by
Google Project Hosting