Demo Data from EDBT 2026 / reviewers in the wild / expert
Howard Gobioff
dblp:g/HGobioff
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3Systems, architecture and hardware · 2
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 · 85% Distributed systems · 15% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › file systems
distributed file system |
0.1 | 3 | 2003 | The Google file system · SOSP 2003 A Cost-Effective, High-Bandwidth Storage Architecture · ASPLOS 1998 File Server Scaling with Network-Attached Secure Disks · SIGMETRICS 1997 |
Distributed systems
fault tolerance |
0.0 | 1 | 2003 | The Google file system · SOSP 2003 |
Storage systems › data redundancy
replicated storage |
0.0 | 1 | 2003 | The Google file system · SOSP 2003 |
Storage systems › network-attached storage
network-attached secure disk |
0.0 | 2 | 1998 | A Cost-Effective, High-Bandwidth Storage Architecture · ASPLOS 1998 File Server Scaling with Network-Attached Secure Disks · SIGMETRICS 1997 |
Storage systems
network-attached storage |
0.0 | 2 | 1998 | A Cost-Effective, High-Bandwidth Storage Architecture · ASPLOS 1998 File Server Scaling with Network-Attached Secure Disks · SIGMETRICS 1997 |
Storage systems › file systems › distributed file system
file server scaling |
0.0 | 1 | 1997 | File Server Scaling with Network-Attached Secure Disks · SIGMETRICS 1997 |
Storage systems › distributed storage
storage cluster |
0.0 | 1 | 2003 | The Google file system · SOSP 2003 |
Methods — techniques the papers use, named apart from their topics
replication · 0.0fault tolerance · 0.0direct client transfer · 0.0cryptographic secure interface · 0.0trace-driven replay · 0.0analytic modeling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | The Google file systemabstractarticle Share on The Google file system Authors: Sanjay Ghemawat Google GoogleView Profile , Howard Gobioff Google GoogleView Profile , Shun-Tak Leung Google GoogleView Profile Authors Info & Claims ACM SIGOPS Operating Systems ReviewVolume 37Issue 5December 2003 pp 29–43https://doi.org/10.1145/1165389.945450Online:19 October 2003Publication History 2,957citation60,150DownloadsMetricsTotal Citations2,957Total Downloads60,150Last 12 Months3,038Last 6 weeks280 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Sanjay Ghemawat, Howard Gobioff, Shun-Tak Leung |
SOSP | 2 |
| 1998 | A Cost-Effective, High-Bandwidth Storage ArchitectureabstractThis paper describes the Network-Attached Secure Disk (NASD) storage architecture, prototype implementations oj NASD drives, array management for our architecture, and three, filesystems built on our prototype. NASD provides scalable storage bandwidth without the cost of servers used primarily, for transferring data from peripheral networks (e.g. SCSI) to client networks (e.g. ethernet). Increasing datuset sizes, new attachment technologies, the convergence of peripheral and interprocessor switched networks, and the increased availability of on-drive transistors motivate and enable this new architecture. NASD is based on four main principles: direct transfer to clients, secure interfaces via cryptographic support, asynchronous non-critical-path oversight, and variably-sized data objects. Measurements of our prototype system show that these services can be cost-effectively integrated into a next generation disk drive ASK. End-to-end measurements of our prototype drive andfilesysterns suggest that NASD cun support conventional distributed filesystems without performance degradation. More importantly, we show scaluble bandwidth for NASD-specialized filesystems. Using a parallel data mining application, NASD drives deliver u linear scaling of 6.2 MB/s per clientdrive pair, tested with up to eight pairs in our lab. Garth A. Gibson, David Nagle, Khalil Amiri, Jeff Butler, Fay W. Chang, Howard Gobioff, Charles Hardin, Erik Riedel, David Rochberg, Jim Zelenka |
ASPLOS | 6 |
| 1997 | File Server Scaling with Network-Attached Secure DisksabstractBy providing direct data transfer between storage and client, network-attached storage devices have the potential to improve scalability for existing distributed file systems (by removing the server as a bottleneck) and bandwidth for new parallel and distributed file systems (through network striping and more efficient data paths). Together, these advantages influence a large enough fraction of the storage market to make commodity network-attached storage feasible. Realizing the technology's full potential requires careful consideration across a wide range of file system, networking and security issues. This paper contrasts two network-attached storage architectures---(1) Networked SCSI disks (NetSCSI) are network-attached storage devices with minimal changes from the familiar SCSI interface, while (2) Network-Attached Secure Disks (NASD) are drives that support independent client access to drive object services. To estimate the potential performance benefits of these architectures, we develop an analytic model and perform trace-driven replay experiments based on AFS and NFS traces. Our results suggest that NetSCSI can reduce file server load during a burst of NFS or AFS activity by about 30%. With the NASD architecture, server load (during burst activity) can be reduced by a factor of up to five for AFS and up to ten for NFS. Garth A. Gibson, David Nagle, Khalil Amiri, Fay W. Chang, Eugene M. Feinberg, Howard Gobioff, Chen Lee, Berend Ozceri, Erik Riedel, David Rochberg, Jim Zelenka |
SIGMETRICS | 6 |