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

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KARGAHI M.; MOVAGHAR A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Industrial and Systems Engineering Year:2007 | Volume:1 | Issue:3 Page(s): 260-280

Download Full-Text

View:

251

Download:

116

Cites:

Information Journal Paper

Title

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. | Issue Writer Certificate

Keywords

APPROXIMATION METHODS

EARLIEST-DEADLINE-FIRST (EDF) POLICY

NON-PREEMPTIVE SERVICES

QUEUEING

REAL-TIME JOBS

TWO-CLASS PRIORITY M/M/1 SYSTEM

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.

Cites

No record.

References

No record.

Cite

APA: Copy

KARGAHI, M., & MOVAGHAR, A.. (2007). A NON-PREEMPTIVE TWO-CLASS M/M/1 SYSTEM WITH PRIORITIZED REAL-TIME JOBS UNDER EARLIEST-DEADLINE-FIRST POLICY. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), 1(3), 260-280. SID. https://sid.ir/paper/307070/en

Vancouver: Copy

KARGAHI M., MOVAGHAR A.. A NON-PREEMPTIVE TWO-CLASS M/M/1 SYSTEM WITH PRIORITIZED REAL-TIME JOBS UNDER EARLIEST-DEADLINE-FIRST POLICY. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)[Internet]. 2007;1(3):260-280. Available from: https://sid.ir/paper/307070/en

IEEE: Copy

M. KARGAHI, and A. MOVAGHAR, “A NON-PREEMPTIVE TWO-CLASS M/M/1 SYSTEM WITH PRIORITIZED REAL-TIME JOBS UNDER EARLIEST-DEADLINE-FIRST POLICY,” JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), vol. 1, no. 3, pp. 260–280, 2007, [Online]. Available: https://sid.ir/paper/307070/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops