Complexity of Sub-Bus Mesh Computations

DOI10.1137/S0097539793256879MaRDI QIDQ4887016zbMATH OpenFDO

Authors Anne Condon, Jordan Lampe, Richard E. Ladner, Rakesh Kumar Sinha

Publication date 23 July 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

sub-bus mesh parallel computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1760013
• Solving tree problems on a mesh-connected processor array
• Routing Problems on the Mesh of Buses
• scientific article; zbMATH DE number 4085015
• Geometric approach for optimal routing on a mesh with buses

Cited in

(5)

• Leftmost one computation on meshes with row broadcasting
• A parametric algorithm for semigroup computation on mesh with buses
• FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
• scientific article; zbMATH DE number 1760013 (Why is no real title available?)
• Using fewer processors to reduce time complexities of semigroup computations

This page was built for publication: Complexity of Sub-Bus Mesh Computations

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