Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Han Xu 0008

dblp:32/34-8 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0003-4046-3002ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Applied, interdisciplinary, general and emerging computing · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 77% GPUs and heterogeneous computing · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
supercomputing
0.312018
Customizing the HPL for China accelerator · Sci. China Inf. Sci. 2018
GPUs and heterogeneous computing › heterogeneous supercomputing
accelerator-based supercomputing
0.112018
Customizing the HPL for China accelerator · Sci. China Inf. Sci. 2018

Methods — techniques the papers use, named apart from their topics

HPL benchmarking · 0.3
YearPublicationVenuePosition
2020 OHTMA: an optimized heuristic topology-aware mapping algorithm on the Tianhe-3 exascale supercomputer prototype
abstract
With the rapid increase of the size of applications and the complexity of the supercomputer architecture, topology-aware process mapping becomes increasingly important. High communication cost has become a dominant constraint of the performance of applications running on the supercomputer. To avoid a bad mapping strategy which can lead to terrible communication performance, we propose an optimized heuristic topology-aware mapping algorithm (OHTMA). The algorithm attempts to minimize the hop-byte metric that we use to measure the mapping results. OHTMA incorporates a new greedy heuristic method and pair-exchange-based optimization. It reduces the number of long-distance communications and effectively enhances the locality of the communication. Experimental results on the Tianhe-3 exascale supercomputer prototype indicate that OHTMA can significantly reduce the communication costs.
Yishui Li, Xinhai Chen 0001, Jie Liu 0002, Bo Yang 0023, Chunye Gong, Xinbiao Gan, Shengguo Li, Han Xu 0008
Frontiers Inf. Technol. Electron. Eng.8
2020 VBSF: a new storage format for SIMD sparse matrix-vector multiplication on modern processors
Yishui Li, Peizhen Xie, Xinhai Chen 0001, Jie Liu 0002, Bo Yang 0023, Shengguo Li, Chunye Gong, Xinbiao Gan, Han Xu 0008
J. Supercomput.9
2018 Customizing the HPL for China accelerator
Xinbiao Gan, Yikun Hu 0001, Jie Liu 0002, Lihua Chi, Han Xu 0008, Chunye Gong, Shengguo Li, Yihui Yan
Sci. China Inf. Sci.5
2012 High-Performance Matrix Multiply on a Massively Multithreaded Fiteng1000 Processor
Jie Liu 0002, Lihua Chi, Chunye Gong, Han Xu 0008, Yihui Yan, Qingfeng Hu
ICA3PP (2)4