frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Provide agents with automated feedback

https://banay.me/dont-waste-your-backpressure/
105•ghuntley•1d ago•35 comments

Show HN: Pdfwithlove – PDF tools that run 100% locally (no uploads, no back end)

https://pdfwithlove.netlify.app
18•pratik227•2h ago•11 comments

Gaussian Splatting – A$AP Rocky "Helicopter" music video

https://radiancefields.com/a-ap-rocky-releases-helicopter-music-video-featuring-gaussian-splatting
570•ChrisArchitect•13h ago•175 comments

Flux 2 Klein pure C inference

https://github.com/antirez/flux2.c
302•antirez•13h ago•113 comments

Show HN: AWS-doctor – A terminal-based AWS health check and cost optimizer in Go

https://github.com/elC0mpa/aws-doctor
9•elC0mpa•2h ago•1 comments

Dead Internet Theory

https://kudmitry.com/articles/dead-internet-theory/
221•skwee357•10h ago•270 comments

A Social Filesystem

https://overreacted.io/a-social-filesystem/
358•icy•22h ago•155 comments

Fil-Qt: A Qt Base build with Fil-C experience

https://git.qt.io/cradam/fil-qt
71•pjmlp•2d ago•39 comments

AVX-512: First Impressions on Performance and Programmability

https://shihab-shahriar.github.io//blog/2026/AVX-512-First-Impressions-on-Performance-and-Program...
49•shihab•5d ago•10 comments

Gas Town Decoded

https://www.alilleybrinker.com/mini/gas-town-decoded/
102•alilleybrinker•4d ago•93 comments

Simulating the Ladybug Clock Puzzle

https://austinhenley.com/blog/ladybugclock.html
16•azhenley•1d ago•2 comments

The Code-Only Agent

https://rijnard.com/blog/the-code-only-agent
41•emersonmacro•4h ago•24 comments

Show HN: Dock – Slack minus the bloat, tax, and 90-day memory loss

https://getdock.io/
108•yadavrh•10h ago•82 comments

Experiments with Kafka's head-of-line blocking (2023)

https://www.artur-rodrigues.com/tech/2023/03/21/kafka-head-of-line-blocking.html
5•teleforce•5d ago•0 comments

Astrophotography visibility plotting and planning tool

https://airmass.org/
17•NKosmatos•3d ago•3 comments

Using proxies to hide secrets from Claude Code

https://www.joinformal.com/blog/using-proxies-to-hide-secrets-from-claude-code/
67•drewgregory•5d ago•24 comments

How to wrangle non-deterministic AI outputs into conventional software? (2025)

https://www.domainlanguage.com/articles/ai-components-deterministic-system/
32•druther•3d ago•21 comments

Command-line Tools can be 235x Faster than your Hadoop Cluster (2014)

https://adamdrake.com/command-line-tools-can-be-235x-faster-than-your-hadoop-cluster.html
348•tosh•22h ago•228 comments

Show HN: I quit coding years ago. AI brought me back

https://calquio.com/finance/compound-interest
64•ivcatcher•6h ago•42 comments

Show HN: Intent Layer: A context engineering skill for AI agents

https://www.railly.dev/blog/intent-layer/
4•Hunter17•2h ago•1 comments

High-speed train collision in Spain kills at least 21

https://www.bbc.com/news/articles/cedw6ylpynyo
78•akyuu•7h ago•49 comments

Poking holes into bytecode with peephole optimisations

https://xnacly.me/posts/2026/purple-garden-first-optimisations/
22•xnacly•4d ago•0 comments

The space and motion of communicating agents (2008) [pdf]

https://www.cl.cam.ac.uk/archive/rm135/Bigraphs-draft.pdf
18•dhorthy•3d ago•1 comments

Police Invested Millions in Shadowy Phone-Tracking Software Won't Say How Used

https://www.texasobserver.org/texas-police-invest-tangles-sheriff-surveillance/
295•nobody9999•10h ago•85 comments

Show HN: Lume 0.2 – Build and Run macOS VMs with unattended setup

https://cua.ai/docs/lume/guide/getting-started/introduction
118•frabonacci•13h ago•32 comments

Sins of the Children

https://asteriskmag.com/issues/07/sins-of-the-children
137•maxall4•14h ago•67 comments

The Cathedral, the Megachurch, and the Bazaar

https://opensourcesecurity.io/2026/01-cathedral-megachurch-bazaar/
156•todsacerdoti•5d ago•122 comments

Show HN: Beats, a web-based drum machine

https://beats.lasagna.pizza
64•kinduff•9h ago•19 comments

Predicting OpenAI's ad strategy

https://ossa-ma.github.io/blog/openads
527•calcifer•16h ago•458 comments

A free and open-source rootkit for Linux

https://lwn.net/SubscriberLink/1053099/19c2e8180aeb0438/
190•jwilk•21h ago•40 comments
Open in hackernews

Understanding the Go Scheduler

https://nghiant3223.github.io/2025/04/15/go-scheduler.html
180•gnabgib•8mo ago

Comments

90s_dev•8mo ago
I heard that the scheduler is a huge obstacle to many potential optimizations, is that true?
NAHWheatCracker•8mo ago
In some ways, yes. If you want to optimize at that level you ought to use another language.

I'm not a low level optimization guy, but I've had occasions where I wanted control over which threads my goroutines are running on or prioritizing important goroutines. It's a trade off for making things less complex, which is standard for Go.

I suppose there's always hope that the Go developers can change things.

silisili•8mo ago
You can kinda work around this though. runtime package has a LockOSThread that pins a goroutine to its current thread and prevents others from using it.

