Tianhegraph: Customizing graph search for graph500 on tianhe supercomputer
As the era of exascale supercomputing is coming, it is vital for next-generation
supercomputers to find appropriate applications with high social and economic benefit. In …
supercomputers to find appropriate applications with high social and economic benefit. In …
Boosting the efficiency of HPCG and Graph500 with near-data processing
E Vermij, L Fiorin, C Hagleitner… - 2017 46th International …, 2017 - ieeexplore.ieee.org
HPCG and Graph500 can be regarded as the two most relevant benchmarks for high-
performance computing systems. Existing supercomputer designs, however, tend to focus …
performance computing systems. Existing supercomputer designs, however, tend to focus …
Highspeed graph processing exploiting main-memory column stores
A popular belief in the graph database community is that relational database management
systems are generally ill-suited for efficient graph processing. This might apply for analytic …
systems are generally ill-suited for efficient graph processing. This might apply for analytic …
Scale-free graph processing on a numa machine
Modern shared-memory systems embrace the NUMA architecture which has proven to be
more scalable than the SMP architecture. In many ways, a NUMA system resembles a …
more scalable than the SMP architecture. In many ways, a NUMA system resembles a …
A new method for cross-language information retrieval by summing weights of graphs
SA Yuan, SN Yu - … on Fuzzy Systems and Knowledge Discovery …, 2007 - ieeexplore.ieee.org
Disambiguation is the aim of most translation techniques used in cross-language
information retrieval. In this paper, we present a new method for query translation which only …
information retrieval. In this paper, we present a new method for query translation which only …
Customizing graph500 for Tianhe pre-exacale system
X Gan - arXiv preprint arXiv:2102.01254, 2021 - arxiv.org
BFS (Breadth-First Search) is a typical graph algorithm used as a key component of many
graph applications. However, current distributed parallel BFS implementations suffer from …
graph applications. However, current distributed parallel BFS implementations suffer from …
[PDF][PDF] Graph Processing in Main-Memory Column Stores
M Paradies - 2017 - core.ac.uk
Evermore, novel and traditional business applications leverage the advantages of a graph
data model, such as the offered schema flexibility and an explicit representation of …
data model, such as the offered schema flexibility and an explicit representation of …
A caching approach to reduce communication in graph search algorithms
P Cicotti, L Carrington - 2014 International Workshop on Data …, 2014 - ieeexplore.ieee.org
In many scientific and computational domains, graphs are used to represent and analyze
data. Such graphs often exhibit the characteristics of small-world networks: few high-degree …
data. Such graphs often exhibit the characteristics of small-world networks: few high-degree …
[PDF][PDF] Dieses Dokument ist eine Zweitveröffentlichung (Postprint)/This is a self-archiving document (accepted version)
HGPE Main-Memory, C Stores - d-nb.info
A popular belief in the graph database community is that relational database management
systems are generally ill-suited for efficient graph processing. This might apply for analytic …
systems are generally ill-suited for efficient graph processing. This might apply for analytic …
Reducing communication in parallel graph search algorithms with software caches
P Cicotti, M Shantharam… - … International Journal of …, 2019 - journals.sagepub.com
In many scientific and computational domains, graphs are used to represent and analyze
data. Such graphs often exhibit the characteristics of small-world networks: few high-degree …
data. Such graphs often exhibit the characteristics of small-world networks: few high-degree …