Large Matrix-Matrix Multiply on PS3 Clusters - September 2010 Study
Matrix-matrix multiplication of large matrices over PS3 clusters, achieving high computational efficiency and GFLOPS performance. Challenges, approach, and results of the study are discussed in detail.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
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 DISTRIBUTION STATEMENT A. Approved for public release; distribution unlimited. (Approval given by Public Affairs Office (September 2010).
Description Matrix-Matrix multiplication of large matrices > 100k x 100k Parallelized over a number PS3s Maintained near peak performance on each Cell BE 2 UNCLASSIFIED
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 3 UNCLASSIFIED
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 4 UNCLASSIFIED
Results Matrix-Matrix Mutiply GFLOPS 48k x 48k 3500.00 48k x 240k 3000.00 2500.00 PS3 Max GFLOPS (153) 2000.00 GFLOPS 1500.00 1000.00 500.00 0.00 1 3 5 7 9 11 13 15 17 19 21 Number of PS3s 5 UNCLASSIFIED
