Parallel, distributed, and decentralized file treewalk with ftw(3) style API
1 comments · distributed, release
- Comments1
1 comments · distributed, release
This works through a gossip protocol for splitting work on node-local queue to other nodes (if local processing capacity is saturated). After nodes run out of work items, a Dijkstra's token ring is initiated to determine termination. Therefore, this is a self-stabilizing algorithm that can be applied to any general treewalk problem across a distributed system to have near perfect balance on compute workload, regardless of system size. http://www.cs.utexas.edu/~EWD/ewd04xx/EWD426.PDF
Story details from Lobsters ↗ · linked article on github.com.
Parallel, distributed, and decentralized file treewalk with ftw(3) style API was first seen on Lobsters · Hottest on Oct 31, 2026. Since then it has appeared in 1 check on 1 different day. Its best position was #24 of 25, reached on Oct 31, 19:21 UTC. It dropped off the list after Oct 31, 19:21 UTC.
Position on Lobsters · Hottest at every check (lower is better).
Best rank per day (UTC).
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
To the folks who moderated this as "low quality", please leave a comment explaining why. This work was accepted into an IEEE conference (SC12), so saying that it's "low quality" is confusing. It's one of the fastest parallel tree walking algorithms currently known to mankind. http://dl.acm.org/citation.cfm?id=2389114…
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Oct 31, 19:21 UTC, after 1 day of trending.
#24 on Lobsters · Hottest, on Oct 31, 19:21 UTC. Trendoday checks this list every 30 minutes.
It was first seen on Oct 31, 2026 and has been on the list on 1 day (1 check) since.