Peabody: The Time Travelling Disk
نویسندگان
چکیده
Disk drives are now available with capacities on the order of hundreds of gigabytes. What has not become available is an easy way to manage storage. With installed machines located across the enterprise, the backup, management of application installation, and maintenance of systems have become a nightmare. An increasing trend in the storage industry is to virtualize storage resources, maintaining a central repository that can be accessed across the network. We have designed a network block storage device, Peabody, that exposes virtual disks. These virtual disks provide mechanisms to: recover any previous state of their sectors and share backend storage to improve cache utilization and reduce the total amount of storage needed. Peabody is exposed as an iSCSI target, and is mountable by any iSCSI compatible initiator. Using our implementation of Peabody, we show that for our workloads, up to 84% of disk sectors written, contain identical content to previously written sectors, motivating the need for contentbased coalescing. The overhead for writing in a simple implementation is only 20 percent of the total write speed. This paper describes our early experiences with the Peabody implementation. We quantify how rapidly storage is consumed, examine optimizations, such as content-based coalescing and describe how recovery is currently implemented. We conclude with future plans based on these measurements.
منابع مشابه
Blueprint for a Hard Real-time File System
We examine the problem of scheduling disk requests in a personal hard real-time read/write file system. For arbitrary aperiodic requests, we model the problem of moving the disk arm as a travelling salesperson problem on a one dimensional line, where travel time is proportional to the distance and the time spent at each city is zero. We propose an optimal dynamic-programming algorithm to solve ...
متن کاملNew Algorithms for the Disk Scheduling Problem
Processor speed and memory capacity are increasing several times faster than disk speed. This disparity suggests that disk I/O performance will become an important bottleneck. Methods are needed for using disks more efficiently. Past analysis of disk scheduling algorithms has largely been experimental and little attempt has been made to develop algorithms with provable performance guarantees. W...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملDetection and Modeling of Medium-Scale Travelling Ionospheric Disturbances in Iran Region
Ionosphere layer variations are divided into regular and irregular. Regular changes can be considered as daily changes, changes depending on latitude and changes due to solar activity. Travelling Ionospheric Disturbances (TID) is one of the irregular changes of ionosphere which categorized in small, medium and large scales. Medium-scale Travelling Ionospheric Disturbance (MSTID) which are propa...
متن کامل