Geoff Kuenning
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Geoff Kuenning has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Erez Zadok
Stony Brook University, Stony Brook, NY, USA
6 shared publications - Scott A. Smolka
Computer Science, Stony Brook University
2 shared publications - Yifei Liu
Stony Brook University, Stony Brook, NY, USA
2 shared publications - Youjip Won
Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea
2 shared publications - Anshul Gandhi
Stony Brook University, Stony Brook, USA
1 shared publication - Avani Wildani
Emory University, Atlanta, GA, USA and Cloudflare, San Francisco, CA, USA
1 shared publication
Latest Publications
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 151-166
Enhanced File System Testing through Input and Output Coverage
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 151-166
Open AccessEnhanced File System Testing through Input and Output Coverage
- Open Access
- 22 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (3) , 1-3
The Past, Present, and Future of Storage Technologies (part 2 of 2)
- 22 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (3) , 1-3
Open AccessThe Past, Present, and Future of Storage Technologies (part 2 of 2)
- Open Access
- 15 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (1) , 1-3
The Past, Present, and Future of Storage Technologies (Part 1 of 2)
- 15 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (1) , 1-3
Open AccessThe Past, Present, and Future of Storage Technologies (Part 1 of 2)
- Open Access
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 23-30
Persistent Memory Research in the Post-Optane Era
After over a decade of researcher anticipation for the arrival of persistent memory (PMem), the first shipments of 3D XPoint-based Intel Optane Memory in 2019 were quickly followed by its cancellation in 2022. Was this another case of an idea quickly fading from future to past tense, relegating work in this area to the graveyard of failed technologies? The recently introduced Compute Express Link (CXL) may offer a path forward, with its persistent memory profile offering a universal PMem attachment point. Yet new technologies for memory-speed persistence seem years off, and may never become competitive with evolving DRAM and flash speeds. Without persistent memory itself, is future PMem research doomed? We offer two arguments for why reports of the death of PMem research are greatly exaggerated. First, the bulk of persistent-memory research has not in fact addressed memory persistence, but rather in-memory crash consistency, which was never an issue in prior systems where CPUs could not observe post-crash memory states. CXL memory pooling allows multiple hosts to share a single memory, all in different failure domains, raising crash-consistency issues even with volatile memory. Second, we believe CXL necessitates a "disaggregation" of PMem research. Most work to date assumed a single technology and set of features, i.e., speed, byte addressability, and CPU load/store access. With an open interface allowing new topologies and diverse PMem technologies, we argue for the need to examine these features individually and in combination. While one form of PMem may have been canceled, we argue that the research problems it raised not only remain relevant but have expanded in a CXL-based future.
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 23-30
Open AccessPersistent Memory Research in the Post-Optane Era
After over a decade of researcher anticipation for the arrival of persistent memory (PMem), the first shipments of 3D XPoint-based Intel Optane Memory in 2019 were quickly followed by its cancellation in 2022. Was this another case of an idea quickly fading from future to past tense, relegating work in this area to the graveyard of failed technologies? The recently introduced Compute Express Link (CXL) may offer a path forward, with its persistent memory profile offering a universal PMem attachment point. Yet new technologies for memory-speed persistence seem years off, and may never become competitive with evolving DRAM and flash speeds. Without persistent memory itself, is future PMem research doomed? We offer two arguments for why reports of the death of PMem research are greatly exaggerated. First, the bulk of persistent-memory research has not in fact addressed memory persistence, but rather in-memory crash consistency, which was never an issue in prior systems where CPUs could not observe post-crash memory states. CXL memory pooling allows multiple hosts to share a single memory, all in different failure domains, raising crash-consistency issues even with volatile memory. Second, we believe CXL necessitates a "disaggregation" of PMem research. Most work to date assumed a single technology and set of features, i.e., speed, byte addressability, and CPU load/store access. With an open interface allowing new topologies and diverse PMem technologies, we argue for the need to examine these features individually and in combination. While one form of PMem may have been canceled, we argue that the research problems it raised not only remain relevant but have expanded in a CXL-based future.
- Open Access
- 9 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 93-101
Input and Output Coverage Needed in File System Testing
File systems need testing to discover bugs and to help ensure reliability. Many file system testing tools are evaluated based on their code coverage. We analyzed recently reported bugs in Ext4 and BtrFS and found a weak correlation between code coverage and test effectiveness: many bugs are missed because they depend on specific inputs, even though the code was covered by a test suite. Our position is that coverage of system call inputs and outputs is critically important for testing file systems. We thus suggest input and output coverage as criteria for file system testing, and show how they can improve the effectiveness of testing. We built a prototype called IOCov to evaluate the input and output coverage of file system testing tools. IOCov identified many untested cases (specific inputs and outputs or ranges thereof) for both CrashMonkey and xfstests. Additionally, we discuss a method and associated metrics to identify over- and under-testing using IOCov.
- 9 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 93-101
Open AccessInput and Output Coverage Needed in File System Testing
File systems need testing to discover bugs and to help ensure reliability. Many file system testing tools are evaluated based on their code coverage. We analyzed recently reported bugs in Ext4 and BtrFS and found a weak correlation between code coverage and test effectiveness: many bugs are missed because they depend on specific inputs, even though the code was covered by a test suite. Our position is that coverage of system call inputs and outputs is critically important for testing file systems. We thus suggest input and output coverage as criteria for file system testing, and show how they can improve the effectiveness of testing. We built a prototype called IOCov to evaluate the input and output coverage of file system testing tools. IOCov identified many untested cases (specific inputs and outputs or ranges thereof) for both CrashMonkey and xfstests. Additionally, we discuss a method and associated metrics to identify over- and under-testing using IOCov.
- Open Access
- 15 June 2015
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 43 (1) , 165-176
Newer Is Sometimes Better
The popular Network File System (NFS) protocol is 30 years old. The latest version, NFSv4, is more than ten years old but has only recently gained stability and acceptance. NFSv4 is vastly different from its predecessors: it offers a stateful server, strong security, scalability/WAN features, and callbacks, among other things. Yet NFSv4's efficacy and ability to meet its stated design goals had not been thoroughly studied until now. This paper compares NFSv4.1's performance with NFSv3 using a wide range of micro- and macro-benchmarks on a testbed configured to exercise the core protocol features. We (1) tested NFSv4's unique features, such as delegations and statefulness; (2) evaluated performance comprehensively with different numbers of threads and clients, and different network latencies and TCP/IP features; (3) found, fixed, and reported several problems in Linux's NFSv4.1 implementation, which helped improve performance by up to 11X; and (4) discovered, analyzed, and explained several counter-intuitive results. Depending on the workload, NFSv4.1 was up to 67\% slower than NFSv3 in a low-latency network, but exceeded NFSv3's performance by up to 2.9X in a high-latency environment. Moreover, NFSv4.1 outperformed NFSv3 by up to 172X when delegations were used.
- 15 June 2015
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 43 (1) , 165-176
Open AccessNewer Is Sometimes Better
The popular Network File System (NFS) protocol is 30 years old. The latest version, NFSv4, is more than ten years old but has only recently gained stability and acceptance. NFSv4 is vastly different from its predecessors: it offers a stateful server, strong security, scalability/WAN features, and callbacks, among other things. Yet NFSv4's efficacy and ability to meet its stated design goals had not been thoroughly studied until now. This paper compares NFSv4.1's performance with NFSv3 using a wide range of micro- and macro-benchmarks on a testbed configured to exercise the core protocol features. We (1) tested NFSv4's unique features, such as delegations and statefulness; (2) evaluated performance comprehensively with different numbers of threads and clients, and different network latencies and TCP/IP features; (3) found, fixed, and reported several problems in Linux's NFSv4.1 implementation, which helped improve performance by up to 11X; and (4) discovered, analyzed, and explained several counter-intuitive results. Depending on the workload, NFSv4.1 was up to 67\% slower than NFSv3 in a low-latency network, but exceeded NFSv3's performance by up to 2.9X in a high-latency environment. Moreover, NFSv4.1 outperformed NFSv3 by up to 172X when delegations were used.