<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Concurrent Programming on grzenow</title><link>http://www.grzenow.com/categories/concurrent-programming/</link><description>Recent content in Concurrent Programming on grzenow</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 25 Jun 2024 00:00:00 +0000</lastBuildDate><atom:link href="http://www.grzenow.com/categories/concurrent-programming/index.xml" rel="self" type="application/rss+xml"/><item><title>High Performance Computing projects</title><link>http://www.grzenow.com/projects/hpc-projects/</link><pubDate>Tue, 25 Jun 2024 00:00:00 +0000</pubDate><guid>http://www.grzenow.com/projects/hpc-projects/</guid><description>&lt;p&gt;During the first year of master&amp;rsquo;s studies, I attended an HPC course and completed two major assignments: one utilizing CUDA and the other using MPI.&lt;/p&gt;&#10;&lt;h3 id="matching-in-genome-variant-databases"&gt;&#10; Matching in genome variant databases&#10; &lt;a class="heading-link" href="#matching-in-genome-variant-databases"&gt;&#10; &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;&#10; &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;&#10; &lt;/a&gt;&#10;&lt;/h3&gt;&#10;&lt;p&gt;The goal was to implement a system for matching genomic variants from a file agains a database (dbNSFP). The solution consists of two phases: database indexing and matching, with the matching phase optimized using CUDA.&lt;/p&gt;</description></item><item><title>Executor</title><link>http://www.grzenow.com/projects/executor/</link><pubDate>Sat, 11 Feb 2023 00:00:00 +0000</pubDate><guid>http://www.grzenow.com/projects/executor/</guid><description>&lt;p&gt;&lt;strong&gt;Executor&lt;/strong&gt; is a concurrent programming project. It is a program that executes tasks, monitors their latest outputs (during execution) and terminates them if desired.&lt;/p&gt;&#10;&lt;p&gt;The handling of processes has been synchronized in such a way that the Executor immediately informs about task completion and continuously cleans up finished processes or threads it creates. All of this is done without using busy waiting, ensuring CPU resources are not wasted.&lt;/p&gt;&#10;&lt;p&gt;A detailed task description (in Polish, though) can be found at the GitHub link below.&lt;/p&gt;</description></item></channel></rss>