Nice! Only there are two issues. First, my algorithm should never deadlock, so the philosophers would starve :-)
And second, it would require invocation of a nested runtime. Now _this_ is the interesting part. I will be posting about this soon. It is also the basis for instrumentation and debugging tools. On Mon, Aug 16, 2010 at 2:26 PM, John Zabroski <[email protected]> wrote: > Bonus points if you extend it to the Russian Dining Philosopher's Problem > [1] (each Philosoper is recursively thinking about the DP Problem). > > [1] http://www.cs.adelaide.edu.au/~charles/OPN.html > > On Fri, Aug 6, 2010 at 5:01 PM, Dale Schumacher <[email protected]> > wrote: >> >> Just published: An incremental exploration of the Dining Philosophers >> problem. This actor-based solution is a little different in that I >> give active state-dependent behavior to the chopsticks as wells as the >> philosophers. >> >> http://www.dalnefre.com/wp/2010/08/dining-philosophers-in-humus/ >> >> -- >> send mail : [email protected] >> subscribe : [email protected] >> unsubscribe : [email protected] >> home page : http://groups.google.com/group/pilud >> Note: reply address is set to the list -- no need to "reply all" > > > _______________________________________________ > fonc mailing list > [email protected] > http://vpri.org/mailman/listinfo/fonc > > ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org
