Skip to primary content

DIPSA: Data-Intensive Parallel Systems and Algorithms

DIPSA: Data-Intensive Parallel Systems and Algorithms

Main menu

  • Home
  • Research
    • High-Performance Graph Processing
      • ParaGrapher
      • MS-BioGraphs
      • Subgraph Isomorphism
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
  • Publications
    • Articles
    • Dissertations
  • Source Code & Datasets
    • Source Code
    • Datasets
    • Technical Posts
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact

Technical Posts

  • Random Vertex Relabelling in LaganLighter21 August 2024
  • Minimum Spanning Forest of MS-BioGraphs9 August 2024
  • Topology-Based Thread Affinity Setting (Thread Pinning) in OpenMP3 August 2024
  • An (Incomplete) List of Publicly Available Graph Datasets/Generators21 June 2024
  • An Evaluation of Bandwidth of Different Storage Types (HDD vs. SSD vs. LustreFS) for Different Block Sizes and Different Parallel Read Methods (mmap vs pread vs read)20 April 2024
  • SIMD Bit Twiddling Hacks25 November 2023
  • LaganLighter Source Code14 November 2022

This website is licensed under a Creative Commons Attribution 4.0 International License.

Proudly powered by WordPress