Explore >> Select a destination
|
You are here 
|
moinakg.wordpress.com | ||
| | | | |
dougallj.wordpress.com
|
|
| | | | | CRC32 is a checksum first proposed in 1961, and now used in a wide variety of performance sensitive contexts, from file formats (zip, png, gzip) to filesystems (ext4, btrfs) and protocols (like ethernet and SATA). So, naturally, a lot of effort has gone into optimising it over the years. However, I discovered a simple update... | |
| | | | |
attractivechaos.wordpress.com
|
|
| | | | | TL;DR: With linear probing, we can delete elements from an open addressing hash table without tombstones. Here are the C and the C++ implementations. Introduction When implementing a hash table based on open addressing, we usually set a tombstone for each deleted element, which indicates a bucket used to have an element. These tombstones maintain... | |
| | | | |
toarca.com
|
|
| | | | | Content-defined chunking runs approximately as fast as gzip and can achieve compression ratios better than 100:1 on certain classes of data.[1] Suppose we have several webpages that frequently get updated, and we want to store every update of every page. The most naive way to do it would | |
| | | | |
binarydebt.wordpress.com
|
|
| | | In our last post we covered how x86 logical address is translated into linear address. In this one we will look at translation from linear to physical. We will use the terms 'virtual address' and 'linear address' interchangeably. A piece of hardware called paging unit is responsible for converting virtual addresses to physical. However, the... | ||
