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

Xiao Wu 0002

dblp:73/6038-2 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0001-5731-1000ORCID · verified

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

Systems, architecture and hardware · 2 · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 since 2021

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
Hardware accelerators and domain-specific architectures · 33% High-performance computing · 33% Reconfigurable computing and FPGAs · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
bioinformatics accelerator
0.512021
Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees · ISCA 2021
Reconfigurable computing and FPGAs
FPGA accelerator
0.512021
Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees · ISCA 2021
High-performance computing › scientific computing
genomic sequence comparison
0.512021
Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees · ISCA 2021
Bioinformatics and computational biology › sequence analysis
read mapping
0.112021
Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees · ISCA 2021
Bioinformatics and computational biology › sequence alignment
seed-and-extend
0.112021
Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees · ISCA 2021

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

enumerated radix tree · 1.0FMD-Index · 1.0
YearPublicationVenuePosition
2021 Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees
abstract
Read alignment is a time-consuming step in genome sequencing analysis. The most widely used software for read alignment, BWA-MEM, and the recently published faster version BWA-MEM2 are based on the seed-and-extend paradigm for read alignment. The seeding step of read alignment is a major bottleneck contributing ~40% to the overall execution time of BWA-MEM2 when aligning whole human genome reads from the Platinum Genomes dataset. This is because both BWA-MEM and BWA-MEM2 use a compressed index structure called the FMD-Index, which results in high bandwidth requirements, primarily due to its character-by-character processing of reads. For instance, to seed each read (101 DNA base-pairs stored in 37.8 bytes), the FMD-Index solution in BWA-MEM2 requires ~68.5 KB of index data.We propose a novel indexing data structure named Enumerated Radix Tree (ERT) and design a custom seeding accelerator based on it. ERT improves bandwidth efficiency of BWA-MEM2 by 4.5× while guaranteeing 100% identical output to the original software, and still fitting in 64 GB DRAM. Overall, the proposed seeding accelerator implemented on AWS F1 FPGA (f1.4xlarge) improves seeding throughput of BWA-MEM2 by 3.3×. When combined with seed-extension accelerators, we observe a 2.1× improvement in overall read alignment throughput over BWA-MEM2. The software implementation of ERT is integrated into BWA-MEM2 (ert branch: https://github.com/bwa-mem2/bwa-mem2/tree/ert) and is open sourced for the benefit of the research community.
Arun Subramaniyan 0001, Jack Wadden, Kush Goliya, Nathan Ozog, Xiao Wu 0002, Satish Narayanasamy, David T. Blaauw, Reetuparna Das
ISCA5
2019 IoT2 - the Internet of Tiny Things: Realizing mm-Scale Sensors through 3D Die Stacking
abstract
The Internet of Things (IoT) is a rapidly evolving application space. One of the fascinating new fields in IoT research is mm-scale sensors, which make up the Internet of Tiny Things (IoT2). With their miniature size, these systems are poised to open up a myriad of new application domains. Enabled by the unique characteristics of cyber-physical systems and recent advances in low-power design and bare-die 3D chip stacking, mm-scale sensors are rapidly becoming a reality. In this paper, we will survey the challenges and solutions to 3D-stacked mm-scale design, highlighting low-power circuit issues ranging from low-power SRAM and miniature neural network accelerators to radio communication protocols and analog interfaces. We will discuss system-level challenges and illustrate several complete systems and their merging application spaces.
Sechang Oh 0001, Minchang Cho, Xiao Wu 0002, Yejoong Kim, Li-Xuan Chuo, Wootaek Lim, Pat Pannuto, Suyoung Bang, Kaiyuan Yang 0001, Hun-Seok Kim, Dennis Sylvester, David T. Blaauw
DATE3