frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

hdiutil is deprecated in macOS 27 Golden Gate

https://lapcatsoftware.com/articles/2026/8/7.html
62•zdw•59m ago•7 comments

NetBSD and My Life (2005)

https://mail-index.netbsd.org/netbsd-advocacy/2005/09/10/0000.html
24•gnyeki•56m ago•0 comments

Scrap

https://twitter.com/moxie/status/2091218652133732491
75•tosh•1h ago•13 comments

ElevenLabs, TwelveLabs, ThirteenLabs

https://quantumi.sh/public/labs.html
217•jemoka•5h ago•72 comments

Hister – A private, full content search index that you control

https://hister.org/
100•auraham•4d ago•35 comments

A Friendly Introduction to Racket

https://geometridae.bearblog.dev/a-friendly-introduction-to-racket/
101•signa11•5h ago•38 comments

typ.ing

https://typ.ing/
72•bookofjoe•4d ago•27 comments

How a Texas student blew the whistle on a rogue AI hacking attempt

https://www.reuters.com/world/how-texas-student-blew-whistle-rogue-ai-hacking-attempt-2026-08-20/
45•olalonde•1d ago•4 comments

RF Cafe

https://www.rfcafe.com/
67•gregsadetsky•3d ago•9 comments

ATProto spaces: A new extension to ATProto that enables non-public data

https://atproto.com/blog/atproto-spaces-alpha
43•grappler•1d ago•6 comments

Munder Difflin – Agent harness to run an office of your clones

https://munderdiffl.in/
225•simonpure•10h ago•102 comments

Guess which of these LLM outputs is watermarked

https://sgoedecke.github.io/watermark-quiz/
30•gfysfm•2d ago•33 comments

Why it might be time to rethink the human family tree

https://nautil.us/why-it-might-be-time-to-rethink-the-human-family-tree-1283985
29•Anon84•2d ago•17 comments

Canada will match US tariffs 'dollar for dollar' as trade talks break down

https://www.bbc.com/news/articles/cvgvyy4x2mvo
232•tartoran•13h ago•876 comments

One night in Uzbekistan: Why was this one data point so influential?

https://statmodeling.stat.columbia.edu/2026/08/20/we-couldnt-reproduce-their-findings-and-realize...
19•paulpauper•1d ago•2 comments

Z80 – The 1970s Microprocessor Still Alive (2021)

https://www.computer.org/csdl/magazine/mi/2021/06/09623402/1yJTvlRLmhi
98•asdefghyk•10h ago•49 comments

Mythic's analog compute-in-memory architecture

https://www.mythic.ai
28•janandonly•3d ago•2 comments

MiniageOS: "Dumbphone" Version of LineageOS

https://github.com/ofdryads/miniageOS
26•ashenke•2d ago•14 comments

New MCP Roadmap

https://blog.modelcontextprotocol.io/posts/mcp-roadmap/
143•pentagrama•6h ago•111 comments

Belgian car salesman becomes prince after DNA test proves royal parentage

https://www.cnn.com/2026/08/22/europe/prince-belgium-secret-son-scli-intl
69•MilnerRoute•2h ago•43 comments

Anthropic appears to be A/B testing reduced effort levels in Claude Code

https://twitter.com/argofowl/status/2091150597374537729
84•matthieu_bl•3h ago•88 comments

Show HN: Anonymous age verification with passkey-powered encryption

https://loginwithone.com/
28•mikeysight•3d ago•14 comments

ProgramBench Vetted: Reverse Engineering from a Runnable Binary

https://vetto.ai/companies/programbench-vetted.html
15•rigelbm•2d ago•1 comments

Rust Glancer: Rust LSP using 100x less RAM

https://rust-glancer.github.io/blog/hello-world/
378•matklad•1d ago•88 comments

Show HN: Rotation via Double Reflection

https://static.laszlokorte.de/rotor-reflect/
45•laszlokorte•1d ago•9 comments

Show HN: terminal-code – VS Code inside the terminal

https://terminal-code.com
27•robpruzan•3d ago•8 comments

Show HN: Make your logo extra bright on HDR screens

https://www.soverybright.com/
4•telecuda•1h ago•0 comments

Felony Bench

https://www.felonybench.com/
811•colinprince•1d ago•325 comments

Ameliorate

https://ameliorate.app/
68•hakkikonu•1d ago•19 comments

What's in a PowerPoint File?

https://editide.com/blog/what-is-a-pptx-file/
26•danielochoa0620•3d ago•18 comments
Open in hackernews

Understanding the Go Scheduler

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

Comments

90s_dev•1y ago
I heard that the scheduler is a huge obstacle to many potential optimizations, is that true?
NAHWheatCracker•1y 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•1y 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•1y ago
That sounds a lot like just using another language.
silisili•1y 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•1y 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•1y 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•1y ago
That's so funny. I just saw `61` in the Tokio code with a comment "copied this from Go"
__turbobrew__•1y 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•1y ago
Relevant proposal to make GOMAXPROCS cgroup-aware: https://github.com/golang/go/issues/73193
robinhoodexe•1y ago
Looks like it was just merged btw.
yencabulator•1y ago
This should be automatic these days (for the basic scenarios).

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

jasonthorsness•1y ago
uh isn't that change 3 hours old?
kortex•1y ago
Fantastic writeup! Visualizations are great, the writeup is thorough but readable.
weiwenhao•1y ago
Your write-up is so detailed that I even feel like I could implement a complete golang scheduler myself
davidw•1y ago
I'd be interested in seeing a comparison of this and the BEAM/Erlang/Elixir scheduler by someone paying attention to the details.
yencabulator
•
1y 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•1y ago
super-weird coincidence but welcome, I have been waiting for this for a long time!
williamdclt•1y 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•1y 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•1y ago
GOMEMLIMIT is not as easy, you may have other processes in the same container/cgroup also using memory.
kunley•1y 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•1y 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•1y 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•1y 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•1y 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.