skyde

14 ms·

121.
by skyde 4y ago
In Linux kernel, Different memory cgroups have distinct lruvecs, for memcg reclaim. This mean global reclaim algorithm can look at all cgroup "memory.low", and reclaim first from cgroups that are using more than their "memor
122.
by skyde 4y ago
I mean think of low priority service as services that are not latency sensitive (background jobs). you want those low priory cgroup to use the extra memory if it’s available (not used by a high priority cgroup) it a high priority cgroup nee
123.
by skyde 4y ago
good summary!
124.
by skyde 4y ago
I don’t agree on the recommendation for memory « Always set your memory requests equal to your limits » you can layer high priority service and low priority service better if you use some buffer.
125.
by skyde 4y ago
I have zero issue with FDB but some worry about mvSQLite. After reading more about the design it seem to use FDB to store Pages and using FDB transaction to make those update have have Strict serializable isolation. This would work correctl
126.
by skyde 4y ago
yes Quic is not just HTTP. its a connection protocol
127.
by skyde 4y ago
this terraform? https://www.terraform.io/
128.
by skyde 4y ago
so FoundationDB is user as a file system for storing SQlite files? In this case, the write contention performance would not be much better than using SQLite over SMB.
129.
by skyde 4y ago
what is mycelia’s?
130.
by skyde 4y ago
you mean swap drive ?
131.
by skyde 4y ago
Because Apple silently refused to approve all app using flash internally. This was war between apple and adobe.
132.
by skyde 4y ago
This: "Flash had a very unique set of functional/creative affordances that have never since been replicated in an authoring tool". It was extremely to do a UI application with Flexbuilder, very similar to using VisualBasic 6.
133.
by skyde 4y ago
what does confront provide that Rust does not? i’m assuming Cppfront is breaking backward compatibility with old c++ codebase.
134.
by skyde 4y ago
http 2.0 has keep alive!
135.
by skyde 4y ago
thanks for considering the feedback! What i was trying to explain is Server not giving up is never a good thing under congestion. This is why in ip switches they drop packet when the outbound queue is full. And letting the caller retry sen
136.
by skyde 4y ago
TLDR: "Nginx will fail by refusing or dropping connections, Caddy will fail by slowing everything down" To me it seem that Caddy suffer from BufferBloat. Under heavy congestion the goodput (useful throughput) will drop to 0 becau
137.
by skyde 4y ago
Exactly I assumed everybody knew this. A lot of important surgery .. got postponed by hospitals because of lock-down.
138.
by skyde 4y ago
definitely micro-kernel (something like L4 OS). Also we should be able to isolate process from each other as if they are running inside a true VM. For example: one process trying to use all the memory on the machine should evict its own mem
139.
by skyde 4y ago
are you talking about something similar to micropython for micro controller?
140.
by skyde 4y ago
oh so your talking about using the database as a file system and moving all the query logic in the client
141.
by skyde 4y ago
with good index you will not scan more rows. But each query will use a different copy of the same data instead of joining with the same copy. Storing both copy in memory take more space so you can’t cache as much in memory. I’m not talking
142.
by skyde 4y ago
by "no FK contraints" do you mean "no join using index" or you simply mean foreign key violation is not checked.
143.
by skyde 4y ago
they always been faster! When you have 5NF, the database is smaller and all the row you join will be in memory in the SQL server PageCache. While when using denormalized database, your read will have to go to the disk.
144.
by skyde 4y ago
facebook data model is a Graph where each row store one object “comment” or one association “comment is with post id” between objects . They made an query and indexing system on top of it to make it fast called TAO. Without it you need to
145.
by skyde 4y ago
prohibit using JOIN statements is really cargo cult :-) Join is simply an index scan. And is guaranteed to be cheaper then the ORM having to send many request to the server.
146.
by skyde 4y ago
yep sorry
147.
by skyde 4y ago
so in your example the database thread is the Redis thread and the worker thread are your http server thread I assume. This is a good analogy, but there are still lot of wire heavy scenario a real database like postgresql or mysql will have
148.
by skyde 4y ago
Check out cirrusDB, its pretty much the same thing as Vitess but for PostgreSQL https://docs.microsoft.com/en-us/azure/postgresql/hyperscale...
149.
by skyde 4y ago
the only way to do an "atomic increment operation" is to use the "Watch" command or to write stored procedure. Watch is a poor man transaction and stored procedure does not work when you need to read value interactively
150.
by skyde 4y ago
it’s usually done using the outbox pattern. i’m not sure if this pattern can be called a type of saga. you basically have a tiny queue in you db using a special table that you drain to an external queue server.

More ›