Data placement techniques for serpentine tapes

Abstract

Due to the information explosion we are witnessing, a growing number of applications store, maintain, and retrieve large volumes of data, where the data is required to be available online or near-online. These data repositories are implemented using hierarchical storage structures (HSS). One of the components of HSS is tertiary storage, which provides a cost-effective storage for the vast amount of data manipulated by these applications. However, it is crucial that the 3-4 orders of magnitude difference in access time between the tertiary storage and the secondary storage be bridged to allow online or near-online access to the tertiary resident data. This wide access-gap is mainly due to: the sequential nature of the most popular tertiary technologies (i.e., tapes) and the low number of drives per media in tertiary storage juke boxes. In this paper, we propose a novel data placement technique specifically designed for the serpentine tape technology, namely: Wrap ARound data Placement (WARP). We focus on tape technology because they provide the most cost-effective storage for very large databases, and more specifically on serpentine tapes because they are increasingly the technology of choice for mid-range and high-end systems. WARP may reduce the access time by 1 order of magnitude, depending on the tape device specifications and object sizes. An important feature of WARP is that it optimizes access-time independently of the retrieval order. This is achieved by exploiting the serpentine tape technology characteristics as opposed to the application characteristics. We have implemented this technique on an IBM 3590 tape drive and have observed up to 5 times improvement in access-time as compared to other data placement techniques. Moreover, with WARP, the variance between the best, the worst, and the average access-times is very small, allowing for a priori prediction NIH grant 1P20MH52194-01A1 (USCBP), and NSF grants EEC-9529152 (IMSC ERC) and MRI-9724567. of the access-time behavior by time sensitive applications.

Simulation of Hierarchical Storage Systems for TCO and QoS

“…This is mostly in the domain of vendors and not much of the research conducted is published to protect a business advantage. More openly discussed are strategies for data placement on tape [1][9] [8] and the magnetic representation [2]. Such strategies maybe exploited by higher level algorithms, but tape drives and hardware generally do not expose fine-grained control to the users.…”