Technology

In this blog post, we explore the mathematical underpinnings of contraction algorithms and their role in transforming sequential algorithms into Work efficient parallelizable constructs.

In this post, we explore the limits of parallel computing for algorithm speed-up, focusing on the role of task granularity and the advantages of using constant input thresholds in hybrid parallel-sequential approaches.

GraphBLAS leverages sparse matrix computations in an extended algebra of semirings, providing a scalable and efficient framework for expressing graph algorithms through linear algebra.

Explore the application of DSL transformations for preserving hierarchical rules and metadata in JSON schemas while simultaneously enhancing their usability through structural simplification.

This post explores my use of Obsidian, a markdown-based note-taking tool, for long-term learning. I highlight some of its key features and assess its suitability for diverse learning interests.