CoChat

Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server

Beamer, Scott, Asanovic, Krste, Patterson, David · 2015 · 2015 IEEE International Symposium on Workload Characterization
Cited by 168

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Abstract

Graph processing is an increasingly important application domain and is typically communication-bound. In this work, we analyze the performance characteristics of three high-performance graph algorithm codebases using hardware performance counters on a conventional dual-socket server. Unlike many other communication-bound workloads, graph algorithms struggle to fully utilize the platform's memory bandwidth and so increasing memory bandwidth utilization could be just as effective as decreasing communication. Based on our observations of simultaneous low compute and bandwidth utilization, we find there is substantial room for a different processor architecture to improve performance without requiring a new memory system.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/iiswc.2015.12

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

  • GraphIt: a high-performance graph DSL

    Zhang, Y., Yang, M., Baghdadi, R., Kamil, S., Shun, J., & Amarasinghe, S. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3276491 · Cited by 169

    “The performance bottlenecks of these algorithms depend not only on the algorithm and the underlying hardware, but also on the size and structure of the graph [Beamer et al. 2015].”
    BackgroundMethod

See all 168

Metadata

Authors
Beamer, S., Asanovic, K., & Patterson, D.
Venue
2015 IEEE International Symposium on Workload Characterization
Publisher
IEEE
Published
2015-10
Pages
56-65
OpenAlex
W1955594754
Cited by
168
References
3
FWCI
14.01
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server. https://app.cochat.ai/papers/10.1109/iiswc.2015.12
The paper
Beamer, S., Asanovic, K., & Patterson, D. (2015). Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server. 2015 IEEE International Symposium on Workload Characterization. https://doi.org/10.1109/iiswc.2015.12

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.