On the public citation graph

Theory, practice, and a tool for BSP performance prediction

https://doi.org/10.1007/bfb0024766
0 signed · 32 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/978-3-0348-8534-8_10openalex-snapshot
A Parallel Framework for Unstructured Grid Solvers
inferredcites →https://doi.org/10.1007/bfb0015236openalex-snapshot
Scalable computing
inferredcites →https://doi.org/10.1016/s0167-8191(05)80029-8openalex-snapshot
Performance parameters and benchmarking of supercomputers
inferredcites →https://doi.org/10.1145/237502.237503openalex-snapshot
Towards efficiency and portability
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.2514/6.1995-1671openalex-snapshot
Implicit time accurate solutions on unstructured dynamic grids
inferredcites →https://doi.org/10.5287/ora-zv88mpqpxopenalex-snapshot
Two approaches to architecture - independent 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.1006/jpdc.1999.1586openalex-snapshot
A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix
inferred← citeshttps://doi.org/10.1007/10720115_2openalex-snapshot
A Visual BSP Programming Environment for Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-45652-x_19openalex-snapshot
Performance Analysis of Component-Based Applications
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_3openalex-snapshot
Universal computing
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_700openalex-snapshot
Using the BSP cost model to optimise parallel neural network training
inferred← citeshttps://doi.org/10.1007/bf02948510openalex-snapshot
Hierarchical bulk synchronous parallel model and performance optimization
inferred← citeshttps://doi.org/10.1007/bfb0002799openalex-snapshot
A parallelisation approach for supporting scalable and portable computing
inferred← citeshttps://doi.org/10.1007/bfb0031604openalex-snapshot
A two-way BSP algorithm for tridiagonal systems
inferred← citeshttps://doi.org/10.1007/bfb0057871openalex-snapshot
Static scheduling using task replication for LogP and BSP models
inferred← citeshttps://doi.org/10.1007/bfb0057942openalex-snapshot
BSP, LogP, and oblivious programs
inferred← citeshttps://doi.org/10.1007/pl00008264openalex-snapshot
Memory-Efficient Matrix Multiplication in the BSP Model
inferred← citeshttps://doi.org/10.1016/s0167-739x(97)00035-6openalex-snapshot
A two-way BSP algorithm for tridiagonal systems
inferred← citeshttps://doi.org/10.1016/s0167-739x(98)00043-0openalex-snapshot
Using the BSP cost model to optimise parallel neural network training
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00160-6openalex-snapshot
Portable and architecture independent parallel performance tuning using BSP
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00093-3openalex-snapshot
BSPlib: The BSP programming library
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00103-9openalex-snapshot
BSP clusters: High performance, reliable and very low cost
inferred← citeshttps://doi.org/10.1080/17445760902719927openalex-snapshot
Bsp2omp: A Compiler For Translating Bsp Programs To Openmp
inferred← citeshttps://doi.org/10.1109/12.780876openalex-snapshot
Portable and efficient parallel computing using the BSP model
inferred← citeshttps://doi.org/10.1109/empdp.1998.647211openalex-snapshot
Portable and architecture independent parallel performance tuning using a call-graph profiling tool
inferred← citeshttps://doi.org/10.1109/hpcs.2010.5547138openalex-snapshot
Strategy of resource brokering for efficient parallelization of MLP training
inferred← citeshttps://doi.org/10.1109/isiea.2009.5356307openalex-snapshot
Investigation of computational cost model of MLP parallel batch training algorithm
inferred← citeshttps://doi.org/10.1109/mppm.1997.715959openalex-snapshot
Portability of performance with the BSPLib communications library
inferred← citeshttps://doi.org/10.1109/pacrim.1997.619951openalex-snapshot
Towards high-quality, high-speed numerical computation
inferred← citeshttps://doi.org/10.1109/pccc.2000.830342openalex-snapshot
IP3T: a performance prediction software tool for irregular parallel applications
inferred← citeshttps://doi.org/10.1155/1997/532130openalex-snapshot
Questions and Answers about BSP
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.