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

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

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

https://arxiv.org/abs/1806.06576 Graph partitioning drives graph processing in distributed, disk-based and NUMA-aware systems. A commonly used partitioning goal is to balance the number […]

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

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

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

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
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