Repositories
System Design
Consistent hashing implementation using MD5 & RB trees (C++) - GITHUB link
Message queue implementation (C++) - GITHUB
Hilbert space filling curve implementations (C and others) Link
Courses
Bonjour & Welcome
Bio
Readers
Popular Posts
-
I ran into this error when I was creating a new clientspec and tried to checkout a new tree with this clientspec. I was using p4 sync ... ...
-
From the kernel definition there are three macros: IS_ERR - used to check, Returns non-0 value if the ptr is an error. Otherwise 0 if it’...
-
Why do you see that print "Scheduling while atomic" indicates that you've tried to sleep somewhere that you shouldn't - l...
-
Summary WiFi Aware - service discovery that helps setup WiFi Direct links. BLE - service discovery and P2P connection. WiFi Direct - P2P...
-
Ran into this irritating problem when everything was initially working fine on my system. I had copy pasted something into the command win...
-
Before we jump into the different type of AMSDUs supported, let us do a quick recap of where AMSDUs fit in with the aggregation hierarchy. H... -
Why bother? If you are writing a new kernel module or adding configurability to an existing one, typically you need some means by which you...
-
WiFi MAC architecture supports aggregation at two layers. The MAC service data units (MSDUs) can be aggregated to form AMSDUs. Each ... -
The equivalent of p4 shelve on GIT is stashing. Say I have modified the file on my repository and I see the following: techmuser@gw2:...
-
Nagle's algorithm is a TCP optimization in the kernel stack that waits to aggregate small chunks of bytes before sending packets on a T...