Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

If you only share state by passing messages you should be fine. The challenge is to make sure the "only" part.

Erlang's reduction-based scheduling basically counts how many steps each process has executed, and automatically switches to other processes once a process has finished a certain number of reductions. So even if a process is running tight loops, it would not starve other processes. Go's scheduler currently cannot promise that.



Another way to put it: you can write the equivalent of

    while (true) { do some stuff }
in Erlang and it will not hang the system.




Consider applying for YC's Fall 2026 batch! Applications are open till July 27.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: