DADA : Dynamic Allocation of Disk Area

نویسندگان

  • Jayaram Bobba
  • Vivek Shrivastava
چکیده

With current estimates of data to be managed and made available increasing at 60% per annum, disk space utilization is becoming a critical performance issue for high end users, including but not limited to IT solutions, Storage Area Networks and Virtual Machine environment. We propose Dynamic Allocation of Disk Area (DADA), a disk management framework that performs on-demand disk area allocation on the basis of user access patterns. Results show that our service can reduce disk space utilization upto 20 times when compared to traditional static allocation policies. Also it is shown that using certain pre allocation schemes, minimize the overhead incurred due to on demand allocation. Our experiments indicate that there is a tradeoff between disk utilization and the runtime performance of the programs. We test our scheme on two microbenchmarks with varied properties and show that our framework performs considerably better for non I/O intensive applications. Also we perform experiments on HP disk traces to study the efficacy of our pre allocation mechanisms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DADA: Duplication Aware Disk Array

Primary storage systems contain only moderate degree of duplication and do not benefit greatly from deduplication. Instead of removing duplicates, we propose a duplication aware disk array (DADA), which keeps track of block duplication and uses the duplicate contents to improve the reliability and availability of disk arrays on primary storage systems. Problem: Duplicate contents on disk have r...

متن کامل

Evaluating the importance of dynamic allocation and routing of rescuers in reducing response time

Due to delay in receiving emergency medical services, a high number of injured people and patients annually lose their lives. Determining the medical service area and correct routing of rescuing operation is influential on the reduction of rescuers’ response time. Changing the traffic flow leads to change of medical service area. Therefore, it is expected that by observing changing traffic, the...

متن کامل

A Dynamic Bitmap for Huge File System in SANs

A storage area network (SAN) is a high-speed special-purpose network (or subnetwork) that interconnects different kinds of data storage devices with associated data servers on behalf of a larger network of users. In SAN, computers service local file requests directly from shared storage devices. Direct device access eliminates the server machines as bottlenecks to performance and availability. ...

متن کامل

Disk Scheduling for Intermediate Results of Large Join Queries in Shared-Disk Parallel Database Systems

In shared-disk database systems, disk access has to be scheduled properly to avoid unnecessary contention between processors. The first part of this report studies the allocation of intermediate results of join queries (buckets) on disk and derives heuristics to determine the number of processing nodes and disks to employ. Using an analytical model, we show that declustering should be applied e...

متن کامل

Circular Data-space Partitioning for Similarity Queries and Parallel Disk Allocation

In a multiple disk environment it is desirable to have techniques for efficient parallel execution of similarity queries. Usually many buckets that may have the query result are needed to be retrieved from secondary storage, which is a costly operation. To achieve efficiency, there are two major factors that need to be considered. These are the number of buckets retrieved by the query, and the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005