Finite-Source Queueing Systems and their Applications
Finite-Source Queueing Systems and their Applications
Finite-Source Queueing Systems and their Applications
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
János Sztrik 2001/08/05<br />
Static Priorities: The selection depends on priorities that are permanently<br />
assigned to the job. Within a class of jobs with the same priority, FCFS is<br />
used to select the next job to be processed.<br />
Dynamic Priorities: The selection depends on dynamic priorities that alter with<br />
the passing of time.<br />
Preemption: If priority or LCFS discipline is used, then the job currently being<br />
processed is interrupted <strong>and</strong> preempted if there is a job in the queue with a<br />
higher priority.<br />
As an example of Kendall’s notation, the expression<br />
M/G/1 – LCFS preemptive resume (PR)<br />
describes an elementary queueing system with exponentially distributed<br />
interarrival times, arbitrarily distributed service times, <strong>and</strong> a single server. The<br />
queueing discipline is LCFS where a newly arriving job interrupts the job<br />
currently being processed <strong>and</strong> replaces it in the server. The servicing of the<br />
<strong>Finite</strong>-<strong>Source</strong> <strong>Queueing</strong> <strong>Systems</strong> <strong>and</strong> <strong>their</strong> <strong>Applications</strong>
Change language