Skip to content
Back home
  • Home
  • Research
    • Graph Analytics
      • Accelerating Subgraph Isomorphism Search Using Graphlets
      • ParaGrapher
      • MS-BioGraphs
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise and Approximate Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
      • FERNS
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
    • FERNS
  • Publications
    • Articles
    • Dissertations
    • Source Code
    • Datasets
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact
  • Search
Back home
  • Search
  • Home
  • Research
    • Graph Analytics
      • Accelerating Subgraph Isomorphism Search Using Graphlets
      • ParaGrapher
      • MS-BioGraphs
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise and Approximate Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
      • FERNS
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
    • FERNS
  • Publications
    • Articles
    • Dissertations
    • Source Code
    • Datasets
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact
Home » Graph Algorithms » GraphGrind » High-Performance Graph Processing Overview
GraphGrind Graptor Transprecision

High-Performance Graph Processing Overview

by Hans Vandierendonck|Published 1 December 2020

Hans presented the group’s work to date at IBM Zurich.

201201_IBM_Zurich_part1Download
201201_IBM_Zurich_part2Download
  • presentations

You may also like

Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning
Published 5 August 2017

Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning

https://doi.org/10.1109/ICPP.2017.27 This paper investigates how to improve the memory locality of graph-structured analytics on large-scale shared memory systems. We demonstrate that a […]

The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems (PhD Thesis)
Published 17 April 2018

The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems (PhD Thesis)

Thesis on QUB Pure PortalThesis in PDF Format Author: Jiawen Sun, https://www.linkedin.com/in/jiawen-sun-33b368103/ As shared memory systems support terabyte-sized main memory, they provide […]

Graph processing at the CSIT Summit
Published 9 May 2018

Graph processing at the CSIT Summit

The CSIT Summit brings together researchers and industry with an interest in cyber security challenges. Hans spoke about high-performance graph processing and […]

Best Poster Award at SIMULTECH 2025
Published 24 June 2025

Best Poster Award at SIMULTECH 2025

We are please to announce that Zohreh Moradinia has won the Best Poster Award at SIMULTECH 2025 for her work on “Machine […]

Post navigation

  • Previous post Half-Precision Floating-Point Formats for PageRank: Opportunities and Challenges
  • Back to post list
  • Next post Invited Talk: Parallel Algorithms for Density-Based and Structural Clustering – Dr Julian Shun
Links
  • Jobs
  • People
  • Contact
  • Articles

Meet us —
Prof. Hans Vandierendonck
Computer Science Building
Queen's University Belfast
16A Malone Road
Belfast BT9 5BN
Northern Ireland, UK
Tel: +44 (0)28 9097 4654

© 2026 DIPSA: Data-Intensive Parallel Systems and Algorithms – All rights reserved

Powered by WP – Designed with the Customizr Theme