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

Timothy E. Denehy

dblp:87/449 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 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
4 papers
Storage systems · 100%
Software engineering, system software, and programming languages
3 papers
Operating systems · 100%
Computer networks
1 paper
Transport protocols and congestion control · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › storage reliability
RAID
0.122005
Journal-guided Resynchronization for Software RAID · FAST 2005
Deconstructing storage arrays · ASPLOS 2004
Storage systems
storage reliability
0.122005
Deconstructing storage arrays · ASPLOS 2004
Journal-guided Resynchronization for Software RAID · FAST 2005
Operating systems › kernel › kernel design
kernel interfaces
0.012003
Transforming policies into mechanisms with infokernel · SOSP 2003
Operating systems › operating system design
policy-mechanism separation
0.012003
Transforming policies into mechanisms with infokernel · SOSP 2003
Transport protocols and congestion control
TCP congestion control
0.012003
Transforming policies into mechanisms with infokernel · SOSP 2003
Storage systems › storage architecture
disk systems
0.012003
Semantically-Smart Disk Systems · FAST 2003
Operating systems › i/o
i/o subsystem
0.012002
Bridging the Information Gap in Storage Protocol Stacks · USENIX ATC, General Track 2002

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

statistical techniques · 0.1controlled algorithms · 0.1semantic information extraction · 0.0
YearPublicationVenuePosition
2005 Journal-guided Resynchronization for Software RAID
Timothy E. Denehy, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
FAST1
2004 Deconstructing storage arrays
abstract
We introduce Shear, a user-level software tool that characterizes RAID storage arrays. Shear employs a set of controlled algorithms combined with statistical techniques to automatically determine the important properties of a RAID system, including the number of disks, chunk size, level of redundancy, and layout scheme. We illustrate the correctness of Shear by running it upon numerous simulated configurations, and then verify its real-world applicability by running Shear on both software-based and hardware-based RAID systems. Finally, we demonstrate the utility of Shear through three case studies. First, we show how Shear can be used in a storage management environment to verify RAID construction and detect failures. Second, we demonstrate how Shear can be used to extract detailed characteristics about the individual disks within an array. Third, we show how an operating system can use Shear to automatically tune its storage subsystems to specific RAID configurations.
Timothy E. Denehy, John Bent, Florentina I. Popovici, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
ASPLOS1
2003 Semantically-Smart Disk Systems
Muthian Sivathanu, Vijayan Prabhakaran, Florentina I. Popovici, Timothy E. Denehy, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
FAST4
2003 Transforming policies into mechanisms with infokernel
abstract
We describe an evolutionary path that allows operating systems to be used in a more flexible and appropriate manner by higher-level services. An infokernel exposes key pieces of information about its algorithms and internal state; thus, its default policies become mechanisms, which can be controlled from user-level. We have implemented two prototype infokernels based on the linuxtwofour and netbsdver kernels, called infolinux and infobsd, respectively. The infokernels export key abstractions as well as basic information primitives. Using infolinux, we have implemented four case studies showing that policies within Linux can be manipulated outside of the kernel. Specifically, we show that the default file cache replacement algorithm, file layout policy, disk scheduling algorithm, and TCP congestion control algorithm can each be turned into base mechanisms. For each case study, we have found that infokernel abstractions can be implemented with little code and that the overhead and accuracy of synthesizing policies at user-level is acceptable.
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Nathan C. Burnett, Timothy E. Denehy, Thomas J. Engle, Haryadi S. Gunawi, James A. Nugent, Florentina I. Popovici
SOSP4
2002 Bridging the Information Gap in Storage Protocol Stacks
Timothy E. Denehy, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
USENIX ATC, General Track1