On the public citation graph

An Early Evaluation of the Scalability of Graph Algorithms on the Intel MIC Architecture

https://doi.org/10.1109/ipdpsw.2012.204

0 signed · 79 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.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2openalex-snapshot

Scalable parallel graph coloring algorithms

inferredcites →https://doi.org/10.1006/jpdc.1996.0107openalex-snapshot

Cilk: An Efficient Multithreaded Runtime System

inferredcites →https://doi.org/10.1007/978-3-642-17514-5_25openalex-snapshot

A Tighter Analysis of Work Stealing

inferredcites →https://doi.org/10.1007/s00224-002-1055-5openalex-snapshot

Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk

inferredcites →https://doi.org/10.1007/s11227-005-2339-8openalex-snapshot

A General Performance Model of Structured and Unstructured Mesh Particle Transport Computations

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

A framework for scalable greedy coloring on distributed-memory parallel computers

inferredcites →https://doi.org/10.1016/j.parco.2012.07.001openalex-snapshot

Graph coloring algorithms for multi-core and massively multithreaded architectures

inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot

Introduction to Algorithms

inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot

A faster algorithm for betweenness centrality*

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

SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks

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

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L

inferredcites →https://doi.org/10.1137/0720013openalex-snapshot

Estimation of Sparse Jacobian Matrices and Graph Coloring Problems

inferredcites →https://doi.org/10.1137/s0036144504444711openalex-snapshot

What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

inferredcites →https://doi.org/10.1142/s0129626407002843openalex-snapshot

CHALLENGES IN PARALLEL GRAPH PROCESSING

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

Metrics and models for reordering transformations

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

Reducers and other Cilk++ hyperobjects

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

A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)

inferredcites →https://doi.org/10.4086/toc.2007.v003a006openalex-snapshot

inferredcites →https://doi.org/10.7939/r3m32nh6qopenalex-snapshot

Iterated Greedy Graph Coloring and the Difficulty Landscape

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.3158openalex-snapshot

Supernodal sparse Cholesky factorization on graphics processing units

inferred← citeshttps://doi.org/10.1002/cpe.3181openalex-snapshot

Massively multithreaded maxflow for image segmentation on the Cray XMT‐2

inferred← citeshttps://doi.org/10.1002/cpe.3935openalex-snapshot

Accelerating Pre‐stack Kirchhoff Time Migration by Manual Vectorization

inferred← citeshttps://doi.org/10.1007/978-3-319-11197-1_17openalex-snapshot

HostoSink: A Collaborative Scheduling in Heterogeneous Environment

inferred← citeshttps://doi.org/10.1007/978-3-319-14313-2_27openalex-snapshot

Comparison of Three Popular Parallel Programming Models on the Intel Xeon Phi

inferred← citeshttps://doi.org/10.1007/978-3-642-45293-2_21openalex-snapshot

A Vectorized K-Means Algorithm for Intel Many Integrated Core Architecture

inferred← citeshttps://doi.org/10.1007/978-3-642-55224-3_52openalex-snapshot

Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi

inferred← citeshttps://doi.org/10.1007/978-981-95-5747-9_2openalex-snapshot

Graph Traversal Algorithms on GPU

inferred← citeshttps://doi.org/10.1007/s10766-015-0350-0openalex-snapshot

Steal Locally, Share Globally

inferred← citeshttps://doi.org/10.1007/s11227-019-03061-8openalex-snapshot

Accelerating influence maximization using heterogeneous algorithms

inferred← citeshttps://doi.org/10.1007/s11554-017-0739-7openalex-snapshot

Parallel BRDF-based infrared radiation simulation of aerial targets implemented on Intel Xeon processor and Xeon Phi coprocessor

inferred← citeshttps://doi.org/10.1016/c2012-0-07058-5openalex-snapshot

High-Performance Embedded Computing

inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.07.006openalex-snapshot

Regularizing graph centrality computations

inferred← citeshttps://doi.org/10.1080/20964471.2018.1434265openalex-snapshot

Efficient utilization of multi-core processors and many-core co-processors on supercomputer beacon for scalable geocomputation and geo-simulation over big earth data

inferred← citeshttps://doi.org/10.1109/asap.2017.7995269openalex-snapshot

MicRun: A framework for scale-free graph algorithms on SIMD architecture of the Xeon Phi

inferred← citeshttps://doi.org/10.1109/ccgrid.2013.59openalex-snapshot

Partially Separated Page Tables for Efficient Operating System Assisted Hierarchical Memory Management on Heterogeneous Architectures

inferred← citeshttps://doi.org/10.1109/cluster.2012.85openalex-snapshot

clone_n(): Parallel Thread Creation for Upcoming Many-Core Architectures

inferred← citeshttps://doi.org/10.1109/discs.2014.8openalex-snapshot

A Caching Approach to Reduce Communication in Graph Search Algorithms

inferred← citeshttps://doi.org/10.1109/hpcsim.2014.6903668openalex-snapshot

