

<feed xmlns="http://www.w3.org/2005/Atom">
  <id>http://adeesh.in/</id>
  <title>adeesh.in</title>
  <subtitle>Thoughts on coding, books and life.</subtitle>
  <updated>2024-11-01T14:07:04+00:00</updated>
  <author>
    <name>Adeesh Kale</name>
    <uri>http://adeesh.in/</uri>
  </author>
  <link rel="self" type="application/atom+xml" href="http://adeesh.in/feed.xml"/>
  <link rel="alternate" type="text/html" hreflang="en"
    href="http://adeesh.in/"/>
  <generator uri="https://jekyllrb.com/" version="4.3.3">Jekyll</generator>
  <rights> © 2024 Adeesh Kale </rights>
  <icon>/assets/img/favicons/favicon.ico</icon>
  <logo>/assets/img/favicons/favicon-96x96.png</logo>


  
  <entry>
    <title>Performance of various strategies of condition based function call</title>
    <link href="http://adeesh.in/posts/Performance-of-callback-lookup/" rel="alternate" type="text/html" title="Performance of various strategies of condition based function call" />
    <published>2024-10-30T00:00:00+00:00</published>
  
    <updated>2024-10-30T00:00:00+00:00</updated>
  
    <id>http://adeesh.in/posts/Performance-of-callback-lookup/</id>
    <content src="http://adeesh.in/posts/Performance-of-callback-lookup/" />
    <author>
      <name>Adeesh Kale</name>
    </author>

  
    
    <category term="Cache" />
    
    <category term="memory organization" />
    
    <category term="optimization" />
    
    <category term="C" />
    
  

  
    <summary>
      





      So a situation came up at work, it’s a simple enough thing, but I decided that I did not know it thoroughly and in-depth. This post is a result of studying and experimenting for that.

Say we have a module in the “server” that takes a data as input and based on the command ID, calls the required handler. There’s 3 ways you can do this. Two of them being almost identical. Here’s the playground:




    </summary>
  

  </entry>

  
  <entry>
    <title>Accessing large memory in loops</title>
    <link href="http://adeesh.in/posts/A-quick-experiment-in-using-cache/" rel="alternate" type="text/html" title="Accessing large memory in loops" />
    <published>2024-10-21T00:00:00+00:00</published>
  
    <updated>2024-10-21T00:00:00+00:00</updated>
  
    <id>http://adeesh.in/posts/A-quick-experiment-in-using-cache/</id>
    <content src="http://adeesh.in/posts/A-quick-experiment-in-using-cache/" />
    <author>
      <name>Adeesh Kale</name>
    </author>

  
    
    <category term="Cache" />
    
    <category term="memory organization" />
    
    <category term="optimization" />
    
    <category term="C" />
    
  

  
    <summary>
      





      Going through a 2-D array seems trivial. There’s an inner loop and an outer loop. However, I finally got to understand some concepts I had learned in computer organization theory when I actually tried to access large 2-D array for image processing. Consider the following scenarios for a 2-D Integer array of 20megabytes:

int (*arr)[5000] = malloc(sizeof(int[5000][5000]));

// Loop 1 --
for (int...
    </summary>
  

  </entry>

  
  <entry>
    <title>An experiment in threading</title>
    <link href="http://adeesh.in/posts/An-Experiment-In-Threading/" rel="alternate" type="text/html" title="An experiment in threading" />
    <published>2024-10-17T00:00:00+00:00</published>
  
    <updated>2024-10-17T00:00:00+00:00</updated>
  
    <id>http://adeesh.in/posts/An-Experiment-In-Threading/</id>
    <content src="http://adeesh.in/posts/An-Experiment-In-Threading/" />
    <author>
      <name>Adeesh Kale</name>
    </author>

  
    
    <category term="Multi-threading" />
    
    <category term="parallel" />
    
    <category term="C" />
    
  

  
    <summary>
      





      An experiment in threading

Introduction

I was working on a toy code problem for a simulation for a small contest: We need to find with what probability any two random points chosen inside a square, if taken as the diameter of a circle, the circle will fall inside the square. I was not able to solve this theoretically, so thought, let’s have code solve it. Here’s the code I and my teammate cam...
    </summary>
  

  </entry>

  
  <entry>
    <title>A list of many freely available online references pertaining to topics in Embedded Development</title>
    <link href="http://adeesh.in/posts/A-List-Of-References/" rel="alternate" type="text/html" title="A list of many freely available online references pertaining to topics in Embedded Development" />
    <published>2024-04-06T00:00:00+00:00</published>
  
    <updated>2024-04-06T00:00:00+00:00</updated>
  
    <id>http://adeesh.in/posts/A-List-Of-References/</id>
    <content src="http://adeesh.in/posts/A-List-Of-References/" />
    <author>
      <name>Adeesh Kale</name>
    </author>

  
    
    <category term="References" />
    
    <category term="C" />
    
    <category term="AI" />
    
    <category term="ML" />
    
    <category term="OpenCL" />
    
    <category term="C++" />
    
  

  
    <summary>
      





      References to learn / revise concepts in C


  
    Beej’s C Guide
  
  
    GNU C Manual
  
  
    Eric S. Raymond’s “The Lost Art of Structure Packing”
  


Computer archtecture concepts


  YouTube playlist by Intermation


    </summary>
  

  </entry>

  
  <entry>
    <title>Pointers in C</title>
    <link href="http://adeesh.in/posts/Pointers-in-C/" rel="alternate" type="text/html" title="Pointers in C" />
    <published>2024-04-05T00:00:00+00:00</published>
  
    <updated>2024-04-05T00:00:00+00:00</updated>
  
    <id>http://adeesh.in/posts/Pointers-in-C/</id>
    <content src="http://adeesh.in/posts/Pointers-in-C/" />
    <author>
      <name>Adeesh Kale</name>
    </author>

  
    
    <category term="C" />
    
    <category term="Pointers" />
    
  

  
    <summary>
      





      [WIP]

The concept of pointer in C is one of the most feared concepts, but with a little bit of effort, it’s easily understood. However, even after understanding, because there are many small concepts, we need a quick reference that can help us recall the workings. I hope this post serves as both.

Q. What exactly is a pointer?

A. The K&amp;amp;R book provides the best succinct definition of a poi...
    </summary>
  

  </entry>

</feed>


