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

Huynh Tu Dang

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

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

Computer networks · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, 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
2 papers
Distributed systems · 52% Memory systems · 32% Hardware reliability and fault tolerance · 16%
Computer networks
2 papers
Software-defined and programmable networks · 91% Network optimization and economics · 9%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
programmable data plane
0.822020
P4xos: Consensus as a Network Service · IEEE/ACM Trans. Netw. 2020
The Case For In-Network Computing On Demand · EuroSys 2019
Distributed systems
consensus
0.522020
P4xos: Consensus as a Network Service · IEEE/ACM Trans. Netw. 2020
Consensus for Non-volatile Main Memory · ICNP 2018
Distributed systems › consensus
paxos
0.412020
P4xos: Consensus as a Network Service · IEEE/ACM Trans. Netw. 2020
Software-defined and programmable networks › programmable data plane
in-network computation
0.412019
The Case For In-Network Computing On Demand · EuroSys 2019
Hardware reliability and fault tolerance
memory reliability
0.312018
Consensus for Non-volatile Main Memory · ICNP 2018
Memory systems
non-volatile memory
0.312018
Consensus for Non-volatile Main Memory · ICNP 2018
Memory systems › non-volatile memory
storage class memory
0.312018
Consensus for Non-volatile Main Memory · ICNP 2018
Distributed systems › replication
replication and fault tolerance
0.112018
Consensus for Non-volatile Main Memory · ICNP 2018

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

p4 · 0.9formal verification · 0.9programmable network hardware · 0.4cost-benefit analysis · 0.4software memory controller emulation · 0.3data replication · 0.3consensus protocol · 0.3
YearPublicationVenuePosition
2020 P4xos: Consensus as a Network Service
abstract
In this paper, we explore how a programmable forwarding plane offered by a new breed of network switches might naturally accelerate consensus protocols, specifically focusing on Paxos. The performance of consensus protocols has long been a concern. By implementing Paxos in the forwarding plane, we are able to significantly increase throughput and reduce latency. Our P4-based implementation running on an ASIC in isolation can process over 2.5 billion consensus messages per second, a four orders of magnitude improvement in throughput over a widely-used software implementation. This effectively removes consensus as a bottleneck for distributed applications in data centers. Beyond sheer performance, our approach offers several other important benefits: it readily lends itself to formal verification; it does not rely on any additional network hardware; and as a full Paxos implementation, it makes only very weak assumptions about the network.
Huynh Tu Dang, Pietro Bressana, Han Wang 0009, Ki Suh Lee, Noa Zilberman, Hakim Weatherspoon, Marco Canini, Fernando Pedone, Robert Soulé
IEEE/ACM Trans. Netw.1
2019 The Case For In-Network Computing On Demand
abstract
Programmable network hardware can run services traditionally deployed on servers, resulting in orders-of-magnitude improvements in performance. Yet, despite these performance improvements, network operators remain skeptical of in-network computing. The conventional wisdom is that the operational costs from increased power consumption outweigh any performance benefits. Unless in-network computing can justify its costs, it will be disregarded as yet another academic exercise.
Yuta Tokusashi, Huynh Tu Dang, Fernando Pedone, Robert Soulé, Noa Zilberman
EuroSys2
2018 Consensus for Non-volatile Main Memory
abstract
Traditionally, computer storage has been separated into a hierarchy based on response time, volatility, and cost of media. This tiering is undergoing a significant upheaval as a new breed of memory technologies, termed Storage Class Memories (SCM), now make it feasible to replace several tiers of the hierarchy with a single, cost-effective, uniform type of memory/storage. To make large-scale SCM deployments practical, however, memory system designers will first need to solve the problem of how to guard against unavoidable storage wear-out and failures-problems traditionally absent from "main memory" and handled by software at leisurely timescales in the domain of storage. In this paper, we propose a novel approach to providing fault tolerance in SCM-based main memory. Our key insight is to treat memory as a distributed storage system and rely on data replication and a consensus protocol to keep the replicas consistent. Separate memory instances store replicated copies of the data, and we use a programmable network interconnect to provide fast consensus between the memory instances. Our initial experiments using software memory controller emulation demonstrate reasonable overhead over local memory reads and show great promise as scalable main memory.
Huynh Tu Dang, Jaco Hofmann, Marjan Radi, Dejan Vucinic, Robert Soulé, Fernando Pedone
ICNP1
2012 Applying MapReduce Framework to Peer-to-Peer Computing Applications
Huynh Tu Dang, Ha Manh Tran, Phach Ngoc Vu, An Truong Nguyen
ICCCI (2)1