Paper Information

Journal:   JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)   FALL 2007 , Volume 1 , Number 3; Page(s) 260 To 280.
 
Paper: 

A NON-PREEMPTIVE TWO-CLASS M/M/1 SYSTEM WITH PRIORITIZED REAL-TIME JOBS UNDER EARLIEST-DEADLINE-FIRST POLICY

 
 
Author(s):  KARGAHI M.*, MOVAGHAR A.
 
* DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING, UNIVERSITY OF TEHRAN, TEHRAN, IRAN
 
Abstract: 

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be served from the time instant that no class-1 job is in the system. The service discipline of the class-2 jobs is FCFS. The required mean service times may depend on the class of the jobs. The real-time jobs have exponentially distributed relative deadlines until the end of service. The system is approximated by a Markovian model in the long run, which can be solved numerically using standard Markovian solution techniques. The performance measures of the system are the loss probability of the class-1 jobs and the mean sojourn (waiting) time of the class-2 jobs. Comparing the numerical and simulation results, we find that the existing errors are relatively small.

 
Keyword(s): APPROXIMATION METHODS, EARLIEST-DEADLINE-FIRST (EDF) POLICY, NON-PREEMPTIVE SERVICES, QUEUEING, REAL-TIME JOBS, TWO-CLASS PRIORITY M/M/1 SYSTEM
 
References: 
  • ندارد
 
  pdf-File tarjomyar Yearly Visit 54
 
Latest on Blog
Enter SID Blog