HackerTube 中文?

Lecture 1 | Programming Paradigms (Stanford)

StanfordYouTube ↗

Further reading 1

Can one record tell you both now and then? →Two reads disagree. First ask which moment each value describes, then who can change it. Keeping history and coordinating writes solve different problems.This video helps answer · If replicas agree, did both operations survive?

Caption notes

Two ATMs may each see a sufficient balance. The shared account requires checking and debiting as one transaction, even if each machine performs its comparison correctly.

Video or transcript source ↗
Original passages · 2
That $100 account balance is the shared resource that two different processes have access to.
Lecture 1 | Programming Paradigms (Stanford) · ▶ 9:54–10:00
the account balance check and the withdrawal are basically done not at all or in full
Lecture 1 | Programming Paradigms (Stanford) · ▶ 10:05–10:14

Hacker News comments

View original on HN ↗