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

Darrell C. Anderson

dblp:47/721 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2002
—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 · 3 · 1 first-authorComputer networks · 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
6 papers
Storage systems · 46% Cloud and datacenter computing · 32% Memory systems · 10%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
network-attached storage
0.122002
Interposed request routing for scalable network storage · ACM Trans. Comput. Syst. 2002
Failure-Atomic File Access in an Interposed Network Storage System · HPDC 2000
Cloud and datacenter computing › datacenter services › online service systems
request routing
0.122002
Interposed request routing for scalable network storage · ACM Trans. Comput. Syst. 2002
Interposed Request Routing for Scalable Network Storage · OSDI 2000
Storage systems
networked storage
0.022000
Interposed Request Routing for Scalable Network Storage · OSDI 2000
Cheating the I/O Bottleneck: Network Storage with Trapeze/Myrinet · USENIX ATC 1998
Storage systems › file systems
distributed file system
0.012002
Interposed request routing for scalable network storage · ACM Trans. Comput. Syst. 2002
Storage systems
scalable storage
0.012002
Interposed request routing for scalable network storage · ACM Trans. Comput. Syst. 2002
Cloud and datacenter computing › resource management
datacenter resource management
0.012001
Managing Energy and Server Resources in Hosting Centres · SOSP 2001
Cloud and datacenter computing › resource allocation
economic resource allocation
0.012001
Managing Energy and Server Resources in Hosting Centres · SOSP 2001
Cloud and datacenter computing
resource management
0.012001
Managing Energy and Server Resources in Hosting Centres · SOSP 2001
Energy-efficient computing › datacenter energy efficiency
server cluster power management
0.012001
Managing Energy and Server Resources in Hosting Centres · SOSP 2001
Internet architecture and protocols › network interconnection
bridging
0.012000
SmartBridge: A scalable bridge architecture · SIGCOMM 2000
Storage systems
storage reliability
0.012000
Failure-Atomic File Access in an Interposed Network Storage System · HPDC 2000
Memory systems › virtual memory management
page prefetching
0.011999
Potentials and Limitations of Fault-Based Markov Prefetching for Virtual Memory Pages · SIGMETRICS 1999
Memory systems › memory management
virtual memory
0.011999
Potentials and Limitations of Fault-Based Markov Prefetching for Virtual Memory Pages · SIGMETRICS 1999
Storage systems › file systems › distributed file system
network file system
0.012000
Failure-Atomic File Access in an Interposed Network Storage System · HPDC 2000
Interconnection networks and networks-on-chip › cluster interconnect
myrinet
0.011998
Cheating the I/O Bottleneck: Network Storage with Trapeze/Myrinet · USENIX ATC 1998
Storage systems › i/o architecture
remote i/o
0.011998
Cheating the I/O Bottleneck: Network Storage with Trapeze/Myrinet · USENIX ATC 1998

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

request switching · 0.0packet filtering · 0.0greedy resource allocation · 0.0SLA-based degradation · 0.0request switching filter · 0.0mirrored striping · 0.0markov modeling · 0.0
YearPublicationVenuePosition
2002 Interposed request routing for scalable network storage
abstract
This paper explores interposed request routing in Slice, a new storage system architecture for high-speed networks incorporating network-attached block storage. Slice interposes a request switching filter---called a μproxy---along each client's network path to the storage service (e.g., in a network adapter or switch). The μproxy intercepts request traffic and distributes it across a server ensemble. We propose request routing schemes for I/O and file service traffic, and explore their effect on service structure. The Slice prototype uses a packet filter μproxy to virtualize the standard Network File System (NFS) protocol, presenting to NFS clients a unified shared file volume with scalable bandwidth and capacity. Experimental results from the industry-standard SPECsfs97 workload demonstrate that the architecture enables construction of powerful network-attached storage services by aggregating cost-effective components on a switched Gigabit Ethernet LAN.
Darrell C. Anderson, Jeffrey S. Chase, Amin Vahdat
ACM Trans. Comput. Syst.1
2001 Managing Energy and Server Resources in Hosting Centres
abstract
Internet hosting centers serve multiple service sites from a common hardware base. This paper presents the design and implementation of an architecture for resource management in a hosting center operating system, with an emphasis on energy as a driving resource management issue for large server clusters. The goals are to provision server resources for co-hosted services in a way that automatically adapts to offered load, improve the energy efficiency of server clusters by dynamically resizing the active server set, and respond to power supply disruptions or thermal events by degrading service in accordance with negotiated Service Level Agreements (SLAs).Our system is based on an economic approach to managing shared server resources, in which services "bid" for resources as a function of delivered performance. The system continuously monitors load and plans resource allotments by estimating the value of their effects on service performance. A greedy resource allocation algorithm adjusts resource prices to balance supply and demand, allocating resources to their most efficient use. A reconfigurable server switching infrastructure directs request traffic to the servers assigned to each service. Experimental results from a prototype confirm that the system adapts to offered load and resource availability, and can reduce server energy usage by 29% or more for a typical Web workload.
Jeffrey S. Chase, Darrell C. Anderson, Prachi N. Thakar, Amin Vahdat, Ronald P. Doyle
SOSP2
2000 Failure-Atomic File Access in an Interposed Network Storage System
abstract
Presents a recovery protocol for block I/O operations in Slice, a storage system architecture for high-speed LANs incorporating network-attached block storage. The goal of the Slice architecture is to provide a network file service with scalable bandwidth and capacity while preserving compatibility with off-the-shelf clients and file server appliances. The Slice prototype "virtualizes" the Network File System (NFS) protocol by interposing a request switching filter at the client's interface to the network storage system (e.g. in a network adapter or switch). The distributed Slice architecture separates functions that are typically combined in central file servers, introducing new challenges for failure atomicity. This paper presents a protocol for atomic file operations and recovery in the Slice architecture, and related support for reliable file storage using mirrored striping. Experimental results from the Slice prototype show that the protocol has low cost in the common case, allowing the system to deliver client file access bandwidths approaching Gbit/s network speeds.
Darrell C. Anderson, Jeffrey S. Chase
HPDC1
2000 Interposed Request Routing for Scalable Network Storage
Darrell C. Anderson, Jeffrey S. Chase, Amin Vahdat
OSDI1
2000 SmartBridge: A scalable bridge architecture
abstract
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs becomes an issue. Two common solutions to the forwarding problem are IP routing and spanning tree bridging. IP routing scales well, but imposes the administrative burden of managing subnets and assigning addresses. Spanning tree bridging, in contrast, requires no administration, but often does not perform well in a large network, because too much traffic must detour toward the root of the spanning tree, wasting link bandwidth.
Thomas L. Rodeheffer, Chandramohan A. Thekkath, Darrell C. Anderson
SIGCOMM3
1999 Potentials and Limitations of Fault-Based Markov Prefetching for Virtual Memory Pages
abstract
No abstract available.
Gretta Bartels, Anna R. Karlin, Darrell C. Anderson, Jeffrey S. Chase, Henry M. Levy, Geoffrey M. Voelker
SIGMETRICS3
1998 Cheating the I/O Bottleneck: Network Storage with Trapeze/Myrinet
Darrell C. Anderson, Jeffrey S. Chase, Syam Gadde, Andrew J. Gallatin, Ken Yocum, Michael J. Feeley
USENIX ATC1