An approximate model of processor communication rings under heavy load

DOI10.1016/S0020-0190(97)00159-2zbMath1337.68046OpenAlexW2080094636MaRDI QIDQ287237

E. N. Gilbert, Edward G. jun. Coffman, Leopold Flatto, Albert G. Greenberg

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)00159-2

zbMATH Keywords

computational complexitycommunication ring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
• Queues served by a rotating ring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximate model of processor communication rings under heavy load