(This is a translation of the original article in Japanese by moratorium08.)
(UPDATE (22/3/2019): Added some corrections provided by the original author.)
Writing your own OS to run on a handmade CPU is a pretty ambitious project, but I've managed to get it working pretty well so I'm going to write some notes about how I did it.
| There Will Be Blood | |
| Spirited Away | |
| Million Dollar Baby | |
| A Touch of Sin | |
| The Death of Mr. Lazarescu | |
| Yi Yi | |
| Inside Out | |
| Boyhood | |
| Summer Hours | |
| The Hurt Locker |
| --- Paxos Proposer --- | |
| 1 proposer(v): | |
| 2 while not decided: | |
| 2 choose n, unique and higher than any n seen so far | |
| 3 send prepare(n) to all servers including self | |
| 4 if prepare_ok(n, na, va) from majority: | |
| 5 v' = va with highest na; choose own v otherwise | |
| 6 send accept(n, v') to all |
| gcloud compute copy-files --zone <zone> <host>:<path>/<binary> /tmp/<binary>.sym | |
| gcloud compute ssh --zone <zone> <host> --ssh-flag="-L <port>:localhost:<port>" --ssh-flag="-N" --ssh-flag="-n" | |
| go tool pprof -lines /tmp/<binary>.sym http://localhost:<port>/debug/pprof/heap |
| TLA+ Discussion | |
| https://groups.google.com/forum/#!topic/tlaplus/n00Uf-3dkxY, What does it mean for a behavior to end? | |
| Cross Validated | |
| http://stats.stackexchange.com/questions/251496/why-sum-of-squared-errors-for-logistic-regression-not-used-and-instead-maximum-l | |
| http://stats.stackexchange.com/questions/66199/maximum-likelihood-curve-model-fitting-in-python | |
| http://stats.stackexchange.com/questions/16921/how-to-understand-degrees-of-freedom | |
| http://stats.stackexchange.com/questions/254282/completing-a-3x3-correlation-matrix | |
| http://stats.stackexchange.com/questions/5747/if-a-and-b-are-correlated-with-c-why-are-a-and-b-not-necessarily-correlated |
| INIT | |
| Init | |
| NEXT | |
| Next | |
| INVARIANT | |
| TypeOK |
| INIT | |
| Init | |
| NEXT | |
| Next |
| ---- MODULE GCD ---- | |
| EXTENDS Integers, TLC | |
| Divides(p, n) == \E q \in -1000..1000 : n = q * p | |
| DivisorsOf(n) == {p \in -1000..1000 : Divides(p, n)} | |
| SetMax(S) == CHOOSE i \in S : \A j \in S : i >= j |
| INIT | |
| Init | |
| NEXT | |
| Next | |
| INVARIANT | |
| TypeOK |
| INIT | |
| Init | |
| NEXT | |
| Next | |
| INVARIANT | |
| TypeOK | |
| CONSTANTS |