Entries filed under “Graph Computing”

Video: PSC’s Sherlock Supercomputer Means Business for Graph Computing

In this video, Dr. Nick Nystrom from PSC discusses what makes the Sherlock supercomputer unique and how businesses can take advantage of its graph computing prowess.

Sherlock is a YarcData uRiKA (Universal RDF Integration Knowledge Appliance) data appliance with PSC enhancements. It enables large-scale, rapid graph analytics through massive multithreading, a shared address space, sophisticated memory optimizations, a productive user environment, and support for heterogeneous applications. Sherlock consists of both YarcData Graph Analytics Platform (formerly known as next-generation Cray XMT™) nodes and Cray XT5 nodes with standard x86 processors. Sherlock contains 32 YarcData Graph Analytics Platform nodes, each containing 2 Threadstorm 4.0 (TS4) processors, a SeaStar 2 (SS2) interconnect ASIC, and 32 GB of RAM. Aggregate shared memory is 1 TB, which can accommodate a graph of approximately 10 billion edges.

Read the Full Story.


Also posted in HPC, HPC Hardware, inside-BigData, Video | Leave a comment

IBM PureData System a Pure Play for Big Data

In this video, IBM’s Inhi Cho Suh, Vice President Product Management & Strategy, give a guided tour of the IBM PureData Systems, which are specifically designed to “efficiently manage and quickly analyze petabytes of data in minutes.” The company is offering three workload-specific models of the PureData System for Transactions, Analytics, and Operational Analytics.

So what is a PureData system in terms of architecture? Building off its Netezza platform that IBM acquired in 2010, the PureData is an “Expert Integrated System” that leverages FPGAs for specific tasks.

The PureData System’s orders-of-magnitude performance advantage over other analytic options comes from its unique asymmetric massively parallel processing (AMPP) architecture that combines open, IBM blade servers and disk storage with IBM’s patented data filtering using field programmable gate arrays (FPGAs). This combination delivers blistering fast query performance on analytic workloads supporting tens of thousands of BI and data warehouse users, sophisticated analytics at the speed of thought, and petabyte scalability.

Read the Full Story.

Also posted in Compute, HPC, HPC Hardware, Video | Leave a comment

YarcData Rolls Out $100K Big Data Graph Analytics Challenge

Today Cray’s YarcData subsidiary announced the YarcData Graph Analytics Challenge. With $100,000 in prizes, the contest will recognize the best submissions for solutions of un-partitionable, Big Data graph problems.

Graph databases have a significant role to play in analytic environments, and they can solve problems like relationship discovery that other traditional technologies do not handle easily,” said Philip Howard, Research Director, Bloor Research. “YarcData driving thought leadership in this area will be positive for the overall graph database market, and this contest could help expand the use of RDF and SPARQL as valuable tools for solving Big Data problems.”

 
The YarcData Graph Analytics Challenge will officially begin on Tuesday, June 26, 2012 and winners will be announced during a live web event on Dec. 4, 2012. Read the Full Story.

Also posted in inside-BigData | Leave a comment

The Case for the Graph 500 – Really Fast or Really Productive? Pick One

In this special feature from The Exascale Report, industry thought leaders share their views on Graph computing.

The Graph 500 is not new, but interest has recently been piqued as discussions are shifting to application development plans for exascale- class systems.

In this reader opinion article, we solicit commentary in response to the question, “Why is the Graph 500 so important to HPC, and eventually, to the development of exascale applications?”

To better prepare for unprecedented sizes of data sets, many in the community believe we need to change our views on performance measurement from FLOPS to TEPS (Traversed Edges per Second.)

The Graph 500 has an impressive steering committee of more than 50 international HPC experts from academia, industry and many of the national laboratories. According to the Graph 500 website, they are in the process of developing comprehensive benchmarks to address three application kernels: concurrent search, optimization (single source shortest path), and edge-oriented (maximal independent set), while attempting to focus on five graph-related business areas: Cybersecurity, Medical Informatics, Data Enrichment, Social Networks, and Symbolic Networks.

As it picks up more momentum, the Graph 500 brings a nice balance to HPC benchmarks and complements the Top 500 with a tool for better measuring performance on data intensive applications.

