Skip to search formSkip to main contentSkip to account menu

Graph500

The Graph500 is a rating of supercomputer systems, focused on data intensive loads. The project was announced on International Supercomputing… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Blue GeneCray XMTData-intensive computingGNU Octave

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Japan's Flagship 2020 “Post-K” System
  • Bob Sorensen
  • Computing in science & engineering (Print)
  • 2019
  • Corpus ID: 71152479
Based on the success of the K Computer, Japan's Flagship 2020 "Post-K" computer has been in development since 2014. The Post-K… 
2017
2017
A Dataflow-Based Runtime Support on a 100P Actual System
Chips equipped with numerous simple cores and heterogeneous computing resources have become mainstream in the present… 
2017
2017
Multigrain Parallelism: Bridging Coarse-Grain Parallel Programs and Fine-Grain Event-Driven Multithreading
The overwhelming wealth of parallelism exposed by Extreme-scale computing is rekindling the interest for finegrain multithreading… 
2016
2016
Distributed Multithreaded Breadth-First Search on Large Graphs Using DXGraph
Interactive graph applications are often generating irregular access patterns on very large graphs with trillions of edges and… 
2015
2015
The Performance Evaluation of the Java Implementation of Graph500
Graph-based computations are used in many applications. Increasing size of analyzed data and its complexity make graph analysis a… 
2014
2014
Evaluating PCJ library for graph problems - Graph500 in PCJ
In the paper we present evaluation of the PCJ (Parallel Computations in Java) library for graph problems, namely for the first… 
2014
2014
Revisiting virtual memory for high performance computing on manycore architectures: a hybrid segmentation kernel approach
Page-based memory management (paging) is utilized by most of the current operating systems (OSs) due to its rich features such as… 
2013
2013
Parallel distributed breadth first search on GPU
In this paper we propose a highly optimized parallel and distributed BFS on GPU for Graph500 benchmark. We evaluate the… 
2013
2013
Efficient Hybrid Breadth-First Search on GPUs
Breadth-first search (BFS) is a basic algorithm for graph processing. It is a very important algorithm because a number of graph… 
2011
2011
Multi-threaded UPC runtime with network endpoints: Design alternatives and evaluation on multi-core architectures
Multi-core architectures are becoming more and more popular in HEC (High End Computing) era. Recent trends of high-productivity… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)