Wednesday, March 17, 2010

Algoryhme by Radia Perlman

August 29, 2008 by Greg Ferro · 2 Comments 

Radia Perlman penned this poem while she developed Spanning Tree.

Algorhyme

I think that I shall never see
A graph more lovely than a tree.
A tree whose cru­cial prop­erty
Is loop-​​free con­nectiv­ity.
A tree that must be sure to span
So pack­ets can reach every LAN.
First, the root must be selec­ted.
By ID, it is elec­ted.
Least-​​cost paths from root are traced.
In the tree, these paths are placed.
A mesh is made by folks like me,
Then bridges find a span­ning tree.
—Radia Perlman

Radia Perlman is the inventor of Spanning Tree (beloved by all men­dic­ants) and she works at Sun where con­tin­ues to pro­duce major advances in com­puter net­work­ing. Check out here bio

Please rate this post:

  Why Rate Posts?
1 Star - It\\\'s Crud2 Stars - It\\\'s Tosh3 Stars - Something\\\'s missing4 Stars - Needs works5 Stars - Good Enough6 Stars - Good7 Stars - Excellent8 Stars - Brilliant9 Stars - Astonishing10 Stars - Awesomely Godlike? (1 votes, average: 10.00 out of 10)
Loading ... Loading ...

Comments

2 Responses to “Algoryhme by Radia Perlman”
  1. stretch says:

    Maybe if she spent more time on span­ning tree and less on poetry we wouldn’t have a fifty-​​second fail­over time.

    • Greg Ferro says:

      if you read radia’s most excel­lent book you would know that 15 seconds was the best estim­ate for the Z80 CPU a few hun­dred us to run span­tree plus propaga­tion of bpdu’s across the DEC cam­pus, plus a small safety margin.

      Who knew that we would have this much CPU and band­width ? Spanning tree is a beau­ti­ful and eleg­ant pro­tocol that solves a dif­fi­cult prob­lem. You should be blamng Ethernet not span­ning tree

Speak Your Mind

Tell us what you're thinking...
and oh, if you want a pic to show with your comment, go get a gravatar!