Shape Aware Parallel Mesh Simplification Algorithm

An implementation of HIP that works on CPUs, across OSes.

Large-scale, distributed, sparse linear algebra in Julia.

A Fast Parallel Algorithm for HDBSCAN* Clustering

Efficient implementations of Merge Sort and Bitonic Sort algorithms using CUDA for GPU parallel processing, resulting in accelerated sorting of large arrays. Includes both CPU and GPU versions, along with a performance comparison.

Basic parallel algorithms for Julia

Source code and datasets of "Efficient GPU-Accelerated Subgraph Matching", accepted by SIGMOD'23 - By Xibo Sun and Prof. Qiong Luo

Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays

Official implementation of the paper "HermesBDD: A Multi-Core and Multi-Platform Binary Decision Diagram Package" accepted @ DDECS 2023.

Parallel external memory suffix array construction

CUDA implementation of HFT components showcasing GPU acceleration for financial applications. Features limit order book with matching engine and parallel sorting for market data. Demonstrates significant performance gains over CPU implementations.

Parallel List Ranking for multicore processors

Parallel external memory construction of BWT from SA

MST: Parallel Minimum Spanning Forest

Algoritmi paralleli e distribuiti

Parallel Cholesky Factorization of a SPD Matrix with MPI

In this repository you can find all of my projects for Parallel Processing Course when I was in 2nd semester of my master's at SUT.

Implementations of the parallel and sequential cube sampling algorithms presented in the paper "A Scalable Parallel Algorithm for Balanced Sampling" (Alexander Lee, Stefan Walzer-Goldfeld, Shukry Zablah, Matteo Riondato, AAAI'22 Student Abstract).

Parallel computing with CUDA, OpenMP, MPI

Run-time improvements on the computation of the inner product for stabilizer states, using parallel and sparse implementations

DCL-115: Multi-Threaded Programming in C++17

A collection of my fragment shaders.

Distributed Java Applications at Scale, Parallel Programming, Distributed Computing

Parallel Biconnected Components

SIMPLE is a framework for implementation of parallel algorithms using our methodology for developing high performance programs running on clusters of SMP nodes. Our methodology is based on a small kernel (SIMPLE) of collective communication primitives that make efficient use of the hybrid shared and message passing environment. We illustrate the power of our methodology by presenting experimental results for sorting integers, two-dimensional fast Fourier transforms (FFT), and constraint-satisfied searching.

Everything and anything I could implement from the course Parallel Programming in FS21 at ETH Zurich.

SPAA'25: Parallel Point-to-Point Shortest Paths and Batch Queries

openoffice addon for graphical modelling of parallel algorithms

Implementation of Serial and Parallel Local Lazy Greedy for submodular b-matching

Repositorio de la asignatura Programación Paralela cursada en la UGR en el curso 20/21