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

Zhouwang Fu

dblp:175/7094 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author

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
Parallel and multicore computing · 50% Cloud and datacenter computing · 25% Distributed systems · 25%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.312018
Efficient shuffle management with SCache for DAG computing frameworks · PPoPP 2018
Parallel and multicore computing › task scheduling
DAG scheduling
0.312018
Efficient shuffle management with SCache for DAG computing frameworks · PPoPP 2018
Parallel and multicore computing
data-parallel programming
0.312018
Efficient shuffle management with SCache for DAG computing frameworks · PPoPP 2018
Distributed systems › distributed data processing
shuffle optimization
0.312018
Efficient shuffle management with SCache for DAG computing frameworks · PPoPP 2018

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

shuffle size prediction · 0.3prefetching · 0.3heuristic pre-scheduling · 0.3
YearPublicationVenuePosition
2021 Efficient shuffle management for DAG computing frameworks based on the FRQ model
Chunghsuan Wu, Zhouwang Fu, Tao Song 0003, Yanqiang Liu, Zhengwei Qi, Haibing Guan
J. Parallel Distributed Comput.3
2018 Efficient shuffle management with SCache for DAG computing frameworks
abstract
In large-scale data-parallel analytics, shuffle, or the cross-network read and aggregation of partitioned data between tasks with data dependencies, usually brings in large overhead. To reduce shuffle overhead, we present SCache, an open source plug-in system that particularly focuses on shuffle optimization. By extracting and analyzing shuffle dependencies prior to the actual task execution, SCache can adopt heuristic pre-scheduling combining with shuffle size prediction to pre-fetch shuffle data and balance load on each node. Meanwhile, SCache takes full advantage of the system memory to accelerate the shuffle process. We have implemented SCache and customized Spark to use it as the external shuffle service and co-scheduler. The performance of SCache is evaluated with both simulations and testbed experiments on a 50-node Amazon EC2 cluster. Those evaluations have demonstrated that, by incorporating SCache, the shuffle overhead of Spark can be reduced by nearly 89%, and the overall completion time of TPC-DS queries improves 40% on average.
Zhouwang Fu, Tao Song 0003, Zhengwei Qi, Haibing Guan
PPoPP1
2015 Seagull - A Real-Time Coflow Scheduling System
abstract
Data-parallel applications often generate hundreds of flows at the same time in data centers. Since these flows are always connected with application context, traditional flow-level optimization policies are hard to perform well in such collections. The coflow abstraction brings hope and opportunity to make the scheduling much more efficient. But exsiting schedule systems based on that related concept are either static (such as Varys) or impracticable (such as Baraat). In this paper, we address these limitations by presenting Seagull -- a dynamic precise coflow scheduling system to optimize the average CCT (Coflow Completion Time) and guaranteeing predictable completions within coflow deadlines. It's a centralized system which can share the bandwidth resources with background flows in the data center. Our experiments show that 80% CCT of the coflows is about 1.7× faster than Varys. As for deadline meeting, Seagull can guarantee about 50% of admitted coflows finishing within their deadline, which is 10% more precise than Varys.
Zhouwang Fu, Tao Song 0003, Fuzong Wang, Zhengwei Qi
CSCloud1