A Token Based Parallel Processing Queueing System with Priority
From MaRDI portal
Publication:3305448
DOI10.1007/978-3-319-66836-9_19zbMath1452.68030OpenAlexW2751123478MaRDI QIDQ3305448
V. C. Joshua, A. Krishnamoorthy, Dhanya Babu
Publication date: 7 August 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-66836-9_19
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
A queueing system with probabilistic joining strategy for priority customers ⋮ A Two-Stage Tandem Queue with Specialist Servers
Cites Work
- Unnamed Item
- Two parallel finite queues with simultaneous services and Markovian arrivals
- Queues with postponed work
- Two \(M\)/\(M\)/1 queues with transfers of customers
- Priority queues
- Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- A finite buffer queue with priorities
- On a single server queue with negative arrivals and request repeated
This page was built for publication: A Token Based Parallel Processing Queueing System with Priority