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

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 […]

GraphGrind: Addressing Load Imbalance of Graph Partitioning
Published 5 June 2017

GraphGrind: Addressing Load Imbalance of Graph Partitioning

https://doi.org/10.1145/3079079.3079097 We investigate how graph partitioning adversely affects the performance of graph analytics. We demonstrate that graph partitioning induces extra work during […]

Published 25 November 2023

SIMD Bit Twiddling Hacks

The Bit Twiddling Hacks website collects an array of useful code fragments that implement some very specific computations very efficiently. Here we […]

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 […]

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