Mesh-Connected Computers with Broadcasting

DOI10.1109/TC.1983.1676331zbMath0525.68030OpenAlexW2034085201MaRDI QIDQ3038622

Quentin 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

sortingparallel computinggrid graphsbroadcastingmesh-connected computerssemigroup computations

Mathematics Subject Classification ID

Related Items (12)

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

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