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

Patrick R. Eaton

dblp:04/3224 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

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

Systems, architecture and hardware · 4Software engineering, systems software and programming languages · 2Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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
4 papers
Distributed systems · 51% Storage systems · 39% Processor architecture and microarchitecture · 11%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
distributed storage
0.122007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Pond: The OceanStore Prototype · FAST 2003
Distributed systems › fault tolerance
byzantine fault tolerance
0.112007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Distributed systems
fault tolerance
0.112007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Distributed systems › quorum systems
quorum protocols
0.112007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Distributed systems
replication
0.112007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Storage systems › networked storage
wide-area storage
0.112007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Storage systems › storage architecture
persistent storage
0.012000
OceanStore: An Architecture for Global-Scale Persistent Storage · ASPLOS 2000
Systems and software security
data integrity
0.012007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Systems and software security
secure logging
0.012007
Antiquity: exploiting a secure log for wide-area distributed storage · EuroSys 2007
Processor architecture and microarchitecture › instruction set architecture
EPIC architecture
0.011998
Integrated Predicated and Speculative Execution in the IMPACT EPIC Architecture · ISCA 1998
Processor architecture and microarchitecture › instruction-level parallelism
predicated execution
0.011998
Integrated Predicated and Speculative Execution in the IMPACT EPIC Architecture · ISCA 1998
Processor architecture and microarchitecture
speculative execution
0.011998
Integrated Predicated and Speculative Execution in the IMPACT EPIC Architecture · ISCA 1998
Storage systems
archival storage
0.012003
Pond: The OceanStore Prototype · FAST 2003
Distributed systems › distributed system security
untrusted servers
0.012000
OceanStore: An Architecture for Global-Scale Persistent Storage · ASPLOS 2000
Compilers and program optimization › instruction scheduling
instruction-level parallelism
0.011998
Integrated Predicated and Speculative Execution in the IMPACT EPIC Architecture · ISCA 1998

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

secure log · 0.1byzantine fault-tolerant quorum protocols · 0.1
YearPublicationVenuePosition
2007 Antiquity: exploiting a secure log for wide-area distributed storage
abstract
Antiquity is a wide-area distributed storage system designed to provide a simple storage service for applications like file systems and back-up. The design assumes that all servers eventually fail and attempts to maintain data despite those failures. Antiquity uses a secure log to maintain data integrity, replicates each log on multiple servers for durability, and uses dynamic Byzantine fault-tolerant quorum protocols to ensure consistency among replicas. We present Antiquity's design and an experimental evaluation with global and local testbeds. Antiquity has been running for over two months on 400+ PlanetLab servers storing nearly 20,000 logs totaling more than 84 GB of data. Despite constant server churn, all logs remain durable.
Hakim Weatherspoon, Patrick R. Eaton, Byung-Gon Chun, John Kubiatowicz
EuroSys2
2004 Improving Bandwidth Efficiency of Peer-to-Peer Storage
abstract
We broaden the applicability of peer-to-peer storage infrastructures to weakly-connected clients. We present a client-side technique that exploits the commonality between consecutive versions of a file to reduce the bandwidth required to store and retrieve files in a peer-to-peer storage infrastructure. We then present a novel data structure that allows us to use this technique in an environment where peers cannot be trusted to perform operations over unencrypted data. We have implemented the technique in the OceanStore prototype. Additionally, with simulations, we have demonstrated that the technique can reduce client-perceived latency of write and read operations by up to 80% compared to techniques used in current systems.
Patrick R. Eaton, Emil Ong, John Kubiatowicz
Peer-to-Peer Computing1
2003 Pond: The OceanStore Prototype
Sean C. Rhea, Patrick R. Eaton, Dennis Geels, Hakim Weatherspoon, Ben Y. Zhao, John Kubiatowicz
FAST2
2000 OceanStore: An Architecture for Global-Scale Persistent Storage
abstract
OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed to be cached anywhere, anytime. Additionally, monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data. A prototype implementation is currently under development.
John Kubiatowicz, David Bindel, Yan Chen 0004, Steven E. Czerwinski, Patrick R. Eaton, Dennis Geels, Ramakrishna Gummadi, Sean C. Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, Ben Y. Zhao
ASPLOS5
1998 Integrated Predicated and Speculative Execution in the IMPACT EPIC Architecture
abstract
Explicitly Parallel Instruction Computing (EPIC) architectures require the compiler to express program instruction level parallelism directly to the hardware. EPIC techniques which enable the compiler to represent control speculation, data dependence speculation, and predication have individually been shown to be very effective. However these techniques have not been studied in combination with each other. This paper presents the IMPACT EPIC Architecture to address the issues involved in designing processors based on these EPIC concepts. In particular we focus on new execution and recovery models in which microarchitectural support for predicated execution is also used to enable efficient recovery from exceptions caused by speculatively executed instructions. This paper demonstrates that a coherent framework to integrate the three techniques can be elegantly designed to achieve much better performance than each individual technique could alone provide.
David I. August, Daniel A. Connors, Scott A. Mahlke, John W. Sias, Kevin M. Crozier, Ben-Chung Cheng, Patrick R. Eaton, Qudus B. Olaniran, Wen-Mei W. Hwu
ISCA7