Biased Processor Sharing in Fork-Join Queues
From MaRDI portal
Publication:6104814
DOI10.1007/978-3-319-99154-2_17zbMath1514.68021OpenAlexW2885879993MaRDI QIDQ6104814
Andrea Marin, Sabina Rossi, Unnamed Author
Publication date: 28 June 2023
Published in: Quantitative Evaluation of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-99154-2_17
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Controlling variability in split-merge systems and its impact on performance
- Stochastic bounds in Fork-Join queueing systems under full and partial mapping
- On the relations between Markov chain lumpability and reversibility
- A survey on discriminatory processor sharing
- Two Parallel Queues Created by Arrivals with Two Demands I
- On the execution of parallel programs on multiprocessor systems—a queuing theory approach
- Acyclic fork-join queuing networks
- Two parallel processors with coupled inputs
- Insensitivity in processor-sharing networks
- Time-shared Systems
This page was built for publication: Biased Processor Sharing in Fork-Join Queues
