Constant time graph algorithms on the reconfigurable multiple bus machine

DOI10.1006/JPDC.1997.1385MaRDI QIDQ1384518zbMATH OpenOpenAlexFDO

Authors Jerry L. Trahan, Ramachandran Vaidyanathan, Chittur P. Subbaraman

Publication date 13 April 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1997.1385

zbMATH Keywords

reconfigurable multiple bus machine

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• SIMULATING AN R-MESH ON AN LR-MESH IN CONSTANT TIME
• Efficient minimum spanning tree algorithms on the reconfigurable mesh
• A constant-time channel-assignment algorithm on reconfigurable meshes
• scientific article; zbMATH DE number 1779563

Cited in

(4)

• A constant-time channel-assignment algorithm on reconfigurable meshes
• EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL
• Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system
• Relating the power of the multiple associative computing (MASC) model to that of reconfigurable bus-based models

This page was built for publication: Constant time graph algorithms on the reconfigurable multiple bus machine

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