Graph Algorithms on the Cray XMT-2

Graph Algorithms on the Cray XMT-2

Shahid H. Bokhari, Independent Researcher, Cupertino, CA

September 27, 2013

Shahid BokhariShahid Bokhari has been working on the XMT-2 (and its precursors, the XMT-1, MTA-2, MTA-1) for 15 years. He will describe his experiences with implementing algorithms on this architecture. Examples include DNA sequencing (using de Bruijn graphs), influenza virus evolution (shortest trees) and image segmentation (maxflow-mincut). In each case, he will show that there are no issues of problem partitioning or load balancing and that good performance can be obtained using ordinary C code with the addition of a few pragmas and machine intrinsics.


Shahid Bokhari has been working in the areas of parallel and distributed computing since 1975. He has held positions at the University of Engineering, Lahore, NASA's Institute for Computer Applications, University of Colorado, and Ohio State University. He is a Fellow of the IEEE and of the ACM and is an ISI Highly Cited Researcher in Computer Science.



Find out more about Noblis' capabilities in big data analytics and high performance computing.

Site Map

Home

Noblis, Inc. 2002 Edmund Halley Dr, Reston, VA 20191 703.610.2000 Terms of Use | Privacy Policy | Copyright 2012 Noblis, Inc. All rights reserved.