On the performance of networks with multiple busses

DOI10.1007/3-540-55210-3_176zbMATH Open1493.68028OpenAlexW1543049777MaRDI QIDQ5096774FDOQ5096774

Authors: Friedhelm Meyer auf der Heide, Hieu Thien Pham 

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_176

Recommendations

• Geometric approach for optimal routing on a mesh with buses
• Routing Problems on the Mesh of Buses
• Cost-performance tradeoffs for interconnection networks
• Sorting on PRAMs with reconfigurable buses
• Implementing shared memory on mesh-connected computers and on the fat-tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• The Complexity of Parallel Sorting
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallel sorting in two-dimensional VLSI models of computation

Cited In (4)

• Performance improvement of NCSs under complex network via concurrent paths
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometric approach for optimal routing on a mesh with buses

This page was built for publication: On the performance of networks with multiple busses

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