Michael P. Mesnier

dblp:m/MichaelPMesnier · DBLP profile ↗
← Back
13ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · none

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

Systems, architecture and hardware · 9 · 2 first-author · 1 since 2021Software engineering, systems software and programming languages · 3 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-authorTheory of computation · 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
Performance modeling and evaluation · 38% Storage systems · 38% Cloud and datacenter computing · 21%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
workload characterization
0.432017
Understanding I/O Performance Behaviors of Cloud Storage from a Client's Perspective · ACM Trans. Storage 2017
Modeling the relative fitness of storage · SIGMETRICS 2007
//TRACE: Parallel Trace Replay with Approximate Causal Events · FAST 2007
Cloud and datacenter computing
cloud storage
0.312017
Understanding I/O Performance Behaviors of Cloud Storage from a Client's Perspective · ACM Trans. Storage 2017
Indexing and storage engines
storage management
0.112012
hStorage-DB: Heterogeneity-aware Data Management to Exploit the Full Capability of Hybrid Storage Systems · Proc. VLDB Endow. 2012
Storage systems
data placement
0.112012
hStorage-DB: Heterogeneity-aware Data Management to Exploit the Full Capability of Hybrid Storage Systems · Proc. VLDB Endow. 2012
Storage systems › storage hierarchy
hybrid storage
0.112012
hStorage-DB: Heterogeneity-aware Data Management to Exploit the Full Capability of Hybrid Storage Systems · Proc. VLDB Endow. 2012
Performance modeling and evaluation
storage performance modeling
0.112007
Modeling the relative fitness of storage · SIGMETRICS 2007
Performance modeling and evaluation › simulation
trace replay
0.112007
//TRACE: Parallel Trace Replay with Approximate Causal Events · FAST 2007
Storage systems
distributed storage
0.112005
Ursa Minor: Versatile Cluster-based Storage · FAST 2005
Storage systems › distributed storage
storage cluster
0.112005
Ursa Minor: Versatile Cluster-based Storage · FAST 2005
Memory systems
cache
0.012012
hStorage-DB: Heterogeneity-aware Data Management to Exploit the Full Capability of Hybrid Storage Systems · Proc. VLDB Endow. 2012
Operating systems › i/o
i/o subsystem
0.012011
Differentiated storage services · SOSP 2011

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

