PDF-Parallel BreadthFirst Search on Distributed Memory Systems Aydn Bulu Kamesh Madduri Computational Research Division Lawrence Berkeley National Laboratory Berkeley CA ABuluc KMaddurilbl
gov ABSTRACT Dataintensive graphbased computations are pervasive in several scienti64257c applications and are known to to be quite challenging to implement on distributed
Download Presentation
"Parallel BreadthFirst Search on Distributed Memory Systems A " is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.