Waiting time dynamics of priority-queue networks

Byungjoon Min, Kwang-Il Goh, I. M. Kim

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

We study the dynamics of priority-queue networks, generalizations of the binary interacting priority-queue model introduced by Oliveira and Vazquez [Physica A 388, 187 (2009)]. We found that the original AND-type protocol for interacting tasks is not scalable for the queue networks with loops because the dynamics becomes frozen due to the priority conflicts. We then consider a scalable interaction protocol, an OR-type one, and examine the effects of the network topology and the number of queues on the waiting time distributions of the priority-queue networks, finding that they exhibit power-law tails in all cases considered, yet with model-dependent power-law exponents. We also show that the synchronicity in task executions, giving rise to priority conflicts in the priority-queue networks, is a relevant factor in the queue dynamics that can change the power-law exponent of the waiting time distribution.

Original languageEnglish
Article number056110
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume79
Issue number5
DOIs
Publication statusPublished - 2009 May 21

Fingerprint

Priority Queue
Waiting Time
Queue
Waiting Time Distribution
Power Law
Exponent
Interaction Protocols
Network Topology
exponents
Tail
Binary
Dependent
topology
Model
Conflict

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Statistics and Probability

Cite this

Waiting time dynamics of priority-queue networks. / Min, Byungjoon; Goh, Kwang-Il; Kim, I. M.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 79, No. 5, 056110, 21.05.2009.

Research output: Contribution to journalArticle

@article{0189ea92c24444f69b3ccc7ab78722b1,
title = "Waiting time dynamics of priority-queue networks",
abstract = "We study the dynamics of priority-queue networks, generalizations of the binary interacting priority-queue model introduced by Oliveira and Vazquez [Physica A 388, 187 (2009)]. We found that the original AND-type protocol for interacting tasks is not scalable for the queue networks with loops because the dynamics becomes frozen due to the priority conflicts. We then consider a scalable interaction protocol, an OR-type one, and examine the effects of the network topology and the number of queues on the waiting time distributions of the priority-queue networks, finding that they exhibit power-law tails in all cases considered, yet with model-dependent power-law exponents. We also show that the synchronicity in task executions, giving rise to priority conflicts in the priority-queue networks, is a relevant factor in the queue dynamics that can change the power-law exponent of the waiting time distribution.",
author = "Byungjoon Min and Kwang-Il Goh and Kim, {I. M.}",
year = "2009",
month = "5",
day = "21",
doi = "10.1103/PhysRevE.79.056110",
language = "English",
volume = "79",
journal = "Physical Review E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "5",

}

TY - JOUR

T1 - Waiting time dynamics of priority-queue networks

AU - Min, Byungjoon

AU - Goh, Kwang-Il

AU - Kim, I. M.

PY - 2009/5/21

Y1 - 2009/5/21

N2 - We study the dynamics of priority-queue networks, generalizations of the binary interacting priority-queue model introduced by Oliveira and Vazquez [Physica A 388, 187 (2009)]. We found that the original AND-type protocol for interacting tasks is not scalable for the queue networks with loops because the dynamics becomes frozen due to the priority conflicts. We then consider a scalable interaction protocol, an OR-type one, and examine the effects of the network topology and the number of queues on the waiting time distributions of the priority-queue networks, finding that they exhibit power-law tails in all cases considered, yet with model-dependent power-law exponents. We also show that the synchronicity in task executions, giving rise to priority conflicts in the priority-queue networks, is a relevant factor in the queue dynamics that can change the power-law exponent of the waiting time distribution.

AB - We study the dynamics of priority-queue networks, generalizations of the binary interacting priority-queue model introduced by Oliveira and Vazquez [Physica A 388, 187 (2009)]. We found that the original AND-type protocol for interacting tasks is not scalable for the queue networks with loops because the dynamics becomes frozen due to the priority conflicts. We then consider a scalable interaction protocol, an OR-type one, and examine the effects of the network topology and the number of queues on the waiting time distributions of the priority-queue networks, finding that they exhibit power-law tails in all cases considered, yet with model-dependent power-law exponents. We also show that the synchronicity in task executions, giving rise to priority conflicts in the priority-queue networks, is a relevant factor in the queue dynamics that can change the power-law exponent of the waiting time distribution.

UR - http://www.scopus.com/inward/record.url?scp=67549093134&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67549093134&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.79.056110

DO - 10.1103/PhysRevE.79.056110

M3 - Article

VL - 79

JO - Physical Review E

JF - Physical Review E

SN - 2470-0045

IS - 5

M1 - 056110

ER -