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.

Taichuan Lu

dblp:23/8524 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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
Storage systems · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
content-addressable storage
0.112010
Storage deduplication for Virtual Ad Hoc Network testbed by File-level Block Sharing · HPDC 2010
Storage systems › file systems
copy-on-write
0.112010
Storage deduplication for Virtual Ad Hoc Network testbed by File-level Block Sharing · HPDC 2010
Storage systems › data reduction
data deduplication
0.112010
Storage deduplication for Virtual Ad Hoc Network testbed by File-level Block Sharing · HPDC 2010

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

hash computation · 0.2file-level block sharing · 0.2
YearPublicationVenuePosition
2010 Storage deduplication for Virtual Ad Hoc Network testbed by File-level Block Sharing
abstract
Virtual Ad Hoc Network (VAN) testbed aims at achieving large scale application testing for ad hoc networks by integrating host virtualization and network simulation. Efficient use of storage space is essential for such testbeds. Storage redundancy resulting from duplicated files and application installations across the virtual machines in a large scale testbed (> a few hundred VMs) can be significantly reduced by using storage sharing techniques. Although Content Addressable Storage (CAS) along with Copy-on-write can remove storage redundancy at block-level, it requires hash computation for every write operation that incurs considerable online computation overhead.
Chang-Han Jong, C. Jason Chiang, Taichuan Lu, Alexander Poylisher, Constantin Serban
HPDC3