Aydin_CSC11_Indexing

Armat15 arr r random load balance hard some

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: e SpRef/SpAsgn important? Subscrip4ng and colon nota4on: ⇒  Batched and vectorized opera4ons ⇒  High Performance and parallelism. A=rmat(15) A(r,r) : r random − Load balance hard ± Some locality + Load balance easy − No locality 5 A(r,r) : r=symrcm(A) − Load balance hard + Good locality More applica4ons Prune isolated ver4ces; plug ­n ­play way (Graph 500) 0 0 2 2 4 4 6 6 8 8 10 10 12 12 14 0 16 0 2 4 6 8 10 nz = 36 12 14 2 4 6 nz = 36 8 10 12 16 sa = sum(A); // A is symmetric, for undirected graph nonisov = find(sa>0); A= A(nonisov, nonisov); // keep only connected vertices 6 More applica4ons Extrac4ng (induced) subgraphs 1 2 4 7 5 3 6 1 2 4 1 Area A 7 2 4 7 5 3 3...
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