qos policy assignment · 0.3i/o request classification · 0.3sampling and inference · 0.3measurement · 0.3policy enforcement · 0.2i/o classification · 0.2causal events · 0.1black-box modeling · 0.1versatility · 0.1
YearPublicationVenuePosition
2023 ISVABI: In-Storage Video Analytics Engine with Block Interface
abstract
The wide use of cameras in the past decade has increased the need to process video data significantly. Due to the large volume of video data, analyzing videos to extract useful information has become a critical challenge. Several prior works have tried to accelerate video analytics workloads by offloading some operations to embedded processors within storage devices.
Joshua Fixelle, Pingyi Huo, Mircea R. Stan, Michael P. Mesnier, Narayanan Vijaykrishnan
LCTES5
2021 Enabling near-data processing in distributed object storage systems
abstract
Most general-purpose distributed storage systems are not designed with near data processing (NDP) in mind. They do not respect semantic data boundaries when writing data, for example splitting a record across servers. This reduces NDP effectiveness by requiring data collation before computation. While semantic data awareness and NDP functions can be retroactively added to existing distributed storage, it is often complex and difficult to accomplish in practice.
Ian F. Adams, Neha Agrawal, Michael P. Mesnier
HotStorage3
2019 Respecting the block interface - computational storage using virtual objects
Ian F. Adams, John Keys, Michael P. Mesnier
HotStorage3
2017 Understanding I/O Performance Behaviors of Cloud Storage from a Client's Perspective
abstract
Cloud storage has gained increasing popularity in the past few years. In cloud storage, data is stored in the service provider’s data centers, and users access data via the network. For such a new storage model, our prior wisdom about conventional storage may not remain valid nor applicable to the emerging cloud storage. In this article, we present a comprehensive study to gain insight into the unique characteristics of cloud storage and optimize user experiences with cloud storage from a client’s perspective. Unlike prior measurement work that mostly aims to characterize cloud storage providers or specific client applications, we focus on analyzing the effects of various client-side factors on the user-experienced performance. Through extensive experiments and quantitative analysis, we have obtained several important findings. For example, we find that (1) a proper combination of parallelism and request size can achieve optimized bandwidths, (2) a client’s capabilities and geographical location play an important role in determining the end-to-end user-perceivable performance, and (3) the interference among mixed cloud storage requests may cause performance degradation. Based on our findings, we showcase a sampling- and inference-based method to determine a proper combination for different optimization goals. We further present a set of case studies on client-side chunking and parallelization for typical cloud-based applications. Our studies show that specific attention should be paid to fully exploiting the capabilities of clients and the great potential of cloud storage services.
Binbing Hou, Feng Chen 0005, Zhonghong Ou, Ren Wang 0001, Michael P. Mesnier
ACM Trans. Storage5
2016 Understanding I/O performance behaviors of cloud storage from a client's perspective
abstract
Cloud storage has gained increasing popularity in the past few years. In cloud storage, data is stored in the service provider's data centers, and users access data via the network. For such a new storage model, our prior wisdom about conventional storage may not remain valid nor applicable to the emerging cloud storage. In this paper, we present a comprehensive study and attempt to gain insight into the unique characteristics of cloud storage, primarily from the client's perspective. Through extensive experiments and quantitative analysis, we have acquired several interesting, and in some cases unexpected, findings. (1) Parallelizing I/Os and increasing request sizes are keys to improving the performance, but optimal bandwidth may only be achieved with a proper combination of parallelism and request size. (2) Client capabilities, including CPU, memory, and storage, play an unexpectedly important role in determining the achievable performance. (3) A geographically long distance affects client-perceived performance but does not always result in lower bandwidth and longer latency. Based on our experimental studies, we further present a case study on appropriate chunking and parallelization in a cloud storage client. Our studies show that specific attention should be paid to fully exploiting the capabilities of clients and the great potential of cloud storage services.
Binbing Hou, Feng Chen 0005, Zhonghong Ou, Ren Wang 0001, Michael P. Mesnier
MSST5
2014 A protected block device for Persistent Memory
abstract
Persistent Memory (PM) technologies, such as Phase Change Memory, STT-RAM, and memristors, are receiving increasingly high interest in academia and industry. PM provides many attractive features, such as DRAM-like speed and storage-like persistence. Yet, because it draws a blurry line between memory and storage, neither a memory- or storage-based model is a natural fit. Best integrating PM into existing systems has become challenging and is now a top priority for many. In this paper we share our initial approach to integrating PM into computer systems, with minimal impact to the core operating system. By adopting a hybrid storage model, all of our changes are confined to a block storage driver, called PMBD, which directly accesses PM attached to the memory bus and exposes a logical block I/O interface to users. We explore the design space by examining a variety of options to achieve performance, protection from stray writes, ordered persistence, and compatibility for legacy file systems and applications. All told, we find that by using a combination of existing OS mechanisms (per-core page table mappings, non-temporal store instructions, memory fences, and I/O barriers), we are able to achieve each of these goals with small performance overhead for both micro-benchmarks and real world applications (e.g., file server and database workloads). Our experience suggests that determining the right combination of existing platform and OS mechanisms is a non-trivial exercise. In this paper, we share both our failed and successful attempts. The final solution that we propose represents an evolution of our initial approach. We have also open-sourced our software prototype with all attempted design options to encourage further research in this area.
Feng Chen 0005, Michael P. Mesnier, Scott Hahn
MSST2
2014 Client-aware cloud storage
abstract
Cloud storage is receiving high interest in both academia and industry. As a new storage model, it provides many attractive features, such as high availability, resilience, and cost efficiency. Yet, cloud storage also brings many new challenges. In particular, it widens the already-significant semantic gap between applications, which generate data, and storage systems, which manage data. This widening semantic gap makes end-to-end differentiated services extremely difficult. In this paper, we present a client-aware cloud storage framework, which allows semantic information to flow from clients, across multiple intermediate layers, to the cloud storage system. In turn, the storage system can differentiate various data classes and enforce predefined policies. We showcase the effectiveness of enabling such client awareness by using Intel's Differentiated Storage Services (DSS) to enhance persistent disk caching and to control I/O traffic to different storage devices. We find that we can significantly outperform LRU-style caching, improving upload bandwidth by 5x and download bandwidth by 1.6x. Further, we can achieve 85% of the performance of a full-SSD solution at only a fraction (14%) of the cost.
Feng Chen 0005, Michael P. Mesnier, Scott Hahn
MSST2
2012 hStorage-DB: Heterogeneity-aware Data Management to Exploit the Full Capability of Hybrid Storage Systems
abstract
As storage systems become increasingly heterogeneous and complex, it adds burdens on DBAs, causing suboptimal performance even after a lot of human efforts have been made. In addition, existing monitoring-based storage management by access pattern detections has difficulties to handle workloads that are highly dynamic and concurrent. To achieve high performance by best utilizing heterogeneous storage devices, we have designed and implemented a heterogeneity-aware software framework for DBMS storage management called hStorage-DB, where semantic information that is critical for storage I/O is identified and passed to the storage manager. According to the collected semantic information, requests are classified into different types. Each type is assigned a proper QoS policy supported by the underlying storage system, so that every request will be served with a suitable storage device. With hStorage-DB, we can well utilize semantic information that cannot be detected through data access monitoring but is particularly important for a hybrid storage system. To show the effectiveness of hStorage-DB, we have implemented a system prototype that consists of an I/O request classification enabled DBMS, and a hybrid storage system that is organized into a two-level caching hierarchy. Our performance evaluation shows that hStorage-DB can automatically make proper decisions for data allocation in different storage devices and make substantial performance improvements in a cost-efficient way.
Rubao Lee, Michael P. Mesnier, Feng Chen 0005, Xiaodong Zhang 0001
Proc. VLDB Endow.3
2011 Differentiated storage services
abstract
We propose an I/O classification architecture to close the widening semantic gap between computer systems and storage systems. By classifying I/O, a computer system can request that different classes of data be handled with different storage system policies. Specifically, when a storage system is first initialized, we assign performance policies to predefined classes, such as the filesystem journal. Then, online, we include a classifier with each I/O command (e.g., SCSI), thereby allowing the storage system to enforce the associated policy for each I/O that it receives.
Michael P. Mesnier, Feng Chen 0005, Jason B. Akers
SOSP1
2007 //TRACE: Parallel Trace Replay with Approximate Causal Events
Michael P. Mesnier, Matthew Wachs, Raja R. Sambasivan, Julio López 0002, James Hendricks, Gregory R. Ganger, David R. O'Hallaron
FAST1
2007 Modeling the relative fitness of storage
abstract
Relative fitness is a new black-box approach to modeling the performance of storage devices. In contrast with an absolute model that predicts the performance of a workload on a given storage device, a relative fitness model predicts performance differences between a pair of devices. There are two primary advantages to this approach. First, because are lative fitness model is constructed for a device pair, the application-device feedback of a closed workload can be captured (e.g., how the I/O arrival rate changes as the workload moves from device A to device B). Second, a relative fitness model allows performance and resource utilization to be used in place of workload characteristics. This is beneficial when workload characteristics are difficult to obtain or concisely express (e.g., rather than describe the spatio-temporal characteristics of a workload, one could use the observed cache behavior of device A to help predict the performance of B.
Michael P. Mesnier, Matthew Wachs, Raja R. Sambasivan, Alice X. Zheng, Gregory R. Ganger
SIGMETRICS1
2005 Ursa Minor: Versatile Cluster-based Storage
Michael Abd-El-Malek, William V. Courtright II, Chuck Cranor, Gregory R. Ganger, James Hendricks, Andrew J. Klosterman, Michael P. Mesnier, Manish Prasad, Brandon Salmon, Raja R. Sambasivan, Shafeeq Sinnamohideen, John D. Strunk, Eno Thereska, Matthew Wachs, Jay J. Wylie
FAST7
2000 NEOS and Condor: solving optimization problems over the Internet
abstract
We discuss the use of Condor, a distributed resource management system, as a provider of computational resources for NEOS, an environment for solving optimization problems over the Internet. We also describe how problems are submitted and processed by NEOS, and then scheduled and solved by Condor on available (idle) workstations
Michael C. Ferris, Michael P. Mesnier, Jorge J. Moré
ACM Trans. Math. Softw.2