It seems quite trivial - hardly deserving the 50 to 100 lines these solutions seem to require.
I notice that some of the solutions change the problem - e.g. the Erlang solution that employs "a waiter that only serves a plate of spaghetti when a philosopher has access to two forks" - and none of them guarantee that a philosopher won't starve, only that deadlock can be avoided. On Mon, Jan 25, 2010 at 10:17 AM, Aai <[email protected]> wrote: > Hi all, > > just curious. Is a task like 'dining philosophers' possible/impossible > in J? If impossible what should J have to solve this sort of tasks? > > -is e.g. J-OOP an option and then write some kind of scheduler and > simulate the whole thing? > -could J e.g. emulate this Pascal solution > http://en.wikipedia.org/wiki/Dining_philosophers_problem#Example_Solution > > Anyone interested, check out : > http://rosettacode.org/wiki/Dining_philosophers > > TIA. > > > > -- > Met vriendelijke groet, > =@@i > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > -- Devon McCormick, CFA ^me^ at acm. org is my preferred e-mail ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
