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

Mark W. Storer

dblp:80/6516 · DBLP profile ↗
← Back
9ranked-venue papers
3as 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 · 9 · 3 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
6 papers
Storage systems · 82% Performance modeling and evaluation · 14% Memory systems · 4%
Network and information security
2 papers
Cryptographic protocols and secure computation · 50% Cryptographic primitives and cryptanalysis · 28% Systems and software security · 22%

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

TopicWeightPapersLastEvidence papers
Storage systems
archival storage
0.542012
Analysis of Workload Behavior in Scientific and Historical Long-Term Data Repositories · ACM Trans. Storage 2012
Usage behavior of a large-scale scientific archive · SC 2012
POTSHARDS - a secure, recoverable, long-term archival storage system · ACM Trans. Storage 2009
Storage systems
storage reliability
0.222012
Usage behavior of a large-scale scientific archive · SC 2012
POTSHARDS - a secure, recoverable, long-term archival storage system · ACM Trans. Storage 2009
Performance modeling and evaluation
workload characterization
0.222012
Analysis of Workload Behavior in Scientific and Historical Long-Term Data Repositories · ACM Trans. Storage 2012
Usage behavior of a large-scale scientific archive · SC 2012
Storage systems
long-term storage
0.112007
POTSHARDS: Secure Long-Term Storage Without Encryption · USENIX ATC 2007
Storage systems
secure storage
0.112007
POTSHARDS: Secure Long-Term Storage Without Encryption · USENIX ATC 2007
Cryptographic protocols and secure computation
secret sharing
0.122009
POTSHARDS - a secure, recoverable, long-term archival storage system · ACM Trans. Storage 2009
POTSHARDS: Secure Long-Term Storage Without Encryption · USENIX ATC 2007
Memory systems
cache
0.012013
Warming up storage-level caches with bonfire · FAST 2013
Storage systems › data management
scientific data storage
0.012012
Analysis of Workload Behavior in Scientific and Historical Long-Term Data Repositories · ACM Trans. Storage 2012
Cryptographic primitives and cryptanalysis
information-theoretic security
0.012009
POTSHARDS - a secure, recoverable, long-term archival storage system · ACM Trans. Storage 2009
Storage systems
energy-efficient storage
0.012008
Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage · FAST 2008
Systems and software security
secure storage
0.012007
POTSHARDS: Secure Long-Term Storage Without Encryption · USENIX ATC 2007

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

