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

Frank A. Nothaft

dblp:117/0589 · also Frank Austin Nothaft · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0002-7729-7055ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4Systems, architecture and hardware · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorArtificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 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
3 papers
Reconfigurable computing and FPGAs · 29% Cloud and datacenter computing · 29% High-performance computing · 17%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cloud deployment
cloud FPGA deployment
0.412019
FPGA Accelerated INDEL Realignment in the Cloud · HPCA 2019
Reconfigurable computing and FPGAs
FPGA accelerator
0.412019
FPGA Accelerated INDEL Realignment in the Cloud · HPCA 2019
High-performance computing
scientific computing systems
0.212015
Rethinking Data-Intensive Science Using Scalable Analytics Systems · SIGMOD Conference 2015
Memory systems
DRAM
0.112012
Towards energy-proportional datacenter memory with mobile DRAM · ISCA 2012
Energy-efficient computing › power management
memory power management
0.112012
Towards energy-proportional datacenter memory with mobile DRAM · ISCA 2012
Bioinformatics and computational biology › sequence analysis
genomic sequence analysis
0.112019
FPGA Accelerated INDEL Realignment in the Cloud · HPCA 2019
Bioinformatics and computational biology › genomics
genomic data analysis
0.112015
Rethinking Data-Intensive Science Using Scalable Analytics Systems · SIGMOD Conference 2015
Energy-efficient computing
datacenter energy efficiency
0.012012
Towards energy-proportional datacenter memory with mobile DRAM · ISCA 2012

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

