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.

Huapeng Yuan

dblp:17/5109 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers
Storage systems · 56% Distributed systems · 44%

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

TopicWeightPapersLastEvidence papers
Distributed systems
consensus
0.412020
Fine-Grained Replicated State Machines for a Cluster Storage System · NSDI 2020
Distributed systems › replication
state machine replication
0.412020
Fine-Grained Replicated State Machines for a Cluster Storage System · NSDI 2020
Storage systems
key-value storage
0.312017
TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores · USENIX ATC 2017
Storage systems › key-value storage
LSM-tree key-value store
0.312017
TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores · USENIX ATC 2017
Storage systems › storage engine
storage engine design
0.112017
TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores · USENIX ATC 2017

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

state machine replication · 0.4
YearPublicationVenuePosition
2020 Fine-Grained Replicated State Machines for a Cluster Storage System
Ming Liu 0027, Arvind Krishnamurthy, Harsha V. Madhyastha, Rishi Bhardwaj, Chinmay Kamat, Huapeng Yuan, Aditya Jaltade, Roger Liao, Pavan Konka, Anoop Jawahar
NSDI7
2017 TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores
Oana Balmau, Diego Didona, Rachid Guerraoui, Willy Zwaenepoel, Huapeng Yuan, Aashray Arora, Pavan Konka
USENIX ATC5
2007 High Performance Multi-paradigm Messaging Runtime Integrating Grids and Multicore Systems
abstract
eScience applications need to use distributed Grid environments where each component is an individual or cluster of multicore machines. These are expected to have 64-128 cores 5 years from now and need to support scalable parallelism. Users will want to compose heterogeneous components into single jobs and run seamlessly in both distributed fashion and on a future "Grid on a chip" with different subsets of cores supporting individual components. We support this with a simple programming model made up of two layers supporting traditional parallel and Grid programming paradigms (workflow) respectively. We examine for a parallel clustering application, the Concurrency and Coordination Runtime CCR from Microsoft as a multi-paradigm runtime that integrates the two layers. Our work uses managed code (C#) and for AMD and Intel processors shows around a factor of 5 better performance than Java. CCR has MPI pattern and dynamic threading latencies of a few microseconds that are competitive with the performance of standard MPI for C.
Xiaohong Qiu, Geoffrey C. Fox, Huapeng Yuan, Seung-Hee Bae, George Chrysanthakopoulos, Henrik Frystyk Nielsen
eScience3