On the public citation graph

Optimal architectures and algorithms for mesh-connected parallel computers with separable row/column buses

0 signed · 58 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/ecjc.4430730605openalex-snapshot
Algorithms for finding maximum and selecting median on a processor array with separable global buses
inferredcites →https://doi.org/10.1006/jpdc.1996.1244openalex-snapshot
Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package
inferredcites →https://doi.org/10.1007/3-540-16811-7_156openalex-snapshot
Hmesh: A vlsi architecture for parallel processing
inferredcites →https://doi.org/10.1016/0743-7315(87)90003-7openalex-snapshot
Array processor with multiple broadcasting
inferredcites →https://doi.org/10.1016/0743-7315(90)90073-xopenalex-snapshot
Solving linear recurrence systems on mesh-connected computers with multiple global buses
inferredcites →https://doi.org/10.1016/0743-7315(90)90088-7openalex-snapshot
Solving nonuniform problems on SIMD computers: Case study on region growing
inferredcites →https://doi.org/10.1109/12.5995openalex-snapshot
On multidimensional arrays of processors
inferredcites →https://doi.org/10.1109/12.5998openalex-snapshot
Modified-mesh connected parallel computers
inferredcites →https://doi.org/10.1109/12.73589openalex-snapshot
Square meshes are not always optimal
inferredcites →https://doi.org/10.1109/12.83652openalex-snapshot
Express cubes: improving the performance of k-ary n-cube interconnection networks
inferredcites →https://doi.org/10.1109/34.42857openalex-snapshot
Image computations on meshes with multiple broadcast
inferredcites →https://doi.org/10.1109/71.80135openalex-snapshot
Designing efficient parallel algorithms on mech-connected computers with multiple broadcasting
inferredcites →https://doi.org/10.1109/71.80177openalex-snapshot
Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems
inferredcites →https://doi.org/10.1109/pacrim.1989.48327openalex-snapshot
A mesh-like array processor with fully connected rows and columns
inferredcites →https://doi.org/10.1109/soac.1990.82146openalex-snapshot
Parallel algorithms on a mesh with multiple broadcasting
inferredcites →https://doi.org/10.1109/tc.1983.1676331openalex-snapshot
Mesh-Connected Computers with Broadcasting
inferredcites →https://doi.org/10.1109/tc.1984.1676405openalex-snapshot
Finding Maximum on an Array Processor with a Global Bus
inferredcites →https://doi.org/10.1109/tc.1986.1676658openalex-snapshot
Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses
inferredcites →https://doi.org/10.1109/tpami.1985.4767645openalex-snapshot
Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer
inferredcites →https://doi.org/10.1145/62044.62052openalex-snapshot
Size-time complexity of Boolean networks for prefix computations
inferredcites →https://doi.org/10.1145/828.322449openalex-snapshot
Graph Problems on a Mesh-Connected Processor Array
inferredcites →https://doi.org/10.1147/rd.312.0235openalex-snapshot
The complexity of computations by networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0027openalex-snapshot
Routing with Locality on Meshes with Buses
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0037openalex-snapshot
The Bus-Connected Ringed Tree: A Versatile Interconnection Network
inferred← citeshttps://doi.org/10.1007/0-306-46964-2_12openalex-snapshot
Other Mesh-Related Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-13119-6_16openalex-snapshot
Efficient Partitioning of Static Buses for Processor Arrays of Small Size
inferred← citeshttps://doi.org/10.1007/bfb0097977openalex-snapshot
High speed, high capacity bused interconnects using optical slab waveguides
inferred← citeshttps://doi.org/10.1007/s11044-012-9311-1openalex-snapshot
Solution of three key problems for massive parallelization of multibody dynamics
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00044-5openalex-snapshot
Bus-based networks for fan-in and uniform hypercube algorithms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.04.008openalex-snapshot
Tight bounds on the simulation of meshes with dynamically reconfigurable row/column buses by meshes with statically partitioned buses
inferred← citeshttps://doi.org/10.1016/s0129-6264(00)00005-6openalex-snapshot
A WORMHOLE ROUTER WITH EMBEDDED BROADCASTING VIRTUAL BUS FOR MESH COMPUTERS
inferred← citeshttps://doi.org/10.1093/comjnl/39.3.241openalex-snapshot
Extreme-Value Search and General Selection Algorithms for Fully Parallel Associative Memories
inferred← citeshttps://doi.org/10.1109/12.464386openalex-snapshot
On dependability evaluation of mesh-connected processors
inferred← citeshttps://doi.org/10.1109/71.532110openalex-snapshot
Exact bounds on running ASCEND/DESCEND and FAN-IN algorithms on synchronous multiple bus networks
inferred← citeshttps://doi.org/10.1109/71.914773openalex-snapshot
An improved generalization of mesh-connected computers with multiple buses
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845992openalex-snapshot
Semigroup and prefix computations on improved generalized mesh-connected computers with multiple buses
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213304openalex-snapshot
Simulation of meshes with separable buses by meshes with multiple partitioned buses
inferred← citeshttps://doi.org/10.1109/ipdps.2016.18openalex-snapshot
Optimal Algorithms for Graphs and Images on a Shared Memory Mesh
inferred← citeshttps://doi.org/10.1109/ipdps.2017.74openalex-snapshot
Optimal Algorithms for a Mesh-Connected Computer with Limited Additional Global Bandwidth
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470834openalex-snapshot
Polylogarithmic time simulation of reconfigurable row/column buses by static buses
inferred← citeshttps://doi.org/10.1109/ipps.1995.395949openalex-snapshot
Robust shearsort on incomplete bypass meshes
inferred← citeshttps://doi.org/10.1109/ipps.1996.508130openalex-snapshot
Fault-tolerant multiple bus networks for fan-in algorithms
inferred← citeshttps://doi.org/10.1109/ipps.1999.760429openalex-snapshot
Lower bounds on the loading of degree-2 multiple bus networks for binary-tree algorithms
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300524openalex-snapshot
Optimal simulation of meshes with dynamically separable buses by meshes with statically partitioned buses
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343286openalex-snapshot
Fault tolerance properties of mesh-connected parallel computers with separable row/column buses
inferred← citeshttps://doi.org/10.1109/spdp.1994.346104openalex-snapshot
Routing with locality in partitioned-bus meshes
inferred← citeshttps://doi.org/10.1109/tpds.2005.49openalex-snapshot
Routing algorithms on the bus-based hypercube network
inferred← citeshttps://doi.org/10.1109/tpds.2005.98openalex-snapshot
Performance, algorithmic, and robustness attributes of perfect difference networks
inferred← citeshttps://doi.org/10.1142/s0129054104002558openalex-snapshot
SIMULATION OF MESHES WITH SEPARABLE BUSES BY MESHES WITH MULTIPLE PARTITIONED BUSES
inferred← citeshttps://doi.org/10.1142/s0219265904001064openalex-snapshot
THE MESH WITH BINARY TREE NETWORKS: AN ENHANCED MESH WITH LOW BUS-LOADING
inferred← citeshttps://doi.org/10.1145/341800.341825openalex-snapshot
An efficient self-simulation algorithm for reconfigurable meshes
inferred← citeshttps://doi.org/10.1155/1999/29035openalex-snapshot
Investigation of Various Mesh ArchitecturesWith Broadcast Buses for High‐Performance Computing
inferred← citeshttps://doi.org/10.11648/j.ajnc.20170602.11openalex-snapshot
An Optimal Routing Algorithm for Horizontal Moving Signals in OCN for Massively Parallel Systems with Faulty Node/Link
inferred← citeshttps://doi.org/10.14569/ijacsa.2012.030216openalex-snapshot
Polylogarithmic Gap between Meshes with Reconfigurable Row/Column Buses and Meshes with Statically Partitioned Buses
inferred← citeshttps://doi.org/10.15803/ijnc.1.1_36openalex-snapshot
Impact of Reconfigurable Function on Meshes with Row/Column Buses
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.7190openalex-snapshot
Multiple Bus Networks for Binary -Tree Algorithms.
inferred← citeshttps://doi.org/10.3745/jips.2011.7.1.085openalex-snapshot
Effective Partitioning of Static Global Buses for Small Processor Arrays
inferred← citeshttps://doi.org/10.5121/ijcnc.2017.9103openalex-snapshot
Fault Tolerant Routing Algorithm in Octagon-Cell Interconnected Network for Horizontal Moving Messages
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.