On the public citation graph
The E-BSP model: Incorporating general locality and unbalanced communication into the BSP model
0 signed · 41 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-57785-8_145openalex-snapshot
Deterministic 1 -k routing on meshes with applications to worm-hole routing
inferredcites →https://doi.org/10.1007/978-3-662-25209-3_2openalex-snapshot
Towards a Single Model of Efficient Computation in Real Parallel Machines
inferredcites →https://doi.org/10.1007/bfb0024721openalex-snapshot
The E-BSP model: Incorporating general locality and unbalanced communication into the BSP model
inferredcites →https://doi.org/10.1007/bfb0035093openalex-snapshot
Towards a single model of efficient computation in real parallel machines
inferredcites →https://doi.org/10.1016/0020-0190(96)00073-7openalex-snapshot
Communication primitives for BSP computers
inferredcites →https://doi.org/10.1016/0304-3975(87)90069-7openalex-snapshot
The generalized packet routing problem
inferredcites →https://doi.org/10.1016/0743-7315(92)90033-jopenalex-snapshot
Report of the purdue workshop on grand challenges in computer architecture for the support of high performance computing
inferredcites →https://doi.org/10.1016/0743-7315(92)90034-kopenalex-snapshot
A practical hierarchical model of parallel computation I. The model
inferredcites →https://doi.org/10.1109/aispas.1995.401331openalex-snapshot
Dynamic randomized simulation of hierarchical PRAMs on meshes
inferredcites →https://doi.org/10.1109/spdp.1995.530736openalex-snapshot
Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments
inferredcites →https://doi.org/10.1145/140901.140914openalex-snapshot
Branch-and-bound and backtrack search on mesh-connected arrays of processors
inferredcites →https://doi.org/10.1145/237502.241604openalex-snapshot
A quantitative comparison of parallel computation models
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_63openalex-snapshot
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_67openalex-snapshot
Parallel Algorithm Design with Coarse-Grained Synchronization
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_22openalex-snapshot
Decomposable Bulk Synchronous Parallel Computers
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_5openalex-snapshot
κNUMA: A Model for Clusters of SMP-Machines
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_76openalex-snapshot
A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing⋆ (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_195openalex-snapshot
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_1openalex-snapshot
A General-Purpose Shared-Memory Model for Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_123openalex-snapshot
Minimizing Global Communication in Parallel List Ranking
inferred← citeshttps://doi.org/10.1007/bfb0058018openalex-snapshot
QSM: A general purpose shared-memory model for parallel computation
inferred← citeshttps://doi.org/10.1007/pl00008269openalex-snapshot
Modeling Parallel Bandwidth: Local versus Global Restrictions
inferred← citeshttps://doi.org/10.1007/s002240000121openalex-snapshot
Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
inferred← citeshttps://doi.org/10.1007/s00453-001-0109-4openalex-snapshot
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
inferred← citeshttps://doi.org/10.1016/j.parco.2014.12.002openalex-snapshot
Extending the BSP model for multi-core and out-of-core computing: MBSP
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303180openalex-snapshot
Parallel hashing algorithms on BSP and QSM models
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370684openalex-snapshot
STAMP: A Universal Algorithmic Model for Next-Generation Multithreaded Machines and Systems
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536385openalex-snapshot
STAMP: A universal algorithmic model for next-generation multithreaded machines and systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470682openalex-snapshot
Performance modeling of heterogeneous systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.112openalex-snapshot
Estimating Application Hierarchical Bandwidth Requirements Using BSP Family Models
inferred← citeshttps://doi.org/10.1109/ipps.1999.760447openalex-snapshot
Experimental evaluation of QSM, a simple shared-memory model
inferred← citeshttps://doi.org/10.1145/258492.258500openalex-snapshot
Can shared-memory model serve as a bridging model for parallel computation?
inferred← citeshttps://doi.org/10.1145/290409.290412openalex-snapshot
A quantitative comparison of parallel computation models
inferred← citeshttps://doi.org/10.1155/2003/720402openalex-snapshot
A Tool for Performance Modeling of Parallel Programs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611091openalex-snapshot
Lossy Bulk Synchronous Parallel Processing Model for Very Large Scale Grids
inferred← citeshttps://doi.org/10.70675/f3064779zc9e6z4a34zb41czfb795c178132openalex-snapshot
BSP algorithms for LTL & CTL model checking of security protocols
showing the first 26 of 27 · page through all 27
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.