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

Weiqiang Wan

dblp:235/2611 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · unresolved

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

Systems, architecture and hardware · 1

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% Storage systems · 23%

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

TopicWeightPapersLastEvidence papers
High-performance computing › scientific computing
data assimilation
0.412019
S-EnKF: co-designing for scalable ensemble Kalman filter · PPoPP 2019
High-performance computing
parallel i/o
0.412019
S-EnKF: co-designing for scalable ensemble Kalman filter · PPoPP 2019
Storage systems › shared storage
concurrent access
0.112019
S-EnKF: co-designing for scalable ensemble Kalman filter · PPoPP 2019
Storage systems › file systems › distributed file system
parallel file system
0.112019
S-EnKF: co-designing for scalable ensemble Kalman filter · PPoPP 2019

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

multi-stage computation · 0.4cost model · 0.4auto-tuning · 0.4
YearPublicationVenuePosition
2019 S-EnKF: co-designing for scalable ensemble Kalman filter
abstract
Ensemble Kalman filter (EnKF) is one of the most important methods for data assimilation, which is widely applied to the reconstruction of observed historical data for providing initial conditions of numerical atmospheric and oceanic models. With the improvement of data resolution and the increase in the amount of model data, the scalability of recent parallel implementations suffers from high overhead on data transfer. In this paper, we propose, S-EnKF: a scalable and distributed EnKF adaptation for modern clusters. With an in-depth analysis of new requirements brought forward by recent frameworks and limitations of current designs, we present a co-design of S-EnKF. For fully exploiting the resources available in modern parallel file systems, we design a concurrent access approach to accelerate the process of reading large amounts of background data. Through a deeper investigation of the data dependence relations, we modify EnKF's workflow to maximize the overlap of file reading and local analysis with a new multi-stage computation approach. Furthermore, we push the envelope of performance further with aggressive co-design of auto-tuning through tradeoff between the benefit on runtime and the cost on processors based on classic cost models. The experimental evaluation of S-EnKF demonstrates nearly ideal strong scalability on up to 12,000 processors. The largest run sustains a performance of 3x-speedup compared with P-EnKF, which represents the state-of-art parallel implementation of EnKF.
Junmin Xiao, Weiqiang Wan, Xuehai Hong, Guangming Tan
PPoPP3