secret splitting · 0.2distributed RAID · 0.2approximate pointers · 0.2workload tracing · 0.1workload characterization · 0.1trace analysis · 0.1
YearPublicationVenuePosition
2015 Storage Efficiency Opportunities and Analysis for Video Repositories
Suganthi Dewakar, Sethuraman Subbiah, Gokul Soundararajan, Mark W. Storer, Kishore Kasi Udayashankar, Kaladhar Voruganti, Minglong Shao
HotStorage5
2013 Warming up storage-level caches with bonfire
Yiying Zhang 0005, Gokul Soundararajan, Mark W. Storer, Lakshmi N. Bairavasundaram, Sethuraman Subbiah, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
FAST3
2013 Validating Storage System Instrumentation
abstract
There is a large body of work-such as system administration and intrusion detection-that relies upon storage system logs and snapshots. These solutions rely on accurate system records, however, little effort has been made to verify the correctness of logging instrumentation and log reliability. We present a solution, called ExDiff, that uses expectation differencing to validate storage system logs. Our solution can identify development errors such as the omission of a logging point and runtime errors such as log crashes. ExDiff uses metadata snapshots and activity logs to predict the expected state of the system and compares that with the system's actual state. Mismatches between the expected and actual metadata states can then be used to highlight gaps in log coverage, as well as aid in identifying specific types of missing entries. We show that ExDiff provides valuable insight to system designers, administrators and researchers by accurately identifying gaps in log coverage, providing clues useful in isolating specific types of missing log entries, and highlighting potential misunderstandings in logged action.
Ian F. Adams, Mark W. Storer, Avani Wildani, Ethan L. Miller, Brian A. Madden
MASCOTS2
2012 Usage behavior of a large-scale scientific archive
abstract
Archival storage systems for scientific data have been growing in both size and relevance over the past two decades, yet researchers and system designers alike must rely on limited and obsolete knowledge to guide archival management and design. To address this issue, we analyzed three years of filelevel activities from the NCAR mass storage system, providing valuable insight into a large-scale scientific archive with over 1600 users, tens of millions of files, and petabytes of data. Our examination of system usage showed that, while a subset of users were responsible for most of the activity, this activity was widely distributed at the file level. We also show that the physical grouping of files and directories on media can improve archival storage system performance. Based on our observations, we provide suggestions and guidance for both future scientific archival system designs as well as improved tracing of archival activity.
Ian F. Adams, Brian A. Madden, Joel Cameron Frank, Mark W. Storer, Ethan L. Miller, Gene Harano
SC4
2012 Analysis of Workload Behavior in Scientific and Historical Long-Term Data Repositories
abstract
The scope of archival systems is expanding beyond cheap tertiary storage: scientific and medical data is increasingly digital, and the public has a growing desire to digitally record their personal histories. Driven by the increase in cost efficiency of hard drives, and the rise of the Internet, content archives have become a means of providing the public with fast, cheap access to long-term data. Unfortunately, designers of purpose-built archival systems are either forced to rely on workload behavior obtained from a narrow, anachronistic view of archives as simply cheap tertiary storage, or extrapolate from marginally related enterprise workload data and traditional library access patterns. To close this knowledge gap and provide relevant input for the design of effective long-term data storage systems, we studied the workload behavior of several systems within this expanded archival storage space. Our study examined several scientific and historical archives, covering a mixture of purposes, media types, and access models---that is, public versus private. Our findings show that, for more traditional private scientific archival storage, files have become larger, but update rates have remained largely unchanged. However, in the public content archives we observed, we saw behavior that diverges from the traditional “write-once, read-maybe” behavior of tertiary storage. Our study shows that the majority of such data is modified---sometimes unnecessarily---relatively frequently, and that indexing services such as Google and internal data management processes may routinely access large portions of an archive, accounting for most of the accesses. Based on these observations, we identify areas for improving the efficiency and performance of archival storage systems.
Ian F. Adams, Mark W. Storer, Ethan L. Miller
ACM Trans. Storage2
2010 Examining Energy Use in Heterogeneous Archival Storage Systems
abstract
Controlling energy usage in data centers, and storage in particular, continues to rise in importance. Many systems and models have examined energy efficiency through intelligent spin-down of disks and novel data layouts, yet little work has been done to examine how power usage over the course of months to years is impacted by the characteristics of the storage devices chosen for use. Long-term power usage is particularly important for archival storage systems, since it is a large contributor to overall system cost. In this work, we begin exploring the impact that broad policies (e.g. utilize high-bandwidth devices first) have upon the power efficiency of a disk based archival storage system of heterogeneous devices over the course of a year. Using a discrete event simulator, we found that even simple heuristic policies for allocating space can have significant impact on the power usage of a system. We show that our system growth policies can cause power usage to vary from 10% higher to 18% lower than a naive random data allocation scheme. We also found that under low read rates power is dominated by that used in standby modes. Most interestingly, we found cases where concentrating data on fewer devices yielded increased power usage.
Ian F. Adams, Ethan L. Miller, Mark W. Storer
MASCOTS3
2009 POTSHARDS - a secure, recoverable, long-term archival storage system
abstract
Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public's desire to digitally record their personal histories. Unfortunately, many of the security mechanisms that modern systems rely upon, such as encryption, are poorly suited for storing data for indefinitely long periods of time; it is very difficult to manage keys and update cryptosystems to provide secrecy through encryption over periods of decades. Worse, an adversary who can compromise an archive need only wait for cryptanalysis techniques to catch up to the encryption algorithm used at the time of the compromise in order to obtain “secure” data. To address these concerns, we have developed POTSHARDS, an archival storage system that provides long-term security for data with very long lifetimes without using encryption. Secrecy is achieved by using unconditionally secure secret splitting and spreading the resulting shares across separately managed archives. Providing availability and data recovery in such a system can be difficult; thus, we use a new technique, approximate pointers, in conjunction with secure distributed RAID techniques to provide availability and reliability across independent archives. To validate our design, we developed a prototype POTSHARDS implementation. In addition to providing us with an experimental testbed, this prototype helped us to understand the design issues that must be addressed in order to maximize security.
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller, Kaladhar Voruganti
ACM Trans. Storage1
2008 Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller, Kaladhar Voruganti
FAST1
2007 POTSHARDS: Secure Long-Term Storage Without Encryption
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller, Kaladhar Voruganti
USENIX ATC1