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

David Oppenheimer

dblp:04/2670 · also David L. Oppenheimer · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 6 · 3 first-authorComputer networks · 1Security and privacy · 1Software engineering, systems software and programming languages · 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
5 papers
Cloud and datacenter computing · 75% Distributed systems · 25%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.222015
Large-scale cluster management at Google with Borg · EuroSys 2015
Design and implementation tradeoffs for wide-area resource discovery · HPDC 2005
Cloud and datacenter computing
cluster resource management and scheduling
0.212015
Large-scale cluster management at Google with Borg · EuroSys 2015
Cloud and datacenter computing › cloud service management
service placement
0.122006
Service Placement in a Shared Wide-Area Platform · USENIX ATC, General Track 2006
Service placement in shared wide-area platforms · SOSP 2005
Cloud and datacenter computing
wide-area platform
0.122006
Service Placement in a Shared Wide-Area Platform · USENIX ATC, General Track 2006
Service placement in shared wide-area platforms · SOSP 2005
Distributed systems
distributed coordination
0.112015
Large-scale cluster management at Google with Borg · EuroSys 2015
Cloud and datacenter computing
resource management
0.112006
Service Placement in a Shared Wide-Area Platform · USENIX ATC, General Track 2006
Distributed systems › distributed resource management
resource discovery
0.112005
Design and implementation tradeoffs for wide-area resource discovery · HPDC 2005
Distributed systems › fault tolerance
fault detection and recovery
0.012002
ROC-1: Hardware Support for Recovery-Oriented Computing · IEEE Trans. Computers 2002
Distributed systems › fault tolerance
high availability
0.012002
ROC-1: Hardware Support for Recovery-Oriented Computing · IEEE Trans. Computers 2002
Distributed systems › fault tolerance
recovery-oriented computing
0.012002
ROC-1: Hardware Support for Recovery-Oriented Computing · IEEE Trans. Computers 2002
Distributed systems › distributed system architecture
wide-area distributed systems
0.012006
Service Placement in a Shared Wide-Area Platform · USENIX ATC, General Track 2006
Cloud and datacenter computing
resource allocation
0.012005
Service placement in shared wide-area platforms · SOSP 2005
Cloud and datacenter computing › datacenter services › online service systems
internet services
0.012002
ROC-1: Hardware Support for Recovery-Oriented Computing · IEEE Trans. Computers 2002

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

