SIMULATION OF MESHES WITH SEPARABLE BUSES BY MESHES WITH MULTIPLE PARTITIONED BUSES

DOI10.1142/S0129054104002558MaRDI QIDQ3022013zbMATH OpenFDO

Authors Susumu Matsumae

Publication date 22 June 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

simulation algorithmreconfigurable meshmesh connected computerpartitioned busseparable bus

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Tight bounds on the simulation of meshes with dynamically reconfigurable row/column buses by meshes with statically partitioned buses
• Routing Problems on the Mesh of Buses
• Using bus linearization to scale the reconfigurable mesh
• scientific article; zbMATH DE number 19759
• Geometric approach for optimal routing on a mesh with buses

Cites work

• Tight bounds on the simulation of meshes with dynamically reconfigurable row/column buses by meshes with statically partitioned buses
• Using bus linearization to scale the reconfigurable mesh

Cited in

(2)

• Tight bounds on the simulation of meshes with dynamically reconfigurable row/column buses by meshes with statically partitioned buses
• Using bus linearization to scale the reconfigurable mesh

This page was built for publication: SIMULATION OF MESHES WITH SEPARABLE BUSES BY MESHES WITH MULTIPLE PARTITIONED BUSES

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