Performance bounds for modeling NUMA architectures
From MaRDI portal
Publication:287149
DOI10.1016/S0020-0190(97)00106-3zbMath1337.68024OpenAlexW2045233356MaRDI QIDQ287149
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00106-3
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)
Cites Work
- Unnamed Item
- Unnamed Item
- Probability and Statistics with Reliability, Queuing and Computer Science Applications
- An Approximate Analytical Method for General Queueing Networks
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Approximate Analysis of General Queuing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Correlational and distributional effects in network traffic models
- A conservation law for a wide class of queueing disciplines
This page was built for publication: Performance bounds for modeling NUMA architectures