Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,566,866 papers from all fields of science
Search
Sign In
Create Free Account
Graph500
The Graph500 is a rating of supercomputer systems, focused on data intensive loads. The project was announced on International Supercomputing…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Blue Gene
Cray XMT
Data-intensive computing
GNU Octave
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Predictive modeling and scalability analysis for large graph analytics
Sourav Medya
,
L. Cherkasova
,
Ambuj K. Singh
IFIP/IEEE Symposium on Integrated Network…
2017
Corpus ID: 10697909
Many HPC and modern large graph processing applications belong to a class of scale-out applications, where the application…
Expand
2016
2016
Level-Synchronous BFS Algorithm Implemented in Java Using PCJ Library
Magdalena Ryczkowska
,
Marek Nowicki
,
P. Bała
International Conference on Computational Science…
2016
Corpus ID: 19025108
Graph processing is used in many fields of science such as sociology, risk prediction or biology. Although analysis of graphs is…
Expand
2016
2016
Towards Performance and Scalability Analysis of Distributed Memory Programs on Large-Scale Clusters
Sourav Medya
,
L. Cherkasova
,
+4 authors
I. Sheikh
International Conference on Performance…
2016
Corpus ID: 14018248
Many HPC and modern Big Data processing applications belong to a class of so-called scale-out applications, where the application…
Expand
2014
2014
HPC Performance and Energy-Efficiency of the OpenStack Cloud Middleware
Sébastien Varrette
,
Valentin Plugaru
,
Mateusz Guzek
,
Xavier Besseron
,
P. Bouvry
43rd International Conference on Parallel…
2014
Corpus ID: 16163932
Since its advent in the middle of the 2000's, the Cloud Computing (CC) paradigm is increasingly advertised as THE solution to…
Expand
2014
2014
Performance Evaluation of Breadth-First Search on Intel Xeon Phi
”. Nicevt
,
Varshavaskoe shosse
,
Russia Moscow
2014
Corpus ID: 15033013
Breadth-First Search (BFS) is one of the most important kernels in graph computing. It is the main kernel of the Graph500 rating…
Expand
Highly Cited
2013
Highly Cited
2013
On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest
Abdullah Gharaibeh
,
L. Costa
,
E. Santos-Neto
,
M. Ripeanu
IEEE 27th International Symposium on Parallel and…
2013
Corpus ID: 206929329
Graph processing has gained renewed attention. The increasing large scale and wealth of connected data, such as those accrued by…
Expand
2012
2012
Compression and Sieve: Reducing Communication in Parallel Breadth First Search on Distributed Memory Systems
Huiwei Lv
,
Guangming Tan
,
Mingyu Chen
,
Ninghui Sun
arXiv.org
2012
Corpus ID: 17906176
For parallel breadth first search (BFS) algorithm on large-scale distributed memory systems, communication often costs…
Expand
2012
2012
Poster: Hybrid Breadth First Search Implementation for Hybrid-Core Computers
Kevin R. Wadleigh
,
John Amelio
,
K. Collins
,
G. Edwards
SC Companion: High Performance Computing…
2012
Corpus ID: 23772930
The Graph500 benchmark is designed to evaluate the suitability of supercomputing systems for graph algorithms, which are…
Expand
2012
2012
Abstract: Hybrid Breadth First Search Implementation for Hybrid-Core Computers
Kevin R. Wadleigh
,
John Amelio
,
K. Collins
,
G. Edwards
SC Companion: High Performance Computing…
2012
Corpus ID: 106900
Summary form only given. The Graph500 benchmark is designed to evaluate the suitability of supercomputing systems for graph…
Expand
2011
2011
Graph Generation on GPUs using Dynamic Memory Allocation
A. Leist
,
K. Hawick
2011
Corpus ID: 17652631
Complex networks are often studied using statistical measurements over many independently generated samples. Irregular data…
Expand