Dynamics of priority-queue networks

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this Work-in-Progress paper, we study the dynamics of priority-queue networks by generalizing the interacting priority queue model of Oliveira and Vazquez [Physica A 388, 187 (2009)]. We show that the original AND-type protocol for interacting tasks is not scalable for the queue networks with more than two queues. We then introduce a scalable interaction protocol, an OR-type one, and examine the effects of the number of queues and the network topology on the waiting time dynamics of the priority-queue networks. We also study the effect of synchronicity in task executions to the waiting time dynamics in the priority-queue networks. © 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Min, B. J., Goh, K. I., & Kim, I. M. (2009). Dynamics of priority-queue networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 5 LNICST, pp. 2229–2231). https://doi.org/10.1007/978-3-642-02469-6_99

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free