Your SlideShare is downloading. ×
SC10 project slides
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

SC10 project slides

359

Published on

Relevant project slides from Georgia Tech's SC10 slides

Relevant project slides from Georgia Tech's SC10 slides

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
359
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
0
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. [ CENTER FOR ADVANCED SUPERCOMPUTING SOFTWARE FOR MULTITHREADED ARCHITECTURES (CASS-MT) ] [ OBJECTIVE ] To design software for the analysis of massive-scale spatio-temporal interaction networks using multithreaded architectures such as the Cray XMT. The Center launched in July 2008 and is led by Pacific-Northwest National Laboratory. [ DESCRIPTION ] We are designing and implementing advanced, scalable algorithms for static and dynamic graph analysis, including generalized k-betweenness centrality and dynamic clustering coefficients. [ HIGHLIGHTS ] On a 64-processor Cray XMT, k-betweenness centrality scales nearly linearly (58.4x) on a graph with 16M vertices and 134M edges. Initial streaming clustering coefficients handle around 200k updates/sec on a similarly sized graph. [ FUNDING ] Pacific Northwest National Laboratory David A. Bader (PI), David Ediger, Karl Jiang, Jason Riedy Our research is focusing on temporal analysis, answering questions about changes in global properties ( e.g. diameter) as well as local structures (communities, paths). Image Courtesy of Cray, Inc.
  • 2. Problem Class Size Toy (10) 17 GiB Mini (11) 140 GiB Small (12) 1.1 TiB Medium (13) 18 TiB Large (14) 140 TiB Huge (15) 1.1 PiB Image Source: Giot et al., “A Protein Interaction Map of Drosophila melanogaster”, Science 302 , 1722-1736, 2003 [ EXPLORATION OF SHARED MEMORY GRAPH BENCHMARKS: THE GRAPH500 ] [ OBJECTIVE ] Explore benchmarks for high-performance data-intensive computations on parallel, shared-memory platforms. [ DESCRIPTION ] Current high-performance architectures are built to run linear algebra operations effectively. These architectures seem a poor fit for the massive growth of irregular data coming from biological, social, regulatory, and other sources. There are no widely supported benchmarks to guide architectural decisions for these applications. Georgia Tech worked within Graph500 steering committee to draft a new breadth-first search benchmark acceptable for wide participation. Georgia Tech also provided and supports the OpenMP and Cray XMT shared-memory reference codes. For more: Visit the Graph500 BoF! [ FUNDING ] Sandia National Labs David A. Bader (PI), Jason Riedy
      Image Source: Nexus (Facebook application)
      0
      7
      5
      3
      8
      2
      4
      6
      1
      9
      source vertex
  • 3. Photo © Intel Photo © CTL Corp. Photo © Intel [ STING: Spatio-Temporal Interaction Networks and Graphs An open-source dynamic graph package for Intel platforms ] [ OBJECTIVE ] Develop and tune the STING package to analyze streaming, graph-structured data for Intel multi- and manycore platforms. [ DESCRIPTION ] The New York Stock Exchange generates 1.5TB of data daily. Facebook users add 30 billion pieces of linked data per month. Facebook's 500M users with 130 'friend' links per user form an ever-changing graph requiring almost 1TB of storage storing only connectivity data. Running repeated static analysis over memory interfaces like QPI cannot keep pace with the dynamic changes in the graph-structured data. STING is tackling the streaming data problem using Intel multi- and manycore platforms.. [ FUNDING ] Intel, Parallel Algorithms in Non-Numeric Computing David A. Bader (PI), Jason Riedy
  • 4. Photo © NCSA/U. Illinoisw [ DYNAMIC GRAPH DATA STRUCTURES IN X10 ] [ OBJECTIVE ] Attack next-generation dynamic graph analysis with the next-generation parallel programming system X10. [ DESCRIPTION ] The vast amount of graph-structured data desperate for analysis swamps single memory images. Analysts in companies and elsewhere rely on simple analysis forced onto simplistic programming paradigms. X10's partitioned global address space (PGAS) model simplifies global data access while mapping onto common platforms. Georgia Tech is exploring the space of dynamic graph data structures using X10's parallel, asynchronous programming facilities. The work will be applicable anywhere X10 runs, from supercomputers to clusters to workstations. [ FUNDING ] IBM X10 Innovation Award David A. Bader (PI), Jason Riedy

×