<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Iranian Institute of Industrial Engineering</PublisherName>
				<JournalTitle>Journal of Industrial and Systems Engineering</JournalTitle>
				<Issn>1735-8272</Issn>
				<Volume>1</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2007</Year>
					<Month>11</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>260</FirstPage>
			<LastPage>280</LastPage>
			<ELocationID EIdType="pii">3933</ELocationID>
			
			
			<Language>EN</Language>
<AuthorList>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2006</Year>
					<Month>04</Month>
					<Day>10</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Approximation methods</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Earliest-deadline-first (EDF) policy</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Non-preemptive
services</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Queuing</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Real-time jobs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Two-class priority M/M/1 system</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://www.jise.ir/article_3933_298f587406c914fad5373bb689300433.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
