A parallel priority queueing system with finite buffers
DOI10.1016/J.JPDC.2005.10.003zbMATH Open1154.60349OpenAlexW1981729833MaRDI QIDQ2369686FDOQ2369686
Authors: Aliakbar Montazer Haghighi, Dimitar P. Mishev
Publication date: 22 May 2006
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.10.003
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (11)
- A parallel priority queue with constant time operations
- Analysis of a finite buffer with non-preemptive priority scheduling
- On a synchronization queue with two finite buffers
- A model of task-deletion mechanism based on the priority queueing system of Barabási
- Priority queues on parallel machines
- Analysis of \(M^{[X_{1}]}\), \(M^{[X_{2}]}/G_1\), \(G_2/1\) retrial queueing system with priority services, working breakdown, collision, Bernoulli vacation, immediate feedback, starting failure and repair
- Optimizing a priority-discipline queueing model using fuzzy set theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A token based parallel processing queueing system with priority
This page was built for publication: A parallel priority queueing system with finite buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369686)