job scheduling · 0.2utility-based ranking · 0.1emulation · 0.1redundancy and isolation · 0.0problem diagnosis · 0.0online self-testing · 0.0
YearPublicationVenuePosition
2015 Large-scale cluster management at Google with Borg
abstract
Google's Borg system is a cluster manager that runs hundreds of thousands of jobs, from many thousands of different applications, across a number of clusters each with up to tens of thousands of machines.
Luis Pedrosa, Madhukar Korupolu, David Oppenheimer, Eric Tune, John Wilkes
EuroSys4
2008 Design and implementation trade-offs for wide-area resource discovery
abstract
We describe the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems. In contrast to previous systems, SWORD allows users to describe desired resources as a topology of interconnected groups with required intragroup, intergroup, and per-node characteristics, along with the utility that the application derives from specified ranges of metric values. This design gives users the flexibility to find geographically distributed resources for applications that are sensitive to both node and network characteristics, and allows the system to rank acceptable configurations based on their quality for that application. Rather than evaluating a single implementation of SWORD, we explore a variety of architectural designs that deliver the required functionality in a scalable and highly available manner. We discuss the trade-offs of using a centralized architecture as compared to a fully decentralized design to perform wide-area resource discovery. To summarize our results, we found that a centralized architecture based on 4-node server cluster sites at network-peering facilities outperforms a decentralized DHT-based resource discovery infrastructure with respect to query latency for all but the smallest number of sites. However, although a centralized architecture shows significant promise in stable environments, we find that our decentralized implementation has acceptable performance and also benefits from the DHT's self-healing properties in more volatile environments. We evaluate the advantages and disadvantages of centralized and distributed resource discovery architectures on 1000 hosts in emulation and on approximately 200 PlanetLab nodes spread across the Internet.
Jeannie R. Albrecht, David Oppenheimer, Amin Vahdat, David A. Patterson 0001
ACM Trans. Internet Techn.2
2006 Service Placement in a Shared Wide-Area Platform
David Oppenheimer, Brent N. Chun, David A. Patterson 0001, Alex C. Snoeren, Amin Vahdat
USENIX ATC, General Track1
2005 Workshop on Hot Topics in System Depend - Workshop Abstract
George Candea, David Oppenheimer
DSN2
2005 Design and implementation tradeoffs for wide-area resource discovery
abstract
This paper describes the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems. In contrast to previous systems, SWORD allows users to describe desired resources as a topology of interconnected groups with required intragroup, intergroup, and per-node characteristics, along with the utility that the application derives from various ranges of values of those characteristics. This design gives users the flexibility to find geographically distributed resources for applications that are sensitive to both node and network characteristics, and allows the system to rank acceptable configurations based on their quality for that application. We explore a variety of architectures to deliver SWORD's functionality in a scalable and highly-available manner. A 1000-node ModelNet evaluation using a workload of measurements collected from PlanetLab shows that an architecture based on 4-node server cluster sites at network peering facilities outperforms a decentralized DHT-based resource discovery infrastructure for all but the smallest number of sites. While such a centralized architecture shows significant promise, we find that our decentralized implementation, both in emulation and running continuously on over 200 PlanetLab nodes, performs well while benefiting from the DHT's self-healing properties.
David Oppenheimer, Jeannie R. Albrecht, David A. Patterson 0001, Amin Vahdat
HPDC1
2005 Service placement in shared wide-area platforms
abstract
Federated geographically-distributed computing platforms such as PlanetLab [1] and the Grid [2, 3] have recently become popular for evaluating and deploying network services and scientific computations. As the size, reach, and user population of such infrastructures grow, resource discovery and resource selection become increasingly important. Although a number of resource discovery and allocation services have been built, there is little data on the utilization of the distributed computing platforms they target. Yet the design and efficacy of such services depends on the characteristics of the target platform.
David Oppenheimer, Brent N. Chun, David A. Patterson 0001, Alex C. Snoeren, Amin Vahdat
SOSP1
2002 ROC-1: Hardware Support for Recovery-Oriented Computing
abstract
We introduce the ROC-1 hardware platform, a large-scale cluster system designed to provide high availability for Internet service applications. The ROC-1 prototype embodies our philosophy of recovery-oriented computing (ROC) by emphasizing detection and recovery from the failures that inevitably occur in Internet service environments, rather than simple avoidance of such failures. ROC-1 promises greater availability than existing server systems by incorporating four techniques applied from the ground up to both hardware and software: redundancy and isolation, online self-testing and verification, support for problem diagnosis and concern for human interaction with the system.
David Oppenheimer, Aaron B. Brown, James Beck, Daniel Hettena, Jon Kuroda, Noah Treuhaft, David A. Patterson 0001, Katherine A. Yelick
IEEE Trans. Computers1
1999 Shared virtual memory with automatic update support
abstract
Shared virtual memory systems provide the abstraction of a shared address space on top of a messagepassing communication architecture. The overall performance of an SVM system therefore depends on both the raw performance of the underlying communication mechanism and the e#ciency with which the SVM protocol uses that mechanism. The Automatic Update Release Consistency (AURC) protocol was proposed to take advantage of simple memory-mapped communication and automatic update support to accelerate a shared virtual memory protocol. However, there has not yet been a real system on which an implementation of this protocol could be evaluated. This paper reports our evaluation of AURC on the SHRIMP multicomputer, the only hardware platform that supports an automatic update mechanism. Automatic update propagates local memory writes to remote memory locations automatically. We compare the AURC protocol with its all-software counterpart protocol, Home-based Lazy Release Consistency (HLRC). By int...
Liviu Iftode, Matthias A. Blumrich, Cezary Dubnicki, David Oppenheimer, Jaswinder Pal Singh, Kai Li 0001
International Conference on Supercomputing4