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

Geetika Babu Bangera

dblp:208/0215 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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 · 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
1 paper
Storage systems · 87% Distributed systems · 13%

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

TopicWeightPapersLastEvidence papers
Storage systems
file systems
0.312017
vNFS: Maximizing NFS Performance with Compounds and Vectorized I/O · ACM Trans. Storage 2017
Storage systems › file systems › distributed file system
network file system
0.312017
vNFS: Maximizing NFS Performance with Compounds and Vectorized I/O · ACM Trans. Storage 2017
Distributed systems
remote procedure call
0.112017
vNFS: Maximizing NFS Performance with Compounds and Vectorized I/O · ACM Trans. Storage 2017

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

vectorized API · 0.3NFS compound procedures · 0.3
YearPublicationVenuePosition
2017 vNFS: Maximizing NFS Performance with Compounds and Vectorized I/O
abstract
Modern systems use networks extensively, accessing both services and storage across local and remote networks. Latency is a key performance challenge, and packing multiple small operations into fewer large ones is an effective way to amortize that cost, especially after years of significant improvement in bandwidth but not latency. To this end, the NFSv4 protocol supports a compounding feature to combine multiple operations. Yet compounding has been underused since its conception because the synchronous POSIX file-system API issues only one (small) request at a time. We propose vNFS , an NFSv4.1-compliant client that exposes a vectorized high-level API and leverages NFS compound procedures to maximize performance. We designed and implemented vNFS as a user-space RPC library that supports an assortment of bulk operations on multiple files and directories. We found it easy to modify several UNIX utilities, an HTTP/2 server, and Filebench to use vNFS. We evaluated vNFS under a wide range of workloads and network latency conditions, showing that vNFS improves performance even for low-latency networks. On high-latency networks, vNFS can improve performance by as much as two orders of magnitude.
Ming Chen 0013, Geetika Babu Bangera, Dean Hildebrand, Farhaan Jalia, Geoffrey H. Kuenning, Henry Nelson, Erez Zadok
ACM Trans. Storage2