What is Context Switching

The article explains context switching and details the roles of the scheduler and kernel during the process. It highlights how efficient context switching is crucial for multitasking in operating systems, allowing multiple processes to share system resources seamlessly. For further insights, the article is available in PDF format.

𝑪𝒂𝒄𝒉𝒆 𝑾𝒓𝒊𝒕𝒆 𝑻𝒉𝒓𝒐𝒖𝒈𝒉 𝒂𝒏𝒅 𝑪𝒂𝒄𝒉𝒆 𝑾𝒓𝒊𝒕𝒆 𝑩𝒂𝒄𝒌

Modern computing relies on the efficient interaction of components, particularly involving cache memory. This article explores the Write-Through and Write-Back strategies, detailing their operations, benefits, and drawbacks. Understanding these mechanisms enhances knowledge of the performance dynamics that underpin today’s digital environments.

Cache Read and Cache Write

A Short write-up on Cache Read and Cache Write LinkedIn Post: https://www.linkedin.com/posts/t-yashwanth-naidu_write-up-on-cache-read-and-cache-write-activity-7124733075783122944-O9sC?utm_source=share&utm_medium=member_desktop&rcm=ACoAACV39CcB7Pk0N7IuUB-8O0soOPWzMuYlnv8 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~An Article by: Yashwanth Naidu Tikkisetty~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Ellipsis and Variadic

In C, when a function is called, the arguments are typically placed onto the stack, a region of memory. The function retrieves these arguments from the stack based on the function’s known parameter list. But when the number of arguments is variable, the function needs a way to access these “extra” arguments from the stack. […]

𝑨 𝒅𝒆𝒕𝒂𝒊𝒍𝒆𝒅 𝒍𝒊𝒔𝒕 𝒐𝒇 𝑶𝑩𝑱𝑫𝑼𝑴𝑷 𝒄𝒐𝒎𝒎𝒂𝒏𝒅 𝒐𝒑𝒕𝒊𝒐𝒏𝒔

𝒐𝒃𝒋𝒅𝒖𝒎𝒑 is a command-line program that is part of the GNU Binutils suite of tools. It’s used primarily for displaying various information from object files, which are typically produced as intermediate files during the compilation of a program. objdump can show information from a wide range of object file formats, including ELF (Executable and Linkable […]

𝑴𝒆𝒎𝒐𝒓𝒚 𝑨𝒍𝒍𝒐𝒄𝒂𝒕𝒐𝒓𝒔 𝑷𝒂𝒓𝒕 – 𝟐

Memory allocation is like fitting puzzle pieces together in the world of computer programming. Every time a programmer uses commands like malloc or calloc, there’s a lot going on behind the scenes. It’s more than just asking for memory; it’s about making sure everything fits just right and works efficiently with the computer’s hardware. Consider […]

A Deep Dive Into Memory

Dynamic memory allocation functions like malloc(), calloc(), realloc(), and free() are crucial in programming. The improved version, dlmalloc(), is widely adopted due to its efficiency. When called, these functions trigger system calls like brk()/sbrk() and mmap() to allocate memory. Understanding these processes is essential for efficient memory management in programming.

Memory Allocators PART-II

The “Best Fit” strategy in memory allocation finds the closest match, reducing wasted memory and working well with diverse request sizes. However, it can lead to increased fragmentation over time. While efficient, it may result in many tiny, unusable spaces in memory, posing a trade-off between immediate efficiency and potential long-term fragmentation.

Memory Allocators PART-I

Memory allocation in embedded systems is crucial due to limited memory. Different algorithms like Sequential Fits, Best Fit, First Fit, Next Fit, Good Fit, Segregated Free Lists, Segregated Fits, Buddy System, Indexed Fits, and Bitmapped Fits optimize memory use based on various requirements. Each approach has its pros and cons, making them suitable for different scenarios.

FIND AND GREP

This post provides essential commands for navigating directories on Ubuntu/Linux, making directory navigation easier. The post includes commands for searching for specific patterns within files, filtering by file type, and excluding certain directories. Each command is accompanied by a brief explanation and example. This valuable resource can greatly enhance your Linux command line skills.