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

Trevor Bunker

dblp:126/3562 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

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

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2Databases, data management, data science and information retrieval · 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
5 papers
Memory systems · 32% Storage systems · 31% Interconnection networks and networks-on-chip · 16%
Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems
non-volatile memory
0.422014
DC express: shortest latency protocol for reading phase change memory over PCI express · FAST 2014
From ARIES to MARS: transaction support for next-generation, solid-state drives · SOSP 2013
Interconnection networks and networks-on-chip › high-speed interconnect
PCIe interconnect
0.212014
DC express: shortest latency protocol for reading phase change memory over PCI express · FAST 2014
Memory systems › non-volatile memory
phase change memory
0.212014
DC express: shortest latency protocol for reading phase change memory over PCI express · FAST 2014
Storage systems › flash and SSD
solid-state drive
0.212014
Willow: A User-Programmable SSD · OSDI 2014
Transaction processing and concurrency control › recovery
write-ahead logging
0.212013
From ARIES to MARS: transaction support for next-generation, solid-state drives · SOSP 2013
Memory systems › non-volatile memory › persistent memory
byte-addressable persistent memory
0.212013
From ARIES to MARS: transaction support for next-generation, solid-state drives · SOSP 2013
Electronic design automation
design space exploration
0.212013
Modeling Power Consumption of NAND Flash Memories Using FlashPower · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2013
Storage systems › flash and SSD
flash memory
0.212013
Modeling Power Consumption of NAND Flash Memories Using FlashPower · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2013
Storage systems
non-volatile memory storage
0.212013
From ARIES to MARS: transaction support for next-generation, solid-state drives · SOSP 2013
Energy-efficient computing
power modeling
0.212013
Modeling Power Consumption of NAND Flash Memories Using FlashPower · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2013
Storage systems
transaction support
0.212013
From ARIES to MARS: transaction support for next-generation, solid-state drives · SOSP 2013
Hardware accelerators and domain-specific architectures › domain-specific accelerator
storage accelerator
0.112014
Willow: A User-Programmable SSD · OSDI 2014
Reconfigurable computing and FPGAs
multi-FPGA system
0.012013
A latency-optimized hybrid network for clustering FPGAs (abstract only) · FPGA 2013

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

write-ahead logging · 0.3serial links · 0.2radix-12 router · 0.2bisection bandwidth optimization · 0.2CACTI · 0.2
YearPublicationVenuePosition
2014 DC express: shortest latency protocol for reading phase change memory over PCI express
Dejan Vucinic, Qingbo Wang, Cyril Guyot, Robert Mateescu, Filip Blagojevic, Luiz Franca-Neto, Damien Le Moal, Trevor Bunker, Jian Xu 0012, Steven Swanson, Zvonimir Bandic
FAST8
2014 Willow: A User-Programmable SSD
Sudharsan Seshadri, Mark Gahagan, Meenakshi Sundaram Bhaskaran, Trevor Bunker, Arup De, Yanqin Jin, Yang Liu 0044, Steven Swanson
OSDI4
2013 Latency-Optimized Networks for Clustering FPGAs
abstract
The data-intensive applications that will shape computing in the coming decades require scalable architectures that incorporate scalable data and compute resources and can support random requests to unstructured (e.g., logs) and semi-structured (e.g., large graph, XML) data sets. To explore the suitability of FPGAs for these computations, we are constructing an FPGAbased system with a memory capacity of 512 GB from a collection of 32 Virtex-5 FPGAs spread across 8 enclosures. This paper describes our work in exploring alternative interconnect technologies and network topologies for FPGA-based clusters. The diverse interconnects combine inter-enclosure high-speed serial links and wide, single-ended intra-enclosure on-board traces with network topologies that balance network diameter, network throughput, and FPGA resource usage. We discuss the architecture of high-radix routers in FPGAs that optimize for the asymmetry between the interand intra-enclosure links. We analyze the various interconnects that aim to efficiently utilize the prototype's total switching capacity of 2.43 Tb/s. The networks we present have aggregate throughputs up to 51.4 GB/s for random traffic, diameters as low as 845 nanoseconds, and consume less than 12% of the FPGAs' logic resources.
Trevor Bunker, Steven Swanson
FCCM1
2013 A latency-optimized hybrid network for clustering FPGAs (abstract only)
abstract
The data-intensive applications that will shape computing in the coming decades require scalable architectures that incorporate scalable data and compute resources and can support unstructured (e.g., logs) and semi-structured (e.g., large graph, XML) data sets. To explore the suitability of FPGAs for these computations, we are constructing an FPGA-based system with a memory capacity of 512 GB from a collection of 32 Virtex-5 FPGAs spread across 8 enclosures. This poster describes the system's interconnect that combines inter-enclosure high-speed serial links and wide, single-ended intra-enclosure on-board traces with a network topology that optimizes for latency and bandwidth for small packets. The network uses a multi-level radix-12 router optimized for the asymmetry between the inter- and intra-enclosure links. The system has a peak theoretical bisection bandwidth of 247.2 Gb/s and a total switching capacity of 2.13 Tb/s. Under random traffic, the network sustains an aggregate throughput of 354.3 Gb/s. The channel transceivers and router consume 22% of the FPGAs' Block RAMs and 33% of their FPGA Slices.
Trevor Bunker, Steven Swanson
FPGA1
2013 From ARIES to MARS: transaction support for next-generation, solid-state drives
abstract
Transaction-based systems often rely on write-ahead logging (WAL) algorithms designed to maximize performance on disk-based storage. However, emerging fast, byte-addressable, non-volatile memory (NVM) technologies (e.g., phase-change memories, spin-transfer torque MRAMs, and the memristor) present very different performance characteristics, so blithely applying existing algorithms can lead to disappointing performance.
Joel Coburn, Trevor Bunker, Meir Schwarz, Rajesh K. Gupta 0001, Steven Swanson
SOSP2
2013 Modeling Power Consumption of NAND Flash Memories Using FlashPower
abstract
Flash is the most popular solid-state memory technology used today. A range of consumer electronics products, such as cell-phones and music players, use flash memory for storage and flash memory is increasingly displacing hard disk drives as the primary storage device in laptops, desktops, and servers. There is a rich microarchitectural design space for flash memory, and there are several architectural options for incorporating flash into the memory hierarchy. Exploring this design space requires detailed insights into the power characteristics of flash memory. In this paper, we present FlashPower, a detailed power model for the two most popular variants of NAND flash, namely, the single-level cell (SLC) and 2-bit Multi-Level Cell (MLC) based flash memory chips. FlashPower is built on top of CACTI, a widely used tool in the architecture community for studying various memory organizations. FlashPower takes several parameters like the device technology, microarchitectural layout, bias voltages and workload parameters as input to estimate the power consumption of a flash chip during its various operating modes. We validate FlashPower against chip power measurements from several different manufacturers and show that our results are comparable to the actual chip measurements. We illustrate the versatility of the tool in a design space exploration of power optimal flash memory array configurations.
Vidyabhushan Mohan, Trevor Bunker, Laura M. Grupp, Sudhanva Gurumurthi, Mircea R. Stan, Steven Swanson
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2