Skip to primary content
Skip to secondary content

High-Performance Graph Processing

High-Performance Graph Processing

Main menu

  • Home (DIPSA)
  • Projects
    • GraphGrind
    • Graptor
    • Transprecision
    • LaganLighter
  • Publications
  • Talks
  • Source Code
  • About
    • People
    • Jobs
    • Contact

Tag Archives: numa

VEBO: a vertex- and edge-balanced ordering heuristic to load balance parallel graph processing (Poster)

Posted on 5 February 2019 by Hans Vandierendonck
Reply

This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/vebo-a-vertex-and-edge-balanced-ordering-heuristic-to-load-balance-parallel-graph-processing-poster/

Posted in GraphGrind | Tagged locality, numa | Leave a Reply

VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing

Posted on 5 June 2018 by Hans Vandierendonck
Reply

This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/vebo-a-vertex-and-edge-balanced-ordering-heuristic-to-load-balance-parallel-graph-processing/

Posted in GraphGrind | Tagged locality, numa | Leave a Reply

Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning

Posted on 5 August 2017 by Hans Vandierendonck
Reply

This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/accelerating-graph-analytics-by-utilising-the-memory-locality-of-graph-partitioning/

Posted in GraphGrind | Tagged locality, numa | Leave a Reply

GraphGrind: Addressing Load Imbalance of Graph Partitioning

Posted on 5 June 2017 by Hans Vandierendonck
Reply

This post has been relocated to: https://blogs.qub.ac.uk/DIPSA/graphgrind-addressing-load-imbalance-of-graph-partitioning/

Posted in GraphGrind | Tagged loadbalance, locality, numa | Leave a Reply

Recent Posts

  • On Designing Structure-Aware High-Performance Graph Algorithms (PhD Thesis) 8 December 2022
  • LaganLighter Source Code 14 November 2022
  • MASTIFF: Structure-Aware Minimum Spanning Tree/Forest – ICS’22 28 June 2022
  • Software-Defined Floating-Point Number Formats and Their Application to Graph Processing – ICS’22 15 June 2022
  • SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs – ISPASS’22 (Poster) 23 May 2022
All posts

Archives

  • December 2022
  • November 2022
  • June 2022
  • May 2022
  • April 2022
  • November 2021
  • October 2021
  • September 2021
  • August 2021
  • June 2021
  • May 2021
  • April 2021
  • March 2021
  • February 2021
  • January 2021
  • December 2020
  • September 2020
  • June 2020
  • February 2019
  • July 2018
  • June 2018
  • May 2018
  • August 2017
  • July 2017
  • June 2017

Categories

  • GraphGrind
  • Graptor
  • LaganLighter
  • Transprecision
  • Uncategorised

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org

Our website has been relocated to https://blogs.qub.ac.uk/DIPSA

Creative Commons Licence

This website is licensed under a Creative Commons Attribution 4.0 International License.

Proudly powered by WordPress