#memory allocation

The fundamental difference between arrays and linked lists is that arrays are static data structures while linked lists are dynamic data structures. A static data structure needs all of it’s resources to be allocated when the structure is created – meaning even if the structure was to grow or shrink in size and elements needed to be added or removed – it always needs a given size and amount of memory. So if more elements need to be added to a static data structure and it didn’t have that memory. you’d need to copy the data of that array and recreate it with more memory so you could add more elements to it. Whereas a dynamic data structure can shrink and grow in memory. It doesn’t need a set amount of memory to be allocated in order to exist and it’s size and shape can change – the amount of memory it needs can change as well.

Introduction Have you ever wondered what goes on behind the scenes when you run a query in SQL Server? One key piece of the puzzle is the tempdb system database. In this article, we’ll take a peek under the hood to understand how and why SQL Server allocates space in tempdb during query execution. We’ll also explore how enabling read committed snapshot isolation (RCSI) affects tempdb size. By…

Fast, Bump-Allocated Virtual DOMs with Rust and Wasm

Dodrio is a virtual DOM library written in Rust and WebAssembly. It takes advantage of both Wasm’s linear memory and Rust’s low-level control by designing virtual DOM rendering around bump allocation. Preliminary benchmark results suggest it has best-in-class performance.

Background Virtual DOM Libraries

Virtual DOM libraries provide a declarative interface to the Web’s imperative DOM. Users…

Memory Allocation OS Memory Management

  Memory allocation, The main memory must accommodate both the operating system and the various user processes. We need to allocate different parts of the main memory in the most efficient way possible.

The main memory is usually divided into two partitions: one for the resident operating system, and one for the user processes. We may place the operating…

Pointers: As you know every variable is a memory location and every memory location has its address defined which can be accessed using ampersand (&) operator which denotes an address in memory. Consider the following which will print the address of the variables defined − #include using namespace std; int main () { int var1; char var2[10]; cout << "Address of var1 variable: "; cout << &var1 <<…

If one took a naïve approach to this (such as assuming that all target devices would have the same granularity), you could easily get a working program that runs without bugs, and you might not even have problems with varying granularities if the data you’re buffering fits exactly an n squared size. However, if you don’t account for it, and you have any potential variation in data scale (as is almost guaranteed in any real-world application) your client will pop up errors in systems that don’t exactly match your own (which is also almost guaranteed for any real-world distribution of software).