1. 3

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

  1.  

  2. 1

    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

    Perhaps I’m misunderstanding what “low quality” means?

    Edit: It looks like it’s just a mistake. A response from jcs on this complaint can be found at:

    https://lobste.rs/s/fwxp3a/guido_is_giving_a_talk_on_pep_3156_at_linkedin_on_jan_23rd/comments/ohxsva