Scalable, Resilient Brainfuck
zserge.com
Scalable, Resilient Brainfuck
1–10 of 47 posts
Re: Scalable, Resilient Brainfuck
#2That's not enough, you should include a cache layer which key is the neighbor memory state of length 2k (give or take) and the instruction pointer. You can then simulate at most k instructions at once when hit, a steady improvement over non-cached verseion!
Re: Scalable, Resilient Brainfuck
#3:D
Re: Scalable, Resilient Brainfuck
#4It's a shame that looping and parsing is so tightly coupled.
Also you should add an ELK stack to centralize your logs and add some correlation ID to your instructions if anything goes wrong.
Re: Scalable, Resilient Brainfuck
#5> If you want to start learning a programming language - write a BF interpreter in it.
> [172 bytes minimal C implementation]
> Well, or something a bit more readable in ~100 lines of code.
Or something a bit less readable in under 104 bytes of binary lambda calculus [1]
[1] https://tromp.github.io/cl/Binary_lambda_calculus.html#Brain...
Re: Scalable, Resilient Brainfuck
#6So he is running clusters of brainf#ck machines in the cloud?
I think this can be legitimately called a Clusterf#ck.
Re: Scalable, Resilient Brainfuck
#7So he is running clusters of brainf#ck machines in the cloud? I think this can be legitimately called a Clusterf#ck.
F#ckernetes maybe?
Re: Scalable, Resilient Brainfuck
#8There's no HA here, so we need a K8S/Fargate cluster and the Postgres needs to be multi zone.
Re: Scalable, Resilient Brainfuck
#9It's funny because it's true :D
Re: Scalable, Resilient Brainfuck
#10Nothing says “I treat my software seriously” better than paying for its CPU usage from your own pocket.