Latest demo: collaborative text editing synchronized with a conflict-free data structure.

The data structure ensures that insertions, edits, and deletions are properly merged during synchronization. Even if the changes were made offline. 1/

When analyzing branch prediction algorithms, the "better" hashing approach (gshare) is theoretically worse than the simple one (concatenation).

What's going on?

Branch instructions like if statements create another challenge: workers don't know what to work on next. Instead of waiting, they guess what to do next - even if they might have to throw away their work. This is called branch prediction. 4/5

But what happens when a worker needs a part that's still being worked on? The whole line has to pause - this is called a data hazard. 3/5

With pipelining, each worker begins the next task as soon as they finish. Just like an assembly line, throughput increases dramatically. 2/5

Let's explain CPU pipelining using an assembly line metaphor. In a basic CPU, only one worker is active. The others must wait until the entire instruction completes before starting the next one. 1/5