Evaluation of vectorization potential of Graph500 on Intel's Xeon Phi

inferred← citeshttps://doi.org/10.1109/hpcsim.2014.6903685openalex-snapshot

Parallel 3D deterministic particle transport on Intel MIC architecture

inferred← citeshttps://doi.org/10.1109/icpads.2015.89openalex-snapshot

Scaling Monte Carlo Tree Search on Intel Xeon Phi

inferred← citeshttps://doi.org/10.1109/icpp.2013.87openalex-snapshot

Performance Evaluation of NAS Parallel Benchmarks on Intel Xeon Phi

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

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

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

Efficient and Simplified Parallel Graph Processing over CPU and MIC

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

Parallel Graph Coloring for Manycore Architectures

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

Using MIC to Accelerate a Typical Data-Intensive Application: The Breadth-first Search

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

Compiler-Based Data Prefetching and Streaming Non-temporal Store Generation for the Intel(R) Xeon Phi(TM) Coprocessor

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

Avoiding Locks and Atomic Instructions in Shared-Memory Parallel BFS Using Optimistic Parallelization

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

Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures

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

The Power-Performance Tradeoffs of the Intel Xeon Phi on HPC Applications

inferred← citeshttps://doi.org/10.1109/iros60139.2025.11246232openalex-snapshot

HyperGraph ROS: An Open-Source Robot Operating System for Hybrid Parallel Computing based on Computational HyperGraph

inferred← citeshttps://doi.org/10.1109/pacrim.2015.7334845openalex-snapshot

Accelerating FDTD simulation of microwave pulse coupling into narrow slots on the Intel MIC architecture

inferred← citeshttps://doi.org/10.1109/pdp.2015.81openalex-snapshot

Number of Tasks, not Threads, is Key

inferred← citeshttps://doi.org/10.1109/pic.2014.6972327openalex-snapshot

Accelerating embarrassingly parallel algorithm on Intel MIC

inferred← citeshttps://doi.org/10.1109/sc.2012.25openalex-snapshot

Breaking the speed and scalability Barriers for Graph exploration on distributed-memory machines

inferred← citeshttps://doi.org/10.1109/sc.companion.2012.181openalex-snapshot

Abstract: Toward Operating System Assisted Hierarchical Memory Management for Heterogeneous Architectures

inferred← citeshttps://doi.org/10.1109/sc.companion.2012.182openalex-snapshot

Poster: Toward Operating System Assisted Hierarchical Memory Management for Heterogeneous Architectures

inferred← citeshttps://doi.org/10.1109/sc41405.2020.00103openalex-snapshot

High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality

inferred← citeshttps://doi.org/10.1109/tpds.2016.2546258openalex-snapshot

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

inferred← citeshttps://doi.org/10.1109/tpds.2019.2927451openalex-snapshot

Exploiting Parallelism and Vectorisation in Breadth-First Search for the Intel Xeon Phi

inferred← citeshttps://doi.org/10.1109/tpds.2020.3014173openalex-snapshot

Feluca: A Two-Stage Graph Coloring Algorithm With Color-Centric Paradigm on GPU

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

A work-efficient algorithm for parallel unordered depth-first search

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

Exploiting recent SIMD architectural advances for irregular applications

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

Breadth first search vectorization on the Intel Xeon Phi

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

Combining SIMD and Many/Multi-core Parallelism for Finite State Machines with Enumerative Speculation

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

Vectorization of Hybrid Breadth First Search on the Intel Xeon Phi

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

Efficient SIMD and MIMD parallelization of hash-based aggregation by conflict mitigation

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

Combining SIMD and Many/Multi-core Parallelism for Finite State Machines with Enumerative Speculation

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

Conflict-free vectorization of associative irregular applications with recent SIMD architectural advances

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

Conflict-free vectorization of associative irregular applications with recent SIMD architectural advances

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

Graptor

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

Impact of AVX-512 Instructions on Graph Partitioning Problems.

inferred← citeshttps://doi.org/10.1147/jrd.2012.2232414openalex-snapshot

Massive data analytics: The Graph 500 on IBM Blue Gene/Q

inferred← citeshttps://doi.org/10.1177/1094342014524240openalex-snapshot

Using the Intel Many Integrated Core to accelerate graph traversal

inferred← citeshttps://doi.org/10.1177/1094342018762510openalex-snapshot

Reducing communication in parallel graph search algorithms with software caches

inferred← citeshttps://doi.org/10.1201/9781003338413-3openalex-snapshot

Predictable Parallel Programming with OpenMP

inferred← citeshttps://doi.org/10.13052/rp-9788793609624openalex-snapshot

High-Performance and Time-Predictable Embedded Computing

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

Breadth First Search Vectorization on the Intel Xeon Phi

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

Vectorization of Hybrid Breadth First Search on the Intel Xeon Phi

inferred← citeshttps://doi.org/10.5821/dissertation-2117-107712openalex-snapshot

Design of energy-efficient vector units for in-order cores

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.