pri.c

排队论中的一个仿真程序

#include "smpl.h"

extern smpl(int m,char * s);
extern facility(char *s,int n);
extern request(int f,int tkn,int pri);
extern cause(int *ev,int *tkn);
extern schedule(int ev,real te,int tkn);
extern release(int f,int tkn);
extern report();
extern real expntl(real x);


/*main ()
{
	 float Ta1=3.125, Ta2=0.78125, Ts=0.125, te=2000000.0;
	 int customer, customer1=1, customer2=2, event,server;
	 smpl(1, "Non-Preemptive with PRI Queue");
	 server=facility("server", 1);
	 schedule(1, expntl(Ta1), customer1);
	 schedule(1, expntl(Ta2), customer2);
	 while (time()<te)
	   {
		 cause(&event, &customer);
		 switch(event)
		 {
			  case 1:
				  schedule(2, 0.0, customer);
				  if (customer==customer1)
				  {
					  schedule(1, expntl(Ta1), customer);
				  }
				  else
				  {
					  schedule(1, expntl(Ta2), customer);
				  }
				  break;
			  case 2:
				  if (customer==customer1)
				  {
					  if (request(server, customer, 0)==0)
					  {
						  schedule(3, Ts, customer);
					  }
				  }
				  else
				  {
					  if (request(server, customer, 1)==0)
					  {
						  schedule(3, Ts, customer);
					  }
				  }
				  break;
			  case 3:
				  release(server, customer);
				  break;
			  default:
				  break;
		  }
	 }
	report();        
}*/