An approximate model of processor communication rings under heavy load

DOI10.1016/S0020-0190(97)00159-2MaRDI QIDQ287237zbMATH OpenOpenAlexFDO

Authors E. N. Gilbert, E. G. jun. Coffman, L. Flatto, A. 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)

Recommendations

• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
• scientific article; zbMATH DE number 5141476
• Queues served by a rotating ring
• scientific article; zbMATH DE number 610381
• Packet Transmission in a Noisy-Channel Ring Network

Cites work

• scientific article; zbMATH DE number 3176450 (Why is no real title available?)
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3194856 (Why is no real title available?)
• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
• Queues served by a rotating ring

Cited in

(1)

• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times

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

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