I'm reminded of Test Pilota Pirx, a polish movie, filmed in part in the US. There's some car chase scenes in american roads, and one scene where the main character gets a beer at a McDonald's[0] while looking around in a mall. I don't know much about the history of censorship but I was surprised as I imagined that would be out of line then
I don't watch a ton of films with noticeable fake grain. Even the ones that do fake it, it's barely perceptible, so I wouldn't care on those—not many of them are emulating the huge, obvious grain of high-sensitivity '60s and '70s film, for instance. A lot of what I watch is from the '90s or earlier, so the grain's real.
I tried looking for papers on the subject but couldn't find much. There recent research about in-memory B-tree, and there is has been shown that smaller pages (sizes as low as 256/512B) are more performant due to better cache behavior[0]. The general wisdom seems to be that disk-based databases' IO performance is the main bottleneck—but again I couldn't find any concrete data/benchmarks about why those higher sizes were chosen.
Nice! I actually worked on this recently for my bachelor project. We got some promising preliminary results that showed performance gains on B-trees by using "delegation" on top of optimistic lock coupling.
The way delegation locks work is by having threads delegate their critical function instead of getting exclusive access to shared memory. Think of a client/server model, where the server executes other core's critical sections. For machines with very high core counts, the result is that the shared memory remains valid in the delegate's cache, instead of each new lock holder getting cache misses and fetching memory from other cores (or worse, other sockets).
Indeed, generally delegation has become to mean that there is a dedicated server thread that executes critical sections. Where as combining indicates that any thread can become a combiner while acquiring a lock, for a certain period of time. For the project, we used queue-based combining, which seems to be similar to the the lock in the paper.
I'm a new graduate with a strong curiosity for technology and computer science, mainly looking for opportunities in systems programming or backend development.
One thing that keeps on giving for me me is being able to watch some random youtube video like its nothing. I can click on a random 200 view video from 12 years ago and scrub through it basically no latency. Thinking about how every little packet goes up and down the stack and around the world... The whole infrastructure to make it so seamless.
Meanwhile watching a video from an external drive or my wired SMB NAS fails half the time :|
I tried Orion for a bit but unfortunately it is still a bit too unstable. The one bug that made me put it aside for now was Orion maxing out a CPU for no reason (while locked) and coming to my macbook burning to the touch with almost no battery. This happened to me twice. Otherwise the browser is really good
>Easily record and share AI-powered video messages with your teammates and customers to supercharge productivity
This is the first thing you see when visiting the website. Ctrl+F finds "AI" 10 times in the page. Like the other commenter said, it probably has nothing to do with AI, but this is what sells at the moment
