From: bbense+comp.lang.ruby.Feb.05.02@... Date: 2002-02-06T01:40:36+09:00 Subject: Re: looking for an example problem to demonstrate TaskMaster -----BEGIN PGP SIGNED MESSAGE----- In article , Phil Tomson wrote: >In article , >Dave Thomas wrote: >>ptkwt@shell1.aracnet.com (Phil Tomson) writes: >> >>> I'm looking for suggestions here... >> >>The good ol' Mandelbrot calculation? >> >Actually, now that I think about it doing the Mandelbrot on several >machines and then sending back all the data points to the central 'server' >would require too much information transfer vs compute time. > - - You aren't looking deep enough then, the closer you get to the actual set, the more iterations you need to make. I wasted a bunch of Cray time doing exactly this kind of distributed caculation years ago, at the limits of floating pt resolution you need about 32k iterations per pixel. - - You can see the results in this mpeg, it's a funnier with the sound track though... http://www.ifs.hr/ifs/fun/fractals/ Look for Mand. - - Actually, another useful example would be a webcrawler, but I'm not sure we want to inflict yet another webcrawler on the world. - - There are lot's of interesting examples from the physics world. They are under the general rubric of "Monte Carlo" simulations. You could compute the mass of the proton. - - Lastly, you could adopt some simple examples from genetic algorithms. - - Booker C. Bense -----BEGIN PGP SIGNATURE----- Version: 2.6.2 iQCVAwUBPGAJ3QD83u1ILnWNAQGsZwQAsDqWDH3veqhwm9LLZlAySAinOtWQkzm8 h+ztpTyakv7BLZ2McCNvX9Wi/tTBZdUM4vE86Lrgn4pULv7j66QNxH/K8pDTnmIc 6Hl18MLmJru75nQoZzdGnKAcWcnLgCkC8BKHtKiRo7vz1XKKeQt44pL2c7E1lGrZ CQEO58RU/2U= =VuST -----END PGP SIGNATURE----- --