On the public citation graph
Optimizations and Analysis of BSP Graph Processing Models on Public Clouds
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.
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/978-3-642-17679-1_14openalex-snapshot
A High-Level Framework for Distributed Processing of Large-Scale Graphs
inferredcites →https://doi.org/10.1007/s10115-010-0305-0openalex-snapshot
PEGASUS: mining peta-scale graphs
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1038/35075138openalex-snapshot
Lethality and centrality in protein networks
inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot
A faster algorithm for betweenness centrality*
inferredcites →https://doi.org/10.1109/asonam.2011.55openalex-snapshot
DisNet: A Framework for Distributed Graph Computation
inferredcites →https://doi.org/10.1109/cloudcom.2010.17openalex-snapshot
HAMA: An Efficient Matrix Computation with the MapReduce Framework
inferredcites →https://doi.org/10.1109/ipdps.2009.5161100openalex-snapshot
A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
inferredcites →https://doi.org/10.1126/science.1198981openalex-snapshot
Cloud Computing—What's in It for Me as a Scientist?
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1830252.1830263openalex-snapshot
Design patterns for efficient graph algorithms in MapReduce
inferredcites →https://doi.org/10.1145/2339530.2339722openalex-snapshot
Streaming graph partitioning for large distributed graphs
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1890/07-1419.1openalex-snapshot
USING NETWORK CENTRALITY MEASURES TO MANAGE LANDSCAPE CONNECTIVITY
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2623openalex-snapshot
Cost‐efficient and network‐aware dynamic repartitioning‐based algorithms for scheduling large‐scale graphs in cloud computing environments
inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_38openalex-snapshot
GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics
inferred← citeshttps://doi.org/10.1007/978-981-16-2540-4_29openalex-snapshot
A Two-Stage Graph Computation Model with Communication Equilibrium
inferred← citeshttps://doi.org/10.1016/j.future.2019.02.048openalex-snapshot
Quality of Service (QoS)-driven resource provisioning for large-scale graph processing in cloud computing environments: Graph Processing-as-a-Service (GPaaS)
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.08.010openalex-snapshot
Parallel processing of filtered queries in attributed semantic graphs
inferred← citeshttps://doi.org/10.1109/ccbd.2014.26openalex-snapshot
A Computing Model for Real-Time Stream Processing
inferred← citeshttps://doi.org/10.1109/ccgrid.2014.100openalex-snapshot
Towards an MPI-Like Framework for the Azure Cloud Platform
inferred← citeshttps://doi.org/10.1109/ccgrid.2016.38openalex-snapshot
iGiraph: A Cost-Efficient Framework for Processing Large-Scale Graphs on Public Clouds
inferred← citeshttps://doi.org/10.1109/ccgrid.2016.97openalex-snapshot
Elastic Partition Placement for Non-stationary Graph Algorithms
inferred← citeshttps://doi.org/10.1109/ccgrid.2017.85openalex-snapshot
Performance Modelling and Cost Effective Execution for Distributed Graph Processing on Configurable VMs
inferred← citeshttps://doi.org/10.1109/cloud.2019.00-28openalex-snapshot
Adaptive Partition Migration for Irregular Graph Algorithms on Elastic Resources
inferred← citeshttps://doi.org/10.1109/cloudcom.2014.127openalex-snapshot
Hierarchical Parallelization and Runtime Scheduling for Pregel-Like Graph Processing Systems
inferred← citeshttps://doi.org/10.1109/cluster.2018.00056openalex-snapshot
Elasticity in Graph Analytics? A Benchmarking Framework for Elastic Graph Processing
inferred← citeshttps://doi.org/10.1109/hpec.2014.7040974openalex-snapshot
Efficient extraction of high centrality vertices in distributed graphs
inferred← citeshttps://doi.org/10.1109/icde.2017.153openalex-snapshot
Spinner: Scalable Graph Partitioning in the Cloud
inferred← citeshttps://doi.org/10.1109/ipdps.2014.49openalex-snapshot
How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis
inferred← citeshttps://doi.org/10.1109/ipdps.2015.66openalex-snapshot
Distributed Programming over Time-Series Graphs
inferred← citeshttps://doi.org/10.1109/nas.2015.7255213openalex-snapshot
Achieving up to zero communication delay in BSP-based graph processing via vertex categorization
inferred← citeshttps://doi.org/10.1109/tc.2024.3475568openalex-snapshot
ClusPar: A Game-Theoretic Approach for Efficient and Scalable Streaming Edge Partitioning
inferred← citeshttps://doi.org/10.1109/tcss.2018.2888689openalex-snapshot
A Distributed Spatiotemporal Contingency Analysis for the Lebanese Power Grid
inferred← citeshttps://doi.org/10.1109/tsc.2015.2477835openalex-snapshot
Configuration Guidance Framework for Molecular Dynamics Simulations in Virtualized Clusters
inferred← citeshttps://doi.org/10.1109/tse.2019.2934849openalex-snapshot
A Cost-Efficient Auto-Scaling Algorithm for Large-Scale Graph Processing in Cloud Environments with Heterogeneous Resources
inferred← citeshttps://doi.org/10.1145/2806416.2806420openalex-snapshot
Towards Scale-out Capability on Social Graphs
inferred← citeshttps://doi.org/10.1186/s13677-017-0103-2openalex-snapshot
Energy efficient temporal load aware resource allocation in cloud computing datacenters
inferred← citeshttps://doi.org/10.1186/s40064-016-2251-0openalex-snapshot
A distributed query execution engine of big attributed graphs
inferred← citeshttps://doi.org/10.12694/scpe.v17i1.1147openalex-snapshot
Using Computational Geometry to Improve Process Rescheduling on Round-Based Parallel Applications
inferred← citeshttps://doi.org/10.4018/978-1-4666-8648-9.ch006openalex-snapshot
A Web Based Decision Support System (DSS) for Individuals' Urban Travel Alternatives
inferred← citeshttps://doi.org/10.4018/978-1-4666-9619-8.ch025openalex-snapshot
A Web Based Decision Support System (DSS) for Individuals' Urban Travel Alternatives
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5975openalex-snapshot
Scalable Analytics over Distributed Time-series Graphs using GoFFish
inferred← citeshttps://doi.org/10.48550/arxiv.1410.1903openalex-snapshot
Systems for Near Real-Time Analysis of Large-Scale Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04405openalex-snapshot
Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1510.03145openalex-snapshot
Elastic Resource Allocation for Distributed Graph Processing Platforms
inferred← citeshttps://doi.org/10.48550/arxiv.2005.12873openalex-snapshot
Benchmarking Graph Data Management and Processing Systems: A Survey
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.