If you model it in a way where you have one goroutine per os thread that receives and does work, it gets you close. But in many cases that means rearching the entire code base, as it's not a style I typically reach for.

naikrovek•8mo ago
That sounds a lot like just using another language.
silisili•8mo ago
It's really not that bad. If you have a codebase in Go you can speed up, it's fine.

That said, if you're greenfielding and see this as a limitation to begin with, picking another language is probably the right way.

jerf•8mo ago
If you need it here or there, no. I've got a use case where I need a single locked thread for a particular syscall's functionality. It's not like it leaks out into the rest of the program and everything else has to change to accomodate it.

If you need it pervasively, Go may not be the correct choice. Then again, the list of languages that is not a correct choice in that case is quite long. That's a minority case. An important one, but a minority one.

jasonthorsness•8mo ago
It's always a sign of good design when something as complex as the scheduler described "just works" with the simple abstraction of the goroutine. What a great article.

"1/61 of the time, check the global run queue." Stuff like this is a little odd; I would have thought this would be a variable dependent on the number of physical cores.

01HNNWZ0MV43FF•8mo ago
That's so funny. I just saw `61` in the Tokio code with a comment "copied this from Go"
__turbobrew__•8mo ago
Make sure you set GOMAXPROCS when the runtime is cgroup limited.

I once profiled a slow go program running on a node with 168 cores, but cpu.max was 2 cores for the cgroup. The runtime defaults to set GOMAXPROCS to the number of visible cores which was 168 in this case. Over half the runtime was the scheduler bouncing goroutines between 168 processes despite cpu.max being 2 CPU.

The JRE is smart enough to figure out if it is running in a resource limited cgroup and make sane decisions based upon that, but golang has no such thing.

xyzzy_plugh•8mo ago
Relevant proposal to make GOMAXPROCS cgroup-aware: https://github.com/golang/go/issues/73193
robinhoodexe•8mo ago
Looks like it was just merged btw.
yencabulator•8mo ago
This should be automatic these days (for the basic scenarios).

https://github.com/golang/go/blob/a1a151496503cafa5e4c672e0e...

jasonthorsness•8mo ago
uh isn't that change 3 hours old?
yencabulator•8mo ago
Oh heh yes it is. I just remembered the original discussion from 2019 (https://github.com/golang/go/issues/33803) and grepped the source tree for cgroup to see if that got done or not, but didn't check when it got done.

As said in 2019, import https://github.com/uber-go/automaxprocs to get the functionality ASAP.

jasonthorsness•8mo ago
super-weird coincidence but welcome, I have been waiting for this for a long time!
williamdclt•8mo ago
I honestly can’t count on my fingers and toes how many times something very precisely relevant to me was brought up or sorted out hours-to-days before I looked it up. And more often than once, by people I personally knew!

Always a weird feeling, it’s a small world

formerly_proven•8mo ago
This is probably going to save quadrillions of CPU cycles by making an untold number of deployed Go applications a bit more CPU efficient. Since Go is the "lingua franca" of containers, many ops people assume the Go runtime is container-aware - it's not (well not in any released version, yet).

If they'd now also make the GC respect memory cgroup limits (i.e. automatic GOMEMLIMIT), we'd probably be freeing up a couple petabytes of memory across the globe.

Java has been doing these things for a while, even OpenJDK 8 has had those patches since probably before covid.

mappu•8mo ago
GOMEMLIMIT is not as easy, you may have other processes in the same container/cgroup also using memory.
kunley•8mo ago
As long as I admit respecting cgroup's setting is a good thing, I am not sure it's really quadrillions.

Or is it? Need calculations

formerly_proven•8mo ago
I would've expected it to be either way too much or way too little, but after doing the math it could be sorta in the right ballpark, at least cosmically speaking.

Let's go with three quadrillion (which is apparently 10^15), let's assume a server CPU does 3 GHz (10^9), that's 10^6, a day is about 100k seconds, so ~ten days. But of course we're only saving cycles. I've seen throughput increase by about 50% when setting GOMAXPROCS on bigger machines, but in most of those cases we're looking at containers with fractional cores. On the other hand, there are many containers. So...

kunley•8mo ago
Nice reasoning, thanks.

Hey, but what did you have in mind with regard to bigger machines? I think we're talking here about lowering GOMAXPROCS to have in effect less context switching of the OS threads. While it can bring some good result, a gut feeling is that it'd be hardly 50% faster overall, is your scenario the same then?

01HNNWZ0MV43FF•8mo ago
Trying to see if Rust and Tokio have the same problem. I don't know enough about cgroups to be sure. Tokio at this line [1] ends up delegating to `std::thread::available_parallelism` [2] which says

> It may overcount the amount of parallelism available when limited by a process-wide affinity mask or cgroup quotas and sched_getaffinity() or cgroup fs can’t be queried, e.g. due to sandboxing.

[1] https://docs.rs/tokio/1.45.0/src/tokio/loom/std/mod.rs.html#...

[2] https://doc.rust-lang.org/stable/std/thread/fn.available_par...

nvarsj•8mo ago
Probably not?

The fundamental issue comes down to background GC and CPU quotas in cgroups.

If your number of worker threads is too high, GC will eat up all the quota.

kortex•8mo ago
Fantastic writeup! Visualizations are great, the writeup is thorough but readable.
weiwenhao•8mo ago
Your write-up is so detailed that I even feel like I could implement a complete golang scheduler myself
davidw•8mo ago
I'd be interested in seeing a comparison of this and the BEAM/Erlang/Elixir scheduler by someone paying attention to the details.