On the public citation graph

Optimal routing algorithms for mesh-connected processor arrays

https://doi.org/10.1007/bfb0040408
0 signed · 53 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.1007/3-540-18625-5_53openalex-snapshot
An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks
inferredcites →https://doi.org/10.1007/bf00264359openalex-snapshot
Lower bounds for sorting on mesh-connected architectures
inferredcites →https://doi.org/10.1007/bfb0039623openalex-snapshot
Optimal sorting on multi-dimensionally mesh-connected computers
inferredcites →https://doi.org/10.1007/bfb0040409openalex-snapshot
Routing and sorting on mesh-connected arrays
inferredcites →https://doi.org/10.1016/s0065-2458(08)60461-1openalex-snapshot
Supercomputers and VLSI: The Effect of Large-Scale Integration on Computer Architecture
inferredcites →https://doi.org/10.1109/sfcs.1986.54openalex-snapshot
The distance bound for sorting on mesh-connected processor arrays is tight
inferredcites →https://doi.org/10.1109/tc.1976.1674718openalex-snapshot
Implementation of Permutation Functions in Illiac IV-Type Computers
inferredcites →https://doi.org/10.1109/tc.1980.1675684openalex-snapshot
Design of a Massively Parallel Processor
inferredcites →https://doi.org/10.1109/tc.1981.1675791openalex-snapshot
A Self-Routing Benes Network and Parallel Permutation Algorithms
inferredcites →https://doi.org/10.1109/tc.1981.6312172openalex-snapshot
Data broadcasting in SIMD computers
inferredcites →https://doi.org/10.1109/tc.1983.1676217openalex-snapshot
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
inferredcites →https://doi.org/10.1109/tc.1985.1676603openalex-snapshot
Systolic Sorting on a Mesh-Connected Network
inferredcites →https://doi.org/10.1109/tc.1986.1676812openalex-snapshot
Permutations on Illiac IV-Type Networks
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/12130.12156openalex-snapshot
An optimal sorting algorithm for mesh connected computers
inferredcites →https://doi.org/10.1145/322169.322172openalex-snapshot
An optimal routing algorithm for mesh-connected Parallel computers
inferredcites →https://doi.org/10.1145/357114.357116openalex-snapshot
Ultracomputers
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/72935.72970openalex-snapshot
A 2 n -2 step algorithm for routing in an nxn array with constant size queues

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.4330060704openalex-snapshot
Determining update latency bounds in Galactica Net
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_20openalex-snapshot
Packet routing on grids of processors
inferred← citeshttps://doi.org/10.1007/3-540-55437-8_83openalex-snapshot
Multipacket routing on rings
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_33openalex-snapshot
Balanced strategies for routing on meshes
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_11openalex-snapshot
Optimal multi-packet routing on the torus
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_68openalex-snapshot
Routing problems on the mesh of buses
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_60openalex-snapshot
Communication throughput of interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_34openalex-snapshot
Efficient delay routing
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_710openalex-snapshot
Randomized routing and PRAM emulation on parallel machines
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_5openalex-snapshot
Efficient Randomized Algorithms for Parallel and Distributed Machines
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_13openalex-snapshot
Embedding one Interconnection Network in Another
inferred← citeshttps://doi.org/10.1007/bf01185337openalex-snapshot
Packet routing on grids of processors
inferred← citeshttps://doi.org/10.1007/bf01192690openalex-snapshot
Flit-Serial Packet Routing on Meshes and Tori
inferred← citeshttps://doi.org/10.1007/bf01294128openalex-snapshot
A 2n?2 step algorithm for routing in ann �n array with constant-size queues
inferred← citeshttps://doi.org/10.1007/bf02090401openalex-snapshot
A unified framework for off-line permutation routing in parallel networks
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90019-ropenalex-snapshot
Mesh permutation routing with locality
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0772-8.50008-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.08.006openalex-snapshot
Improved bounds for data-gathering time in sensor networks
inferred← citeshttps://doi.org/10.1109/12.509915openalex-snapshot
An empirical study of off-line permutation packet routing on two-dimensional meshes based on the multistage routing method
inferred← citeshttps://doi.org/10.1109/71.210810openalex-snapshot
An efficient heuristic for permutation packet routing on meshes with low buffer requirements
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89475openalex-snapshot
On bit-serial packet routing for the mesh and the torus
inferred← citeshttps://doi.org/10.1109/hpdc.1992.246482openalex-snapshot
Determining update latency bounds in Galactica Net
inferred← citeshttps://doi.org/10.1109/iccd.1990.130166openalex-snapshot
Fast parallel communication on mesh connected machines with low buffer requirements
inferred← citeshttps://doi.org/10.1109/icns.2007.71openalex-snapshot
Improved Lower Bounds for Data-Gathering Time in Sensor Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21942openalex-snapshot
Universal packet routing algorithms
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296702openalex-snapshot
On the design of optimal adaptive routers for direct networks
inferred← citeshttps://doi.org/10.1109/spdp.1990.143513openalex-snapshot
Routing permutations on MESH interconnection networks
inferred← citeshttps://doi.org/10.1109/spdp.1994.346104openalex-snapshot
Routing with locality in partitioned-bus meshes
inferred← citeshttps://doi.org/10.1145/140901.140904openalex-snapshot
Simple path selection for optimal routing on processor arrays
inferred← citeshttps://doi.org/10.1145/140901.140907openalex-snapshot
Optimal sorting on mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1145/72935.72970openalex-snapshot
A 2 n -2 step algorithm for routing in an nxn array with constant size queues
inferred← citeshttps://doi.org/10.1145/97444.97448openalex-snapshot
Average case analysis of greedy routing algorithms on arrays
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.