On the public citation graph

Efficient Self-Simulation Algorithms for Reconfigurable Arrays

0 signed · 62 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-57273-2_66openalex-snapshot
Mesh connected computers with fixed and reconfigurable buses: Packet routing, sorting, and selection
inferredcites →https://doi.org/10.1007/3-540-57273-2_68openalex-snapshot
Randomized routing on meshes with buses
inferredcites →https://doi.org/10.1007/978-1-4612-5144-6_8openalex-snapshot
Hither Hundreds of Processors in a Database Machine
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_18openalex-snapshot
The Entity Relationship Model — Toward a Unified View of Data
inferredcites →https://doi.org/10.1007/bfb0035168openalex-snapshot
The complexity of reconfiguring network models
inferredcites →https://doi.org/10.1016/0743-7315(89)90022-1openalex-snapshot
Connection autonomy in SIMD computers: A VLSI implementation
inferredcites →https://doi.org/10.1016/0743-7315(91)90084-mopenalex-snapshot
The power of reconfiguration
inferredcites →https://doi.org/10.1109/12.277290openalex-snapshot
Parallel computations on reconfigurable meshes
inferredcites →https://doi.org/10.1109/12.29479openalex-snapshot
Polymorphic-torus network
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/fmpc.1992.234907openalex-snapshot
Selection on the reconfigurable mesh
inferredcites →https://doi.org/10.1109/ipps.1992.223059openalex-snapshot
An optimal sorting algorithm on reconfigurable mesh
inferredcites →https://doi.org/10.1109/ipps.1993.262877openalex-snapshot
Sorting n numbers on n*n reconfigurable meshes with buses
inferredcites →https://doi.org/10.1109/spdp.1992.242720openalex-snapshot
An optimal multiplication algorithm for reconfigurable mesh
inferredcites →https://doi.org/10.1109/tc.1979.1675383openalex-snapshot
RAP.2—An Associative Processor for Databases and Its Applications
inferredcites →https://doi.org/10.1145/356662.356666openalex-snapshot
CODASYL Data-Base Management Systems
inferredcites →https://doi.org/10.1145/356869.356873openalex-snapshot
Data-Driven and Demand-Driven Computer Architecture
inferredcites →https://doi.org/10.1145/357980.358007openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/602259.602283openalex-snapshot
A methodology for database system performance evaluation
inferredcites →https://doi.org/10.1145/62032.62037openalex-snapshot
AGM: a dataflow database machine

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.0047openalex-snapshot
On the Power of Segmenting and Fusing Buses
inferred← citeshttps://doi.org/10.1006/jpdc.1996.1259openalex-snapshot
P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1385openalex-snapshot
Constant Time Graph Algorithms on the Reconfigurable Multiple Bus Machine
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1810openalex-snapshot
Using Bus Linearization to Scale the Reconfigurable Mesh
inferred← citeshttps://doi.org/10.1007/3-540-44467-x_5openalex-snapshot
Optimal Segmented Scan and Simulation of Reconfigurable Architectures on Fixed Connection Networks
inferred← citeshttps://doi.org/10.1007/978-0-585-27268-9_11openalex-snapshot
Basic Data Movement Operations on the LARPBS Model
inferred← citeshttps://doi.org/10.1007/bf01263339openalex-snapshot
Performance analysis of parallel object-oriented query processing algorithms
inferred← citeshttps://doi.org/10.1007/bfb0097946openalex-snapshot
Improved scaling simulation of the general reconfigurable mesh
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90132-9openalex-snapshot
Squashed embedding of E-R schemas in hypercubes
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/s0020-0190(01)00299-xopenalex-snapshot
Scaling multiple addition and prefix sums on the reconfigurable mesh
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00060-0openalex-snapshot
Adaptive AT2 optimal algorithms on reconfigurable meshes
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00164-3openalex-snapshot
Degree of scalability: scalable reconfigurable mesh algorithms for multiple addition and matrix–vector multiplication
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00118-7openalex-snapshot
Time and work optimal simulation of basic reconfigurable meshes on hypercubes
inferred← citeshttps://doi.org/10.1023/a:1008631132311openalex-snapshot
Graph-Based Parallel Query Processing and Optimization Strategies for Object-Oriented Databases
inferred← citeshttps://doi.org/10.1080/10655140290011041openalex-snapshot
An Algorithm Visualization Tool on the Reconfigurable Mesh
inferred← citeshttps://doi.org/10.1109/69.390252openalex-snapshot
Algorithms for asynchronous parallel processing of object-oriented databases
inferred← citeshttps://doi.org/10.1109/71.722220openalex-snapshot
Scaling simulation of the fusing-restricted reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/71.862204openalex-snapshot
Constant time dynamic programming on directed reconfigurable networks
inferred← citeshttps://doi.org/10.1109/fpl.2007.4380623openalex-snapshot
A Many-Core Implementation Based on the Reconfigurable Mesh Model
inferred← citeshttps://doi.org/10.1109/hipc.1997.634504openalex-snapshot
Single step undirected reconfigurable networks
inferred← citeshttps://doi.org/10.1109/icsamos.2008.4664845openalex-snapshot
Realizing reconfigurable mesh algorithms on softcore arrays
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213339openalex-snapshot
An efficient scaling-simulation algorithm of reconfigurable meshes by meshes with partitioned buses
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303174openalex-snapshot
Fault tolerance and scalability of the reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303175openalex-snapshot
Efficient simulation of the acyclic DR-mesh on the LR-mesh
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.1996.508135openalex-snapshot
Integer and floating point matrix-vector multiplication on the reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/ispan.1999.778939openalex-snapshot
Simulating a mesh with separable buses by a mesh with partitioned buses
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/tc.2012.280openalex-snapshot
The Well-Connected Processor Array
inferred← citeshttps://doi.org/10.1109/tc.2013.174openalex-snapshot
An FPGA-Based Reconfigurable Mesh Many-Core
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/s0129054105002863openalex-snapshot
EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL
inferred← citeshttps://doi.org/10.1142/s0129054105002875openalex-snapshot
DESIGNING FAULT TOLERANT ALGORITHMS FOR RECONFIGURABLE MESHES
inferred← citeshttps://doi.org/10.1145/341800.341825openalex-snapshot
An efficient self-simulation algorithm for reconfigurable meshes
inferred← citeshttps://doi.org/10.1145/62032.62037openalex-snapshot
AGM: a dataflow database machine
inferred← citeshttps://doi.org/10.1155/1999/71739openalex-snapshot
Single Step Undirected Reconfigurable Networks
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.17169/refubium-22533openalex-snapshot
A fast parallel algorithm for special linear systems of equations using processor arrays with reconfigurable bus systems
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.7081openalex-snapshot
Scaling Simulations of Reconfigurable Meshes.
inferred← citeshttps://doi.org/10.3745/jips.2011.7.1.085openalex-snapshot
Effective Partitioning of Static Global Buses for Small Processor 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.