What is a Swap File and How does It Work

A swap file is a disk space used when RAM is full, allowing virtual memory systems to manage memory effectively. It aids performance but can impact speed, especially under memory pressure.

Compiler Optimizations from O0 to Oz

The article by Yashwanth Naidu Tikkisetty explores various compiler optimization options, detailing their effects and uses. It provides an overview of how different options can influence the optimization process and performance of compiled code. By explaining the mechanisms behind these optimizations, the article aims to demystify the complexities of compiler settings for readers. The resource includes a linked PDF for a deeper dive into the topic, as well as a LinkedIn post for additional engagement. Overall, it serves as a valuable guide for understanding and navigating compiler optimizations effectively.

Loop Unrolling in RISC-V

Loop unrolling significantly enhances performance in embedded systems, particularly in RISC-V architectures. By reducing loop overhead and increasing instruction-level parallelism, it minimizes control operations. However, this technique increases code size, necessitating careful consideration for systems with memory constraints.

Data Hazard Stalls in Cache Memory

In the realm of computer architecture, particularly in the context of embedded systems, data hazard stalls are a critical challenge that can significantly impact the performance and efficiency of a system. This write up aims to dissect the concept of data hazard stalls, particularly in cache memory, using RISC-V assembly code examples to illustrate the […]

Pipelining in Cache Memory

𝗣𝗶𝗽𝗲𝗹𝗶𝗻𝗶𝗻𝗴 𝗶𝗻 the context of 𝗰𝗮𝗰𝗵𝗲 𝗺𝗲𝗺𝗼𝗿𝘆 is a critical concept in modern computing architectures, playing a pivotal role in enhancing the performance and efficiency of systems. It refers to the process of arranging the execution of commands in a way that overlaps different stages of instruction execution. This technique, when applied to cache memory, involves […]

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. […]

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

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 […]

What Are Registers?

Registers are essential components in computer architecture that hold data for quick access. Yashwanth Naidu Tikkisetty explores their significance in a concise and informative manner. Read the full article for a comprehensive understanding.

What is CACHE?

In computing, “cache” is a vital component that enhances processor speed and efficiency by storing frequently used data and program instructions. It leverages the principles of temporal and spatial locality to optimize data access. Caching offers benefits such as speed, reduced latency, and improved efficiency but comes with considerations like size, complexity, and cost.