Waiting time dynamics of priority-queue networks
- Authors
- Min, Byungjoon; Goh, K. -I.; Kim, I. -M.
- Issue Date
- 5월-2009
- Publisher
- AMER PHYSICAL SOC
- Keywords
- protocols; queueing theory; task analysis
- Citation
- PHYSICAL REVIEW E, v.79, no.5
- Indexed
- SCIE
SCOPUS
- Journal Title
- PHYSICAL REVIEW E
- Volume
- 79
- Number
- 5
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/120152
- DOI
- 10.1103/PhysRevE.79.056110
- ISSN
- 1539-3755
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Physics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.