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 Bisson

dblp:94/6748 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2012
—ORCID · none

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

Systems, architecture and hardware · 5 · 3 first-authorDatabases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 2Computer networks · 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
4 papers
Storage systems · 67% Embedded and real-time systems · 33%
Software engineering, system software, and programming languages
2 papers
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › data reduction
data deduplication
0.112012
iDedup: latency-aware, inline data deduplication for primary storage · FAST 2012
Storage systems › data reduction › data deduplication
inline deduplication
0.112012
iDedup: latency-aware, inline data deduplication for primary storage · FAST 2012
Embedded and real-time systems
real-time scheduling
0.122004
Integrating Best-Effort Scheduling into a Real-Time System · RTSS 2004
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes · RTSS 2003
Operating systems › resource management › process management
CPU scheduling
0.122004
Integrating Best-Effort Scheduling into a Real-Time System · RTSS 2004
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes · RTSS 2003
Embedded and real-time systems › real-time scheduling › aperiodic task scheduling
aperiodic server
0.012004
Integrating Best-Effort Scheduling into a Real-Time System · RTSS 2004
Embedded and real-time systems › real-time scheduling
soft real-time scheduling
0.012003
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes · RTSS 2003
Embedded and real-time systems › real-time scheduling
best-effort scheduling
0.012004
Integrating Best-Effort Scheduling into a Real-Time System · RTSS 2004
Embedded and real-time systems
real-time operating systems
0.012004
Integrating Best-Effort Scheduling into a Real-Time System · RTSS 2004

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

runtime period adaptation · 0.1bandwidth server scheduling · 0.1schedulability analysis · 0.1correctness proof · 0.1
YearPublicationVenuePosition
2012 iDedup: latency-aware, inline data deduplication for primary storage
Kiran Srinivasan, Timothy Bisson, Garth R. Goodson, Kaladhar Voruganti
FAST2
2009 Spyglass: Fast, Scalable Metadata Search for Large-Scale Storage Systems
Andrew W. Leung, Minglong Shao, Timothy Bisson, Shankar Pasupathy, Ethan L. Miller
FAST3
2007 A Hybrid Disk-Aware Spin-Down Algorithm with I/O Subsystem Support
abstract
To offset the significant power demands of hard disk drives in computer systems, drives are typically powered down during idle periods. This saves power, but accelerates duty cycle consumption, leading to earlier drive failure. Hybrid disks with a small amount of non-volatile flash memory (NVCache) are coming on the market. We present four I/O subsystem enhancements that exploit the characteristics of hybrid disks to improve system performance: 1) artificial idle periods, 2) a read-miss cache, 3) anticipatory spin-up, and 4) NVCache write-throttling. These enhancements reduce power consumption, duty cycling, NVCache block-erase impact, and the observed spinup latency of a hybrid disk, resulting in lower power consumption, greater reliability, and faster I/O.
Timothy Bisson, Scott A. Brandt, Darrell D. E. Long
IPCCC1
2007 Reducing Hybrid Disk Write Latency with Flash-Backed I/O Requests
abstract
One of the biggest bottlenecks in desktop-based computing is the hard disk with I/O write latency being a key contributor. I/O write latency stems from the mechanical nature of hard disks, with seek and rotational delays the major components. Hybrid disk drives place a small amount of flash memory (NVCache) on the drive itself which can be leveraged by the host and has the potential to increase I/O performance and reduce hard disk power consumption. We present an I/O scheduling algorithm, "Flash-Backed I/O Requests", which leverages the on-board flash to reduce write latency. Since flash memory and rotating media have different I/O characteristics, predominantly in random access context, an I/O scheduler can decide which media will most efficiently service I/O requests. Our results show that with Flash-Backed I/O requests, overall write latency can be reduced by up to 70%.
Timothy Bisson, Scott A. Brandt
MASCOTS1
2007 Flushing Policies for NVCache Enabled Hard Disks
Timothy Bisson, Scott A. Brandt
MSST1
2006 NVCache: Increasing the Effectiveness of Disk Spin-Down Algorithms with Caching
abstract
Being one of the few mechanical components in a typical computer system, hard drives consume a significant amount of the overall power used by a computer. Spinning down a hard drive reduces its power consumption, but only works when no disk accesses occur, limiting overall effectiveness. We have designed and implemented a technique to extend disk spin-down times using a small non-volatile storage cache called NVCache, which contains a combination of caching techniques to service reads and writes while the hard disk is in low-power mode. We show that combining NVCache with an adaptive disk spin-down algorithm, a hard disk’s power consumption can be reduced by up to 90%.
Timothy Bisson, Scott A. Brandt, Darrell D. E. Long
MASCOTS1
2004 Integrating Best-Effort Scheduling into a Real-Time System
abstract
Demand for real-time capability in general-purpose systems is rising and as systems are retrofitted with scheduling features they become increasingly complex. To counter this trend we present the best-effort bandwidth server (BEBS), an aperiodic server for flexible and efficient support of best-effort applications in a real-time system. Recognizing that the responsiveness of a server depends on its period, and that not every best-effort task requires equal responsiveness, the algorithm adjusts its period based on run-time behavior of tasks. We created a prototype implementation of the system to demonstrate that it performs suitably as a general-purpose scheduler in comparison to Linux, and outperforms a common type of hierarchy used in existing general-purpose systems. The result is a system that integrates real-time scheduling with best-effort support, both simple and powerful enough to be used as the only scheduler in a general-purpose operating system.
Scott A. Banachowski, Timothy Bisson, Scott A. Brandt
RTSS2
2003 Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes
abstract
Real-time systems are growing in complexity and real-time and soft real-time applications are becoming common in general-purpose computing environments. Thus, there is a growing need for scheduling solutions that simultaneously support processes with a variety of different timeliness constraints. Toward this goal we have developed the resource allocation/dispatching (RAD) integrated scheduling model and the rate-based earliest deadline (RBED) integrated multi-class real-time scheduler based on this model. We present RAD and the RBED scheduler and formally prove the correctness of the operations that RBED employs. We then describe our implementation of RBED and present results demonstrating how RBED simultaneously and seamlessly supports hard real-time, soft real-time, and best-effort processes.
Scott A. Brandt, Scott A. Banachowski, Caixue Lin, Timothy Bisson
RTSS4