Set Drawing Language

Post author: Programelot
Post link: https://programelot.github.io/projects/
Copyright Notice: All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/3.0/" rel="external nofollow" target="_blank">CC BY-NC-SA 3.0 unless stating additionally.

Drawing a venn diagram isn't that hard.
However, drawing a venn diagram from a formula may complex.
Therefore, this project supports a language that can draw how venn diagram looks like.
This project was made for 3 set but it can be extended to more sets if there are possible way to draw it properly.

GPU utilization

Most of time, GPU sufferes from a lack of memories.
There are many techniques that tries to optimize memory.
However, utilizing GPU memory is a hard problem.
This study was done for studying about algorithmic approach to determine a good memory ordering for a gpu utilization.
It suggests an approach that tries to determine the memory fetching order to increase memory re-usage in a circular memory requirement.
It also suggests at least 2 and at most 1.5 approximation algorithm to solve this problem.

Matrix Multiplication Optimization

This study is about optimization especially focused on the matrix multiplication.
Matrix mutliplication is a topic that has been studied for decades.
This study was done from paper reviews about matrix mutliplication.

Supernodal Floyd-Warshall

This project is a revisit and re-implementation of the PPoPP '20 paper A Supernodal All-Pairs Shortest Path Algorithm.
The key idea is to exploit graph sparsity in Floyd-Warshall by importing techniques from sparse Cholesky factorization: fill-in reducing ordering, symbolic analysis, supernodal traversal, and elimination tree parallelism.
For sparse graphs with small separators (e.g., planar graphs), this reduces the work from $O(n^3)$ to $O(n^2|S|)$ while preserving good parallel scalability.