hardware-software co-design · 0.8FPGA-as-a-service · 0.8horizontally scalable analytics · 0.7workload characterization · 0.1simulation · 0.1
YearPublicationVenuePosition
2020 Kira: Processing Astronomy Imagery Using Big Data Technology
abstract
Scientific analyses commonly compose multiple single-process programs into a dataflow. An end-to-end dataflow of single-process programs is known as a many-task application. Typically, HPC tools are used to parallelize these analyses. In this work, we investigate an alternate approach that uses Apache Spark-a modern platform for data intensive computing-to parallelize many-task applications. We implement Kira, a flexible and distributed astronomy image processing toolkit, and its Source Extractor (Kira SE) application. Using Kira SE as a case study, we examine the programming flexibility, dataflow richness, scheduling capacity and performance of Apache Spark running on the Amazon EC2 cloud. By exploiting data locality, Kira SE achieves a 4.1× speedup over an equivalent C program when analyzing a 1TB dataset using 512 cores on the Amazon EC2 cloud. Furthermore, Kira SE on the Amazon EC2 cloud achieves a 1.8× speedup over the C program on the NERSC Edison supercomputer. A 128-core Amazon EC2 cloud deployment of Kira SE using Spark Streaming can achieve a second-scale latency with a sustained throughput of 800 MB/s. Our experience with Kira demonstrates that data intensive computing platforms like Apache Spark are a performant alternative for many-task scientific applications.
Zhao Zhang 0007, Kyle Barbary, Frank A. Nothaft, Evan Randall Sparks, Oliver Zahn, Michael J. Franklin, David A. Patterson 0001, Saul Perlmutter
IEEE Trans. Big Data3
2019 FPGA Accelerated INDEL Realignment in the Cloud
abstract
The amount of data being generated in genomics is predicted to be between 2 and 40 exabytes per year for the next decade, making genomic analysis the new frontier and the new challenge for precision medicine. This paper explores targeted deployment of hardware accelerators in the cloud to improve the runtime and throughput of immensescale genomic data analyses. In particular, INDEL (INsertion/DELetion) realignment is a critical operation that enables diagnostic testings of cancer through error correction prior to variant calling. It is the slowest part of the somatic (cancer) genomic analysis pipeline, the alignment refinement pipeline, and represents roughly one-third of the execution time of timesensitive diagnostics for acute cancer patients. To accelerate genomic analysis, this paper describes a hardware accelerator for INDEL realignment (IR), and a hardware-software framework leveraging FPGAs-as-a-service in the cloud. We chose to implement genomics analytics on FPGAs because genomic algorithms are still rapidly evolving (e.g. the de facto standard “GATK Best Practices” has had five releases since January of this year). We chose to deploy genomics accelerators in the cloud to reduce capital expenditure and to provide a more quantitative performance and cost analysis. We built and deployed a sea of IR accelerators using our hardware-software accelerator development framework on AWS EC2 F1 instances. We show that our IR accelerator system performed 81× better than multi-threaded genomic analysis software while being 32× more cost efficient.
Lisa Wu Wills, David Bruns-Smith, Frank A. Nothaft, Qijing Huang 0001, Sagar Karandikar, Johnny Le, Andrew Lin, Howard Mao, Brendan Sweeney, Krste Asanovic, David A. Patterson 0001, Anthony D. Joseph
HPCA3
2019 DECA: scalable XHMM exome copy-number variant calling with ADAM and Apache Spark
abstract
BACKGROUND: XHMM is a widely used tool for copy-number variant (CNV) discovery from whole exome sequencing data but can require hours to days to run for large cohorts. A more scalable implementation would reduce the need for specialized computational resources and enable increased exploration of the configuration parameter space to obtain the best possible results. RESULTS: DECA is a horizontally scalable implementation of the XHMM algorithm using the ADAM framework and Apache Spark that incorporates novel algorithmic optimizations to eliminate unneeded computation. DECA parallelizes XHMM on both multi-core shared memory computers and large shared-nothing Spark clusters. We performed CNV discovery from the read-depth matrix in 2535 exomes in 9.3 min on a 16-core workstation (35.3× speedup vs. XHMM), 12.7 min using 10 executor cores on a Spark cluster (18.8× speedup vs. XHMM), and 9.8 min using 32 executor cores on Amazon AWS' Elastic MapReduce. We performed CNV discovery from the original BAM files in 292 min using 640 executor cores on a Spark cluster. CONCLUSIONS: We describe DECA's performance, our algorithmic and implementation enhancements to XHMM to obtain that performance, and our lessons learned porting a complex genome analysis application to ADAM and Spark. ADAM and Apache Spark are a performant and productive platform for implementing large-scale genome analyses, but efficiently utilizing large clusters can require algorithmic optimizations and careful attention to Spark's configuration parameters.
Michael D. Linderman, Davin Chia, Forrest Wallace, Frank A. Nothaft
BMC Bioinform.4
2015 Scientific computing meets big data technology: An astronomy use case
abstract
Scientific analyses commonly compose multiple single-process programs into a dataflow. An end-to-end dataflow of single-process programs is known as a many-task application. Typically, tools from the HPC software stack are used to parallelize these analyses. In this work, we investigate an alternate approach that uses Apache Spark - a modern big data platform - to parallelize many-task applications. We present Kira, a flexible and distributed astronomy image processing toolkit using Apache Spark. We then use the Kira toolkit to implement a Source Extractor application for astronomy images, called Kira SE. With Kira SE as the use case, we study the programming flexibility, dataflow richness, scheduling capacity and performance of Apache Spark running on the EC2 cloud. By exploiting data locality, Kira SE achieves a 3.7 χ speedup over an equivalent C program when analyzing a 1TB dataset using 512 cores on the Amazon EC2 cloud. Furthermore, we show that by leveraging software originally designed for big data infrastructure, Kira SE achieves competitive performance to the C implementation running on the NERSC Edison supercomputer. Our experience with Kira indicates that emerging Big Data platforms such as Apache Spark are a performant alternative for many-task scientific applications.
Zhao Zhang 0007, Kyle Barbary, Frank A. Nothaft, Evan Randall Sparks, Oliver Zahn, Michael J. Franklin, David A. Patterson 0001, Saul Perlmutter
IEEE BigData3
2015 Rethinking Data-Intensive Science Using Scalable Analytics Systems
abstract
"Next generation" data acquisition technologies are allowing scientists to collect exponentially more data at a lower cost. These trends are broadly impacting many scientific fields, including genomics, astronomy, and neuroscience. We can attack the problem caused by exponential data growth by applying horizontally scalable techniques from current analytics systems to accelerate scientific processing pipelines.
Frank A. Nothaft, Matt Massie, Timothy Danford, Zhao Zhang 0007, Uri Laserson, Carl Yeksigian, Jey Kottalam, Arun Ahuja, Jeff Hammerbacher, Michael D. Linderman, Michael J. Franklin, Anthony D. Joseph, David A. Patterson 0001
SIGMOD Conference1
2015 The NIH BD2K center for big data in translational genomics
abstract
The world's genomics data will never be stored in a single repository - rather, it will be distributed among many sites in many countries. No one site will have enough data to explain genotype to phenotype relationships in rare diseases; therefore, sites must share data. To accomplish this, the genetics community must forge common standards and protocols to make sharing and computing data among many sites a seamless activity. Through the Global Alliance for Genomics and Health, we are pioneering the development of shared application programming interfaces (APIs) to connect the world's genome repositories. In parallel, we are developing an open source software stack (ADAM) that uses these APIs. This combination will create a cohesive genome informatics ecosystem. Using containers, we are facilitating the deployment of this software in a diverse array of environments. Through benchmarking efforts and big data driver projects, we are ensuring ADAM's performance and utility.
Benedict Paten, Mark Diekhans, Brian J. Druker, Stephen H. Friend, Justin Guinney, Nadine Gassner, Mitchell Guttman, W. James Kent, Patrick Mantey, Adam A. Margolin, Matt Massie, Adam M. Novak, Frank A. Nothaft, Lior Pachter, David A. Patterson 0001, Maciej Smuga-Otto, Joshua M. Stuart, Laura J. van't Veer, Barbara J. Wold, David Haussler
J. Am. Medical Informatics Assoc.13
2014 Pragma-based floating-to-fixed point conversion for the emulation of analog behavioral models
abstract
Design teams have embraced hardware verification accelerators that enable pre-silicon firmware development. However, emulation is inapplicable for large mixed signal designs. We introduce a methodology that allows for the reuse of analog behavioral models in verification accelerators. We provide a set of pragmas that allow real number models to be converted to fixed point and synthesized and introduce an approach for demonstrating the correctness of these models. We demonstrated this by emulating a large cellular modem within 3,000× the speed of real life, a 3,000,000× speedup over analog simulations, and a 120× speedup over RTL simulations.
Frank A. Nothaft, Luis Fernandez, Stephen Cefali, Nishant Shah, Jacob J. Rael, Luke Darnell
ICCAD1
2012 Towards energy-proportional datacenter memory with mobile DRAM
abstract
To increase datacenter energy efficiency, we need memory systems that keep pace with processor efficiency gains. Currently, servers use DDR3 memory, which is designed for high bandwidth but not for energy proportionality. A system using 20% of the peak DDR3 bandwidth consumes 2.3× the energy per bit compared to the energy consumed by a system with fully utilized memory bandwidth. Nevertheless, many datacenter applications stress memory capacity and latency but not memory bandwidth. In response, we architect server memory systems using mobile DRAM devices, trading peak bandwidth for lower energy consumption per bit and more efficient idle modes. We demonstrate 3-5× lower memory power, better proportionality, and negligible performance penalties for data-center workloads.
Krishna T. Malladi, Frank A. Nothaft, Karthika Periyathambi, Benjamin C. Lee, Christoforos E. Kozyrakis, Mark Horowitz
ISCA2