Aydin_CSC11_Indexing

log p p p p nnz a tcomm

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ribu4ons, interleaved on each other. x1,3 ! ! x1 !  ­ Performance change is marginal (dominated by SpGEMM)  ­ Scalable with increasing number of processes  ­ No significant load imbalance Complexity analysis SpGEMM: Tcomp $ nnz( A) $ length( I ) length( J ) '' ! "& # log & + + p )) p p % (( %p # nnz( A) & Tcomm = ! %! " p + " " ( % ( p' $ Matrix formaDon: Dominated by SpGEMM Bopleneck: bandwidth costs Speedup: " p () # length( I ) + length( J ) & ! %! " log( p) + " " ( % ( p $ ' ! Assump4ons:  ­ The triple product...
View Full Document

This note was uploaded on 12/27/2011 for the course CMPSC 240A taught by Professor Gilbert during the Fall '09 term at UCSB.

Ask a homework question - tutors are online