Queues served in cyclic order with an arbitrary start‐up distribution

S. W. Fuhrmann and A. Moon

Naval Research Logistics (NRL), 1990, vol. 37, issue 1, 123-133

Abstract: This article considers a system of queues served in cyclic order by a single server. Each time the system becomes empty, it is restarted with a random initial population. The motivation for considering this problem came from the performance analysis study of a microprocessor‐based system charged with executing several different types of tasks. The processor executes these tasks in cyclic order, but when all such tasks are completed, the processor becomes unavailable for a period of time while it does lower‐priority (background) work. Thus, when the server returns to work on the higher‐priority tasks a random population of these tasks have accumulated.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199002)37:13.0.CO;2-N

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:37:y:1990:i:1:p:123-133

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().