sure, this would work much better, and is easy to implement (diameter is log(# nodes) if you set it up as an expander!).
but writing it from scratch is a bit of a burden. i may have a project like this next semester for my networking class, if so, we can tack the rest onto it if anyone's interested, over the summer, perhaps. s. On Thu, Oct 2, 2008 at 5:19 PM, Zach Wegner <[EMAIL PROTECTED]> wrote: > On Thu, Oct 2, 2008 at 3:48 PM, steve uurtamo <[EMAIL PROTECTED]> wrote: >> The networking issue is somewhat more serious. >> Not the actual network delay, but the mechanism >> that the boinc client software uses to process work requests >> and the interval at which people typically send >> back their results is such that you'd be unlikely to >> get a single work request back until after you needed >> it. > > This makes the assumption that boinc is used, or at least that one > central server is used. I've thought a lot about this issue, and I > think one central server would be too inefficient. I would use a > distributed network, and let each computer just connect with a small > number of others, creating something more like a web than a tree. This > could be optimized for ping time as well--arrange the nodes in the web > so that they talk most with those close to them. > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ > _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
