Mesh-Connected Computers with Broadcasting

DOI10.1109/TC.1983.1676331MaRDI QIDQ3038622zbMATH OpenOpenAlexFDO

Authors Q. F. Stout

Publication date 1983

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1983.1676331

zbMATH Keywords

broadcastinggrid graphsmesh-connected computersparallel computingsemigroup computationssorting

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(12)

• Geometric approach for optimal routing on a mesh with buses
• Algorithms for the parallel alternating direction access machine
• Domination numbers of undirected toroidal mesh
• Using fewer processors to reduce time complexities of semigroup computations
• Reconfigurable meshes and image processing
• A parametric algorithm for semigroup computation on mesh with buses
• A lower bound for permutation routing on two-dimensional bused meshes
• SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗
• Parallel computation of discrete Voronoi diagrams (extended abstract)
• An efficient algorithm for the Knight's tour problem
• Leftmost one computation on meshes with row broadcasting
• Constant time sorting on a processor array with a reconfigurable bus system

This page was built for publication: Mesh-Connected Computers with Broadcasting

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