Computing the Optimal Longest Queue Length in Torus Networks

DOI10.1007/978-3-030-90425-8_1MaRDI QIDQ6488368zbMATH OpenFDO

Authors Burkhard Englert, Oscar Morales-Ponce

Publication date 13 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90425-8_1

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On queuing lengths in on-line switching
• Tight bounds for the performance of Longest In System on DAGs
• Scheduling independent jobs for torus connected networks with/without link contention.
• Randomized scheduling algorithm for queueing networks
• Distributed Online and Stochastic Queueing on a Multiple Access Channel

Cites work

• Cluster-based topologies for 3D Networks-on-Chip using advanced inter-layer bus architecture
• Traffic-light scheduling on the grid

Cited in

(1)

• Longest path analysis in networks of queues: dynamic scheduling problems

This page was built for publication: Computing the Optimal Longest Queue Length in Torus Networks

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