About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
8th International Conference on Performance Evaluation Methodologies and Tools

Research Article

On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue

Download1163 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/icst.valuetools.2014.258212,
        author={Manu Gupta and Nandyala Hemachandra and Jayendran Venkateswaran},
        title={On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue},
        proceedings={8th International Conference on Performance Evaluation Methodologies and Tools},
        publisher={EAI},
        proceedings_a={VALUETOOLS},
        year={2015},
        month={2},
        keywords={parametrized dynamic priority optimal control multi-class queue achievable region},
        doi={10.4108/icst.valuetools.2014.258212}
    }
    
  • Manu Gupta
    Nandyala Hemachandra
    Jayendran Venkateswaran
    Year: 2015
    On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
    VALUETOOLS
    ICST
    DOI: 10.4108/icst.valuetools.2014.258212
Manu Gupta1,*, Nandyala Hemachandra1, Jayendran Venkateswaran1
  • 1: IIT Bombay
*Contact email: manu.gupta@iitb.ac.in

Abstract

This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between these queue disciplines is established. Motivation behind the mean completeness and equivalence results is discussed from optimal control perspective. Notion of minmax fairness is introduced and it is argued that a simple global FCFS policy is the only solution for minmax fairness problem in two class by exploiting completeness in the structure of EDD based dynamic priority. Further, these completeness results are used to propose a simpler way for developing optimal control policy in celebrated c/ρ rule for two class M/G/1 queues.

Keywords
parametrized dynamic priority optimal control multi-class queue achievable region
Published
2015-02-19
Publisher
EAI
Appears in
ACM Digital Library
http://dx.doi.org/10.4108/icst.valuetools.2014.258212
Copyright © 2014–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL