Title: Parallel Network Analysis (2009 CSRI Summer Lecture Series)

Speaker: Cindy Phillips, Sandia National Laboratories

Date/Time: Wednesday, July 15th, 2009, 3-4pm (MST)

Location: CSRI Building, Room 90 (NM), 915/S145 (CA)

Brief Abstract: We consider methods for the parallel solution of graph-based and combinatorial problems arising in the design of sensor networks or the analysis of social networks.  While some aspects of these applications have obvious partitions with "embarrassing" parallelism, the lack of locality when searching through graph neighborhoods has historically made parallelization of graph algorithms difficult.  A new generation of massively multithreaded parallel computers is well suited for algorithms with significant memory latency, provided there is sufficient total parallelism.  We will discuss algorithmic techniques for solving graph problems on such architectures including a powerful primitive originally developed for the Connection Machine CM-2. Finally, we have had new parallel algorithmic insights inspired by techniques originally designed to save space on more conventional architectures.

CSRI POC: Zhaofang Wen, (505) 284-0206