On the public citation graph

High-Performance Graph Analytics on Manycore Processors

https://doi.org/10.1109/ipdps.2015.54

0 signed · 56 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-45591-4_68openalex-snapshot

On Identifying Strongly Connected Components in Parallel

inferredcites →https://doi.org/10.1016/j.jpdc.2005.03.007openalex-snapshot

Finding strongly connected components in distributed graphs

inferredcites →https://doi.org/10.1016/j.jpdc.2014.07.003openalex-snapshot

Kokkos: Enabling manycore performance portability through polymorphic memory access patterns

inferredcites →https://doi.org/10.1103/physreve.76.036106openalex-snapshot

Near linear time algorithm to detect community structures in large-scale networks

inferredcites →https://doi.org/10.1109/bigdata.2014.7004265openalex-snapshot

PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks

inferredcites →https://doi.org/10.1109/hipc.2013.6799125openalex-snapshot

Work efficient parallel algorithms for large graph exploration

inferredcites →https://doi.org/10.1109/hipc.2014.7116914openalex-snapshot

Simple parallel biconnectivity algorithms for multicore platforms

inferredcites →https://doi.org/10.1109/iiswc.2012.6402918openalex-snapshot

A quantitative study of irregular programs on GPUs

inferredcites →https://doi.org/10.1109/ipdps.2007.370685openalex-snapshot

Software and Algorithms for Graph Queries on Multithreaded Architectures

inferredcites →https://doi.org/10.1109/ipdps.2013.37openalex-snapshot

On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest

inferredcites →https://doi.org/10.1109/ipdps.2014.45openalex-snapshot

Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths

inferredcites →https://doi.org/10.1109/ipdps.2014.52openalex-snapshot

Traversing Trillions of Edges in Real Time: Graph Exploration on Large-Scale Parallel Machines

inferredcites →https://doi.org/10.1109/ipdps.2014.64openalex-snapshot

BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems

inferredcites →https://doi.org/10.1109/ipdps.2014.96openalex-snapshot

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

inferredcites →https://doi.org/10.1109/pact.2011.14openalex-snapshot

Efficient Parallel Graph Exploration on Multi-Core CPU and GPU

inferredcites →https://doi.org/10.1109/pdp.2014.17openalex-snapshot

Fast Diameter Computation of Large Sparse Graphs Using GPUs

inferredcites →https://doi.org/10.1109/sc.2014.52openalex-snapshot

Scalable and High Performance Betweenness Centrality on the GPU

inferredcites →https://doi.org/10.1109/tpds.2012.124openalex-snapshot

Distributed k-Core Decomposition

inferredcites →https://doi.org/10.1109/tpds.2013.111openalex-snapshot

Medusa: Simplified Graph Processing on GPUs

inferredcites →https://doi.org/10.1109/tpds.2016.2634535openalex-snapshot

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

inferredcites →https://doi.org/10.1145/1094811.1094844openalex-snapshot

Lifting sequential graph algorithms for distributed-memory parallel computation

inferredcites →https://doi.org/10.1145/1250734.1250759openalex-snapshot

Optimistic parallelism requires abstractions

inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot

Measurement and analysis of online social networks

inferredcites →https://doi.org/10.1145/1941553.1941590openalex-snapshot

Accelerating CUDA graph algorithms at maximum warp

inferredcites →https://doi.org/10.1145/197405.197406openalex-snapshot

Compiler transformations for high-performance computing

inferredcites →https://doi.org/10.1145/1993806.1993836openalex-snapshot

Distributed k-core decomposition

inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot

The university of Florida sparse matrix collection

inferredcites →https://doi.org/10.1145/2145816.2145832openalex-snapshot

Scalable GPU graph traversal

inferredcites →https://doi.org/10.1145/2442516.2442530openalex-snapshot

Ligra

inferredcites →https://doi.org/10.1145/2487788.2488173openalex-snapshot

KONECT

inferredcites →https://doi.org/10.1145/2503210.2503246openalex-snapshot

On fast parallel detection of strongly connected components (SCC) in small-world graphs

inferredcites →https://doi.org/10.1145/2517349.2522739openalex-snapshot

A lightweight infrastructure for graph analytics

inferredcites →https://doi.org/10.1145/98267.98287openalex-snapshot

Computing the block triangular form of a sparse matrix

inferredcites →https://doi.org/10.1155/2013/702694openalex-snapshot

Direction-Optimizing Breadth-First Search

inferredcites →https://doi.org/10.1177/1094342014524240openalex-snapshot

Using the Intel Many Integrated Core to accelerate graph traversal

inferredcites →https://doi.org/10.5555/2387880.2387883openalex-snapshot

PowerGraph: distributed graph-parallel computation on natural graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-68133-3_19openalex-snapshot

Graph Analytics to Reason Citations of Prophets in the Holy Quran

inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_24openalex-snapshot

GraphIn: An Online High Performance Incremental Graph Processing Framework

inferred← citeshttps://doi.org/10.1016/j.parco.2017.06.003openalex-snapshot

Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts

inferred← citeshttps://doi.org/10.1016/j.parco.2017.11.001openalex-snapshot

Orchestrating parallel detection of strongly connected components on GPUs

inferred← citeshttps://doi.org/10.1016/j.parco.2020.102710openalex-snapshot

CCF: An efficient SpMV storage format for AVX512 platforms

inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot

A survey of direct methods for sparse linear systems

inferred← citeshttps://doi.org/10.1109/access.2024.3416395openalex-snapshot

Sparse Matrix-Vector Multiplication Based on Online Arithmetic

inferred← citeshttps://doi.org/10.1109/hipc.2018.00022openalex-snapshot

Compiling SIMT Programs on Multi- and Many-Core Processors with Wide Vector Units: A Case Study with CUDA

inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00142openalex-snapshot

hpSpMV: A Heterogeneous Parallel Computing Scheme for SpMV on the Sunway TaihuLight Supercomputer

inferred← citeshttps://doi.org/10.1109/hpec62836.2024.10938460openalex-snapshot

Constant-Memory Graph Coarsening

inferred← citeshttps://doi.org/10.1109/ipdps.2016.54openalex-snapshot

Parallel Graph Coloring for Manycore Architectures

inferred← citeshttps://doi.org/10.1109/ipdps.2016.93openalex-snapshot

A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization

inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.41openalex-snapshot

A Comparison of High-Level Programming Choices for Incomplete Sparse Factorization Across Different Architectures

inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00191openalex-snapshot

Architectural Implications in Graph Processing of Accelerator with Gardenia Benchmark Suite

inferred← citeshttps://doi.org/10.1109/sbac-pad59825.2023.00020openalex-snapshot

A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs

inferred← citeshttps://doi.org/10.1137/15m1044679openalex-snapshot

Embedded Ensemble Propagation for Improving Performance, Portability, and Scalability of Uncertainty Quantification on Emerging Computational Architectures

inferred← citeshttps://doi.org/10.1145/3026937.3026941openalex-snapshot

High Performance Detection of Strongly Connected Components in Sparse Graphs on GPUs

inferred← citeshttps://doi.org/10.1145/3064176.3064191openalex-snapshot

Mosaic

inferred← citeshttps://doi.org/10.1145/3754598.3754664openalex-snapshot

Scaling Distributed Graph Processing to Hundreds of GPUs

inferred← citeshttps://doi.org/10.48550/arxiv.2008.05718openalex-snapshot

A Fine-Grained Hybrid CPU-GPU Algorithm for Betweenness Centrality Computations

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.