Yes.. another good choice.. Simple algorithm, lots of ways to divide it up. Simple enough that the focus would be on the parallelizing, rather than numerical convergence issues or something like that.
Jim Lux -----Original Message----- From: Max R. Dechantsreiter [mailto:[email protected]] Sent: Wednesday, August 21, 2013 5:24 PM To: Lux, Jim (337C) Cc: [email protected] Subject: Re: [Beowulf] Good demo applications for small, slow cluster Hi Jim, What about something even simpler, nevertheless challenging: matrix multiplication? Slabs or blocks would be a major design choice. Superlinear scaling could be observed, showing a major performance advantage of parallelization on a cluster. Best regards, Max _______________________________________________ Beowulf mailing list, [email protected] sponsored by Penguin Computing To change your subscription (digest mode or unsubscribe) visit http://www.beowulf.org/mailman/listinfo/beowulf
