Performance bounds for modeling NUMA architectures

DOI10.1016/S0020-0190(97)00106-3zbMATH Open1337.68024OpenAlexW2045233356MaRDI QIDQ287149FDOQ287149

Authors: Robert Geist 

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

Recommendations

• Single-class bounds of multi-class queuing networks
• MVAMIN: Mean value analysis algorithms for multistage interconnection networks
• Asymptotic analysis of a nonuniform queueing network model of multiprocessor and multiterminal systems
• Throughput bounds for closed queueing networks
• Two classes of performance bounds for closed queueing networks

zbMATH Keywords

performance evaluationErlang distributionNUMA architecturesqueuing networksthroughput monotonicity

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)

Cites Work

• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Probability and statistics with reliability, queuing, and computer science applications
• An Approximate Analytical Method for General Queueing Networks
• Title not available (Why is that?)
• Mean-Value Analysis of Closed Multichain Queuing Networks
• Title not available (Why is that?)
• Approximate Analysis of General Queuing Networks
• Correlational and distributional effects in network traffic models
• A conservation law for a wide class of queueing disciplines

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Performance bounds for modeling NUMA architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287149)