F
or people who want to see some "grid computing in action," here's a quick video:The video below shows a grid computing race: on the left, you'll see a calculation of a portion of a Mandelbrot set in real time on my machine. On the right, you'll see the exact same code executing on a testbed of
Update 2006-09-20 10:24: Changing video to one with narration.
It doesn't take a rocket scientist to see that
How easy was this? I simply wrote a class that could calculate a portion of the Mandelbrot set. On the left side, I started a thread that called that class 25 times in succession (iterating over the coordinates for this graph). On the right side, I iterated over the coordinates and created 25 instances of my class, then shipped those off to the Digipede Network.
Before my local thread can even complete one calculation, the grid has returned a bunch of calcs (the black squares take the longest--that's why the bright ones get returned so much faster). In the end, the
I may produce a bunch of these videos. It's pretty quick and easy with SnagIt and YouTube (and, yes, as soon as I get into the SoapBox beta, I'll use it).
Technorati tags: grid computing, digipede
Sweet.
ReplyDeleteGreat video, Dan, thanks.
ReplyDeleteNow, is digipede a solution for, say, an office network where I'd like to run some jobs in parallel? I mean, I know if I wanted to build a cluster from scratch I'd use Rocks or the like, but given a corporate intranet running Windows, is digipede a simple way to connect 10-20 PCs and run jobs in parallel? Do you know any such software? Thanks, from Chile.
Sergio - the Digipede Network is equally happy running on dedicated cluster nodes as it is running on shared workstations or shared servers. Many of our customers do "cycle scavenging," running jobs in parallel on desktops and shared servers. E-mail me at dan AT digipede DOT net -- I can answer questions in more detail, or set up a virtual meeting to give you a demonstration!
ReplyDelete