Demo Data from VLDB 2026 / reviewers in the wild / expert
Frank T. Hady
dblp:63/2919
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-authorComputer networks · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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 |
Storage systems · 53% Memory systems · 42% Performance modeling and evaluation · 2% | |
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Indexing and storage engines · 100% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › storage performance
low-latency storage |
0.3 | 1 | 2017 | Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017 |
Memory systems
non-volatile memory |
0.3 | 1 | 2017 | Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017 |
Storage systems
non-volatile memory storage |
0.3 | 1 | 2017 | Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017 |
Memory systems › non-volatile memory
persistent memory |
0.3 | 1 | 2017 | Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017 |
Storage systems › storage performance
i/o latency |
0.1 | 1 | 2012 | When poll is better than interrupt · FAST 2012 |
Indexing and storage engines
key-value store |
0.1 | 1 | 2017 | Platform Storage Performance With 3D XPoint Technology · Proc. IEEE 2017 |
Performance modeling and evaluation › network performance analysis
network performance modeling |
0.0 | 1 | 1995 | The Performance of Crossbar-Based Binary Hypercubes · IEEE Trans. Computers 1995 |
Performance modeling and evaluation
queueing models |
0.0 | 1 | 1995 | The Performance of Crossbar-Based Binary Hypercubes · IEEE Trans. Computers 1995 |
Electronic design automation › physical design
routing |
0.0 | 1 | 1995 | The Performance of Crossbar-Based Binary Hypercubes · IEEE Trans. Computers 1995 |
Interconnection networks and networks-on-chip › routing algorithms
wormhole routing |
0.0 | 1 | 1995 | The Performance of Crossbar-Based Binary Hypercubes · IEEE Trans. Computers 1995 |
Interconnection networks and networks-on-chip
hypercube network |
0.0 | 1 | 1995 | The Performance of Crossbar-Based Binary Hypercubes · IEEE Trans. Computers 1995 |
Parallel and multicore computing
multicomputer |
0.0 | 1 | 1995 | The Performance of Crossbar-Based Binary Hypercubes · IEEE Trans. Computers 1995 |
Methods — techniques the papers use, named apart from their topics
storage performance measurement · 0.6OS paging · 0.6queueing theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Platform Storage Performance With 3D XPoint TechnologyabstractWith a combination of high performance and nonvolatility, the arrival of 3D XPoint memory promises to fundamentally change the memory-storage hierarchy at the hardware, system software, and application levels. This memory will be deployed first as a block addressable storage device, known as the Intel Optane SSD, and even in this familiar form it will drive basic system change. Access times consistently as fast, or faster, than the rest of the system will blur the line between storage and memory. The low latencies from these solid-state drives (SSDs) allow rethinking even basic storage methodologies to be more memory-like. For example, the manner in which storage performance is measured shifts from inputoutput operations (IOs) at a given queue depth to response time for a given load, like memory is typically measured. System changes to match the low latency of these SSDs are already advanced, and in many cases they enable the application to utilize the SSD's performance. In other cases, additional work is required, particularly on policies set originally with slow storage in mind. On top of these already-capable systems are real applications. System-level tests show that applications such as keyvalue stores and real-time analytics can benefit immediately. These application benefits include significantly faster runtime (up to 3× ) and access to larger data sets than supported in DRAM. Newly viable mechanisms for expanding application memory footprint include native application support or native operating system paging, a significant change in the use of SSDs. The next step in this convergence is 3D XPoint memory accessed through processor load/store operations. Significant operating system support is already in place. The implications of consistently low latency storage and fast persistent memory on computing are great, with applications and systems taking advantage of this new technology as storage as the first to benefit. Frank T. Hady, Annie P. Foong, Bryan Veal |
Proc. IEEE | 1 |
| 2012 | When poll is better than interrupt
Jisoo Yang, Dave B. Minturn, Frank T. Hady |
FAST | 3 |
| 2005 | Network processor acceleration for a Linux* netfilter firewallabstractNetwork firewalls occupy a central role in computer security, protecting data, compute, and networking resources while still allowing useful packets to flow. Increases in both the work per network packet and packet rate make it increasingly difficult for general-purpose processor based firewalls to maintain line rate. In a bid to address these evolving requirements we have prototyped a hybrid firewall, using a simple firewall running on a network processor to accelerate a Linux* Netfilter Firewall executing on a general purpose processor. The simple firewall on the network processor provides high rate packet processing for all the packets while the general-purpose processor delivers high rate, full featured firewall processing for those packets that need it. This paper describes the hybrid firewall prototype with a focus on the software created to accelerate Netfilter with a network processor resident firewall. Measurements show our hybrid firewall able to maintain close to 2 Gb/sec line rate for all packet sizes, a significant improvement over the original firewall. We also include the hard won lessons learned while implementing the hybrid firewall. Kristen Accardi, Tony Bock, Frank T. Hady, Jon Krueger |
ANCS | 3 |
| 1995 | The Performance of Crossbar-Based Binary HypercubesabstractWormhole routing is an attractive routing technique offering low latency communication without the need to buffer an entire packet in a single node. A new queueing-theoretic model for obtaining throughput and latency of binary hypercubes supporting wormhole routing is developed here. The model is very accurate in predicting the performance of an actual multicomputer over a range of network sizes, packet lengths, and input port priority mappings. Utilizing the model, the performance of networks with identical topologies but different node architectures is estimated.> Frank T. Hady, Bernard L. Menezes |
IEEE Trans. Computers | 1 |
| 1992 | Hnet: A High-performance Network Evaluation Testbed
David Smitley, Frank T. Hady, Dan Burns |
ICPP (1) | 2 |