1 / 5

Large Matrix-Matrix Multiply on PS3 clusters

Large Matrix-Matrix Multiply on PS3 clusters. 15 September 2010. Mark Barnell, AFRL RITB Mark.Barnell@rl.af.mil Dennis Fitzgerald, ITT dennis.fitzgerald@itt.com. Description. Matrix-Matrix multiplication of large matrices > 100k x 100k Parallelized over a number PS3s

miette
Download Presentation

Large Matrix-Matrix Multiply on PS3 clusters

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Large Matrix-Matrix Multiply on PS3 clusters 15 September 2010 Mark Barnell, AFRL RITB Mark.Barnell@rl.af.mil Dennis Fitzgerald, ITT dennis.fitzgerald@itt.com

  2. Description • Matrix-Matrix multiplication of large matrices • > 100k x 100k • Parallelized over a number PS3s • Maintained near peak performance on each Cell BE

  3. Challenges • Near peak computation rate on the Cell BE for small matrix sizes • Data and thread coordination between PowerPC and Cell BE with near zero overhead • Balanced IO with Cell BE’s peak FLOPS to keep PS3 computationally busy • Network performance sufficient to deliver enough data to many PS3s

  4. Approach • Core MM algorithm > 99% efficient (128x128) • Daniel Hackenberg – Dresden • PowerPC code to coordinate larger rectangular matrices – Miriam Leeser – Northeastern • Multi-buffering & semaphors to reduce wait time • Blocked sub-matrix distribution with data sized to balance compute and IO

  5. Results

More Related