HackerTrans
トップ新着トレンドコメント過去質問紹介求人

stupefy

no profile record

投稿

Hours Without Internet

bsky.app
2 ポイント·投稿者 stupefy·3 か月前·1 コメント

eBPF Arena: A Tutorial

fshahinfar1.github.io
1 ポイント·投稿者 stupefy·昨年·0 コメント

コメント

stupefy
·3 か月前·議論
I am clueless in this field, but solar seems to be unreliable and yield fraction of power required. Do you have a suggestion on something to read and learn more?
stupefy
·3 か月前·議論
What limits LLM inference accelerators? I heard about Groq (https://groq.com/) not sure how much it pushes away the problem.
stupefy
·3 か月前·議論
One nice piece of advice that I received is that books are like RAMs, you do not have to go through them sequentially, but can do random access to the parts of it you need. With this in mind I find it doable to get one the thick books and only read the part that I need for my task.

But, to also be fair, the above random access method does not work when you don't know what you don't know. So I understand why having a light, but good introduction to the topic is important, and I believe that's what the author is pointing out.
stupefy
·3 か月前·議論
We have passed 1000 hours since people of Iran got offline, living without the Internet has been more than inconvenience, it has disrupted the economy --- allegedly many have been laid off, and officials warn of total economy collapse.

The disruption is systematic and is enforced by the Iranian government upon its people. Speculation based on leaked documents hint that this was planned to happen and war has just anticipated the Internet shutdown in a rush to silence criticism against the government. Some now fear this might be the beginning of another closed network such as China or North Korea.

Unfortunately, there is no stable solution for accessing the Internet as of now, although an underground market has emerged for VPN configs that provide access to the Intention. Due to scarcity each Gigabyte of internet is trade for 2 to 4 euros.
stupefy
·4 か月前·議論
It is a fantastic write up
stupefy
·10 か月前·議論
It is super cool. I wonder if it could be expanded to find the bottleneck for NFs? for example if the NF is CPU bound or memory bound. There was a work that predicted the performance of eBPF programs based on memory access or cache miss metric (had performance interface in the name). This tool could help actually find the bottleneck at runtime