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

Graptor Sources Published
Published 30 October 2021

Graptor Sources Published

Finally got around to this: publishing the Graptor source code. With time passing, the code has changed quite a bit compared to […]

Published 27 January 2025

New Paper Accepted in IEEE Transactions on Emerging Topics in Computing

Our group has published a new paper in the IEEE Transactions on Emerging Topics in Computing. In this study, we introduced Software-Defined […]

Software-Defined Floating-Point Number Formats and Their Application to Graph Processing – ICS’22
Published 15 June 2022

Software-Defined Floating-Point Number Formats and Their Application to Graph Processing – ICS’22

DOI: 10.1145/3524059.3532360 This paper proposes software-defined floating-point number formats for graph processing workloads, which can improve performance in irregular workloads by reducing […]

Published 15 June 2026

ConfigSpec at TDIS ’26: Configuration Selection Framework for Edge–Cloud LLM Inference

At the 4th International Workshop on Testing Distributed Internet of Things Systems (TDIS ’26), Babar Ali presented ConfigSpec: Profiling-Based Configuration Selection for […]

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