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

David Cashman

dblp:40/87 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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

Systems, architecture and hardware · 3Theory of computation · 2Databases, data management, data science and information retrieval · 1 · 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
4 papers
Reconfigurable computing and FPGAs · 74% Storage systems · 20% Hardware reliability and fault tolerance · 6%
Theoretical computer science
2 papers
Approximation and online algorithms · 48% Mathematical optimization · 27% Computational complexity · 19%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 100%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA architecture
0.322013
Architectural enhancements in Stratix V™ · FPGA 2013
Architectural enhancements in Stratix-IIITM and Stratix-IVTM · FPGA 2009
Reconfigurable computing and FPGAs
FPGA memory architecture
0.322013
Architectural enhancements in Stratix V™ · FPGA 2013
Architectural enhancements in Stratix-IIITM and Stratix-IVTM · FPGA 2009
Approximation and online algorithms › approximation algorithms
local ratio
0.222011
How well can primal-dual and local-ratio algorithms perform? · ACM Trans. Algorithms 2011
How Well Can Primal-Dual and Local-Ratio Algorithms Perform? · ICALP 2005
Mathematical optimization
primal-dual method
0.222011
How well can primal-dual and local-ratio algorithms perform? · ACM Trans. Algorithms 2011
How Well Can Primal-Dual and Local-Ratio Algorithms Perform? · ICALP 2005
Storage systems › data management › database storage
columnar storage
0.212022
Photon: A Fast Query Engine for Lakehouse Systems · SIGMOD Conference 2022
Approximation and online algorithms
approximation algorithms
0.112011
How well can primal-dual and local-ratio algorithms perform? · ACM Trans. Algorithms 2011
Computational complexity
hardness of approximation
0.112011
How well can primal-dual and local-ratio algorithms perform? · ACM Trans. Algorithms 2011
Reconfigurable computing and FPGAs › FPGA architecture
adaptive logic module
0.112005
The Stratix II logic and routing architecture · FPGA 2005
Reconfigurable computing and FPGAs
FPGA routing architecture
0.112005
The Stratix II logic and routing architecture · FPGA 2005
Hardware reliability and fault tolerance
error correction
0.012013
Architectural enhancements in Stratix V™ · FPGA 2013
Computational geometry
packing and covering
0.012011
How well can primal-dual and local-ratio algorithms perform? · ACM Trans. Algorithms 2011
Approximation and online algorithms › approximation algorithms
approximation guarantees
0.012005
How Well Can Primal-Dual and Local-Ratio Algorithms Perform? · ICALP 2005

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

