Tradeoffs in Implementing Primary backup
Describes a fundamental approach to fault tolerance through primary-backup replication, where a primary server handles requests and backs up its state to secondary servers.
Describes a fundamental approach to fault tolerance through primary-backup replication, where a primary server handles requests and backs up its state to secondary servers.
This is the codebase for the paper: “Less is More: Recursive Reasoning with Tiny Networks”. TRM is a recursive reasoning approach that achieves amazing scores of 45% on ARC-AGI-1 and 8% on ARC-AGI-2 using a tiny 7M parameters neural network.
Presents a replication strategy that achieves high throughput and availability while providing strong consistency guarantees, forming the basis for many modern distributed storage systems.
a wonderful blog at a inhouse solution, deeper links to look at as well
By Debashish - https://x.com/debasishg/status/1967908410302796031
https://x.com/sadernoheart/status/1976364231332397425
https://x.com/sadernoheart/status/1976364231332397425
A comprehensive tutorial on programming in assembly using the iconic Game Boy, teaching the basics of computer science in a fun and engaging way.
John L. Hennessy (Author), David A. Patterson (Author)
https://x.com/ludwigABAP/status/1873845449196790080
https://x.com/iHR4K/status/1892712182950793640
https://x.com/vaibhaw_vipul/status/1898015541643882789
https://dsf.berkeley.edu/papers/fntdb07-architecture.pdf
This is the sequel to Writing An Interpreter In Go and this time we’re writing a compiler and a virtual machine for Monkey. Same codebase, same approach, new goals. Code front and center, step by step explained, fully unit tested and runnable.
Presents the fundamental principle that certain functions must be implemented end-to-end and cannot be completely satisfied by lower levels. This shapes how communication protocols are designed in distributed systems.
Shows how theoretical distributed systems concepts are implemented in a real-world system Good case study of applying theory to practice
Alternative presentation of vector clocks Introduces the concept of consistent cuts and global snapshots
Implementation of Byzantine fault tolerance for real systems More difficult, but provides practical implementation techniques
Practical techniques for implementing and optimizing vector clocks Discusses various implementation tradeoffs
The paper explores how to actually implement distributed algorithms in real computer systems using Remote Procedure Calls (RPCs)
https://github.com/calmsacibis995/svr4-src/blob/main/cmd/spell/huff.c#L105 https://github.com/calmsacibis995/svr4-src/blob/main/cmd/spell/huff.c#L83 https://substack.com/@abhinavupadhyay/p-154139305
This paper introduces fundamental concepts about achieving consensus in distributed systems with potentially faulty components
Introduces vector clocks, which capture causality more precisely than scalar clocks
virtualization , concurrency and persistence
definitive guide for the unix system programming
The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators.
A non-comprehensive and opinionated guide to best monitor for programming
How do you fit a dictionary in 64kb RAM? Unix engineers solved it with clever data structures and compression tricks. Here’s the fascinating story behind it.
its intended audience is everyone from performance engineers and practical algorithm researchers to undergraduate computer science students who have just finished an advanced algorithms course and want to learn more practical ways to speed up a program than by going from O ( n log n ) O(nlogn) to O ( n log log n ) O(nloglogn).
A categorized list of C++ resources. Contribute to MattPD/cpplinks development by creating an account on GitHub.
A categorized list of C++ resources. Contribute to MattPD/cpplinks development by creating an account on GitHub.