Trying to help our readers better understand the relevance of the Graph 500, we asked the following question:

Why is the Graph 500 so important to HPC, and eventually, to the development of exascale applications?

According to Richard Murphy, a Principal Member of the Technical Staff at Sandia, “The Graph500’s goal is to promote awareness of complex data problems.” He goes on to explain, “Traditional HPC benchmarks – HPL being the preeminent – focus more on compute performance. Current technology trends have led to tremendous imbalance between the computer’s ability to calculate and to move data around, and in some sense produced a less powerful system as a result. Because “big data” problems tend to be more data movement and less computation oriented, the benchmark was created to draw awareness to the problem.”

Why is the Graph 500 so important to HPC, and eventually, to the development of exascale applications?

Steve Scott, CTO of NVIDIA’s Tesla business offers the following perspective: “The Graph 500 is important, as it stands as a proxy (albeit, an overly simple one) for an emerging class of graph analytics and Big Data problems. Graph analytic techniques hold tremendous promise for performing complex analysis of large, unstructured, datasets. They are of increasing interest in several markets, including defense and intelligence, business intelligence, and optimization of processes in complex networks such as transportation, electrical grid, etc. GPUs achieve excellent performance on graph problems due to their high memory bandwidth and many threads for latency tolerance (these problems typically have very poor locality).”

And yet another perspective comes from Intel’s John Gustafson, a Director at Intel Labs in Santa Clara, CA, “The answer is simple: Graph 500 stresses the performance bottleneck for modern supercomputers. The Top 500 stresses double precision floating-point, which vendors have made so fast that it has become almost completely irrelevant at predicting performance for the full range of applications. Graph 500 is communication-intensive, which is exactly what we need to improve the most. Make it a benchmark to win, and vendors will work harder at relieving the bottleneck of communication.”

And we wrap up our reader commentary section with Bill Gropp, Director of the Parallel Computing Institute at the University of Illinois Urbana-Champaign. Gropp sums up our question, Why is the Graph 500 so important to HPC, and eventually, to the development of exascale applications” with this very simple and to the point perspective, “To start the process of bringing new application areas into HPC.”

For an in-depth discussion of the Graph 500, listen to this audio interview with Pradeep Dubey, a senior principal engineer and Director of the Parallel Computing Lab (PCL) at Intel Labs.

This article appears courtesy of The Exascale Report. Subscribe today.

Also posted in HPC | Leave a comment

Cray Spiffs Up Multithreaded Architecture for uRIKA Big Data Appliance

Cray launched its new YarcData division only a few weeks ago, but in a surprise move today, the company announced its first Big Data appliance and a bevy of beta customers. Available today, the YarcData uRiKA graph appliance beging called a purpose-built solution for Big Data relationship analytics.

The uRiKA graph appliance fills an unmet need in the rapidly-growing Big Data market. While many critical Big Data problems are based on graphs, most current Big Data solutions are based on partitioned data structures that scale out on clusters. Current Big Data approaches, including graph databases, result in low performance on graphs since graphs are hard to partition across cluster nodes, are non-deterministic, and are highly dynamic. The launch of the uRiKA solution addresses the challenge of delivering insightful analytics on graphs, not only in terms of its ability to handle size and complexity of relationships, but also in terms of its response time and speed of processing.

Ok, so what exactly is inside this appliance, you might ask? With “massively-multithreaded graph processors supporting 128 threads/processor, and highly scalable I/O with data ingest rates of up to 350 terabytes per hour,” it looks to be a spinoff of the Cray XMT, the third generation of the Cray MTA supercomputer architecture originally developed by Tera. The Cray XMT has vanished from the company site, so they are now down to three compute product lines: Cray XK6 (AMD/Nvidia hybrid), Cray XE6 (AMD), and now uRIKA.

Early adopters for the uRiKA graph appliance include the Institute of Systems Biology (ISB), Mayo Clinic, Noblis, Swiss CSCS, and an unamed US government organization. Read the Full Story.

Also posted in HPC, HPC Hardware | 1 Comment

Advertisement

Spectra Logig Ad

Video Archive

insideHPC.com is a production of insideHPC, LLC. © 2006-2013 Sitemap