routing layer optimization · 0.2multi-bit skip adder · 0.2stack model · 0.1inapproximability reduction · 0.1heterogeneous memory mapping · 0.1FPGA Modeling Toolkit · 0.1arithmetic structure design · 0.1LUT partitioning · 0.1
YearPublicationVenuePosition
2022 Photon: A Fast Query Engine for Lakehouse Systems
abstract
Many organizations are shifting to a data management paradigm called the "Lakehouse," which implements the functionality of structured data warehouses on top of unstructured data lakes. This presents new challenges for query execution engines. The engine needs to provide good performance on the raw uncurated datasets that are ubiquitous in data lakes, and excellent performance on structured data stored in popular columnar file formats like Apache Parquet. Toward these goals, we present Photon, a vectorized query engine for Lakehouse environments that we developed at Databricks. Photon can outperform existing warehouses on SQL workloads and also supports the Apache Spark API. We discuss the design choices we made in Photon (e.g., vectorization vs. code generation) and describe its integration with our existing SQL and Apache Spark runtimes, its task model, and its memory manager. Photon has accelerated some customer workloads by over 10x and has recently allowed Databricks to set a new audited performance record for the official 100TB TPC-DS benchmark.
Alexander Behm, Shoumik Palkar, Utkarsh Agarwal, Timothy Armstrong, David Cashman, Ankur Dave, Todd Greenstein, Shant Hovsepian, Arvind Sai Krishnan, Paul Leventis, Ala Luszczak, Prashanth Menon, Mostafa Mokhtar, Gene Pang, Sameer Paranjpye, Greg Rahn, Bart Samwel, Tom van Bussel, Herman Van Hövell, Maryann Xue, Reynold Xin, Matei Zaharia
SIGMOD Conference5
2013 Architectural enhancements in Stratix V™
abstract
This paper describes architectural enhancements in the Altera Stratix-V" FPGA architecture, built on a 28nm TSMC process, together with the data supporting those choices. Among the key features are time borrowing flip-flops, a doubling of the number of flip-flops per LUT compared to previous Stratix architectures, a simplified embedded 20kb dual-port RAM block, and error correction that can correct up to 8 adjacent errors. Arithmetic performance is significantly improved using a fast adder with two levels of multi-bit skip. We also describe how the routing architecture and layout is optimized for the 28nm process to take advantage of a wider range of wire thicknesses offered on the different layers, and improvements in performance and routability are obtained without dramatic changes to the repeated floorplan of the logic plus routing fabric.
David M. Lewis, David Cashman, Mark Chan, Jeffrey Chromczak, Gary Lai, Andy Lee, Tim Vanderhoek, Haiming Yu
FPGA2
2011 How well can primal-dual and local-ratio algorithms perform?
abstract
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations and hence our approximation bounds are independent of the P versus NP question. Using the stack model, we bound the performance of a broad class of primal-dual and local-ratio algorithms and supply a (log n +1)/2 inapproximability result for set cover, a 4/3 inapproximability for min Steiner tree, and a 0.913 inapproximability for interval scheduling on two machines.
Allan Borodin, David Cashman, Avner Magen
ACM Trans. Algorithms2
2009 Architectural enhancements in Stratix-IIITM and Stratix-IVTM
abstract
This paper describes architectural enhancements in the Stratix-III" and Stratix-IV" FPGA architectures. These architectures feature programmable power management, which allows the power and performance of logic and routing to be varied to minimize total power without any performance loss. This paper describes the technique used for programmable power management, and describes the experimental evaluation that led to the choice of regions in these architectures. The memory architecture is also explored by adding heterogeneous memory mapping to the FPGA Modeling Toolkit, and used to explore LUT based memory structures. The ALM structure provides more inputs than required for a simple 6 LUT, which can be used with simple modifications to efficiently support simple dual-ported LUT based RAM. Replacing the Stratix-II" small memory blocks with LUT RAM and changing the size of other two memories is shown to reduce overall core area across a set of benchmark designs.
David M. Lewis, Elias Ahmed, David Cashman, Tim Vanderhoek, Christopher Lane, Andy Lee, Philip Pan
FPGA3
2005 The Stratix II logic and routing architecture
abstract
This paper describes the Altera Stratix II™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15% in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perform two bits of arithmetic per ALM, and perform a sum of up to three inputs. The routing fabric adds a new set of fast inputs to the routing multiplexers for another 3% improvement in performance, while other improvements in routing efficiency cause another 6% reduction in area. These changes in combination with other circuit and architecture changes in Stratix II contribute 27% of an overall 51% performance improvement (including architecture and process improvement). The architecture changes reduce area by 10% in the same process, and by 50% after including process migration.
David M. Lewis, Elias Ahmed, Gregg Baeckler, Vaughn Betz, Mark Bourgeault, David Cashman, David R. Galloway, Mike Hutton, Christopher Lane, Andy Lee, Paul Leventis, Sandy Marquardt, Cameron McClintock, Ketan Padalia, Bruce Pedersen, Giles Powell, Boris Ratchev, Srinivas Reddy, Jay Schleicher, Kevin Stevens, Richard Yuan, Richard Cliff, Jonathan Rose
FPGA6
2005 How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
Allan Borodin, David Cashman, Avner Magen
ICALP2