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 » Graph processing at the CSIT Summit
GraphGrind

Graph processing at the CSIT Summit

by Hans Vandierendonck|Published 9 May 2018

The CSIT Summit brings together researchers and industry with an interest in cyber security challenges. Hans spoke about high-performance graph processing and the relevance for addressing security problems.

189509_CSITSummit_graphsDownload
  • presentations

You may also like

Graph processing lecture at MaRIONet Summer School
Published 5 July 2018

Graph processing lecture at MaRIONet Summer School

https://manycore.org.uk/summerschool.html The Manycore Summer School gives researchers an opportunity to learn theory and practice in a range of emerging manycore technologies, from […]

High-Performance Graph Processing Overview
Published 1 December 2020

High-Performance Graph Processing Overview

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

GraphGrind Source Code
Published 12 August 2017

GraphGrind Source Code

The following git repository contains source code of GraphGrind https://github.com/DIPSA-QUB/GraphGrind

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

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

https://doi.org/10.1145/3293883.3295703 This work proposes Vertex- and Edge-Balanced Ordering (VEBO): balance the number of edges and the number of unique destinations of those […]

Post navigation

  • Previous post The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems (PhD Thesis)
  • Back to post list
  • Next post VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing
Links
  • Jobs
  • People
  • Contact
  • Articles

Meet us —
Prof. Hans Vandierendonck
School of Electronics, Electrical Engineering and Computer Science
Queen’s University Belfast
Computer Science Building
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