
A program can be written in many different ways, (hopefully) always obtaining the same result. Still, the execution time may differ drastically. In higher languages like Python, one may not tell instantly, how a predefined function is implemented.
DNA sequence alignment algorithms use heuristics methods in order to cope with the high volume of data that is passed to them. These approaches, usually run on super computing clusters, take days to finish due to the amount of data, …
Hello everybody!I am really excited writing this blog post – I have some cool stuff I want to share with you.If you missed last time’s post, I described what the project is about and mentioned one optimization for the serial …
Code. Run. Drink. Repeat. Parallel codes on HPC systems Read More »
Hello again, this time from my hometown of Kavadarci, and welcome to my second blog post about my remote, summer internship at the CINECA research center in Bologna. As I have already described in my previous post, this summer I …
A project on monitoring HPC scheduler job queues (i.e. displaying jobs on simple graphs) seems too easy right? Well… I can assure you it’s not BUT good news, I have made it a bit easier for people who want to deploy a monitoring system for such jobs!
When at first my supervisor told me that he wanted no job run times to be under-predicted, the task seemed daunting, almost impossible. How could I make sure that my algorithm never erred in such a way? In this post I explain how I tackled this problem and how the classical accuracy metric can be misleading and even futile in certain machine learning environments.
Hey Everyone! I’m Cathal from the west of Ireland. I have recently competed a BSc in Computer Science and am intrigued by HPC and all it’s potential. Read on to find out more!