Failure-Atomic Updates of Application Data in a Linux File System | USENIX
Rajat Verma and Anton Ajay Mendez, Hewlett-Packard; Stan Park, Hewlett-Packard Labs; Sandya Mannarswamy, Hewlett-Packard; Terence Kelly and Charles B. Morrey III, Hewlett-Packard Labs We present the design, implementation, and evaluation of a file system mechanism that protects the integrity of application data from failures such as process crashes, kernel panics, and power outages. A simple inter
Linux Memory Mapped System Call Performance
Linux Memory Mapped System Call Performance Kousha Najafi Professor Eddie Kohler Steve VanDeBogart I. Introduction Mmap and read are both fundamentally important system calls. Both calls are used to access bytes on disk. Read uses the standard file descriptor access to files while mmap transparently maps files to locations in the process’s memory. Most operating systems also use mmap every time a
Workload Dependent Performance Evaluation of the Btrfs and ZFS Filesystems
Paper Presented at the CMG International Conference 2009 Workload Dependent Performance Evaluation of the Btrfs and ZFS Filesystems Dominique A. Heger DHTechnologies, Austin, Texas dheger@dhtusa.com 1.0 Introduction The UNIX and Linux operating systems alike already provide a vast number of filesystems to the user community. In general, one of the major IO challenges faced today is scalability, e
What every programmer should know about memory, Part 1
What every programmer should know about memory, Part 1 Please consider subscribing to LWNSubscriptions are the lifeblood of LWN.net. If you appreciate this content and would like to see more of it, your subscription will help to ensure that LWN continues to thrive. Please visit this page to join up and keep LWN on the net. [Editor's introduction: Ulrich Drepper recently approached us asking if we
dsync: Efficient Block-wise Synchronization of Multi-Gigabyte Binary Data | USENIX
Backing up important data is an essential task for system administrators to protect against all kinds of failures. However, traditional tools like rsync exhibit poor performance in the face of today's typical data sizes of hundreds of gigabytes. We address the problem of efficient, periodic, multi-gigabyte state synchronization. In contrast to approaches like rsync which determine changes after th
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
The Linux Scheduler: a Decade of Wasted Cores
LISA '07: Application Buffer-Cache Management for Performance: Running the World’s Largest MRTG