Zoned-partitioning of tree-like access methods

The performance of access methods and the underlying disk system is a significant factor in determining the performance of database applications, especially with large sets of data. While modern hard disks are manufactured with multiple physical zones, where seek times and data transfer rates vary significantly across the zones, there has been little consideration of this important disk characteristic in designing access methods (indexing schemes). Instead, conventional access methods have been developed based on a traditional disk model that comes with many simplifying assumptions such as an average seek time and a single data transfer rate. The paper proposes novel partitioning techniques that can be applied to any tree-like access methods, both dynamic and static, fully utilizing zoning characteristics of hard disks. The index pages are allocated to disk zones in such a way that more frequently accessed index pages are stored in a faster disk zone. On top of the zoned data placement, a localized query processing technique is proposed to significantly improve the query performance by reducing page retrieval times from the hard disk.     

非固定双头镜像磁盘实时调度算法的研究

文章给出一个实时非固定双头镜像磁盘系统的形式化模型.该磁盘模型中的每个双头磁盘都有两个相互独立的磁臂,能够独立地完成寻找磁道过程.针对该磁盘系统,文章研究了3种实时调度算法.模拟实验表明,“忽略超截止期调度算法”的性能最好,因为它忽略了对超截止期限实时请求的处理.文章同时分析了固定双头镜像磁盘与非固定双头镜像磁盘之间的性能差别.实验结果表明,由于非固定双头磁盘的两个磁头可以独立寻找磁道,因此非固定双头镜像磁盘的性能比固定双头镜像磁盘的性能要好.     

GPT磁盘克隆成MBR磁盘后数据恢复的研究

用户在使用Ghost工具软件安装操作系统或者克隆磁盘时,有时会将"选择镜像文件到分区"误操作为"选择镜像文件到磁盘";克隆结束后,导致整个GPT磁盘成为一个大C盘,GPT磁盘中各逻辑盘丢失的现象。针对这种情况,以Windows7为平台,Ghost8.0为实验软件,WinHex15.08为数据分析与恢复软件,在虚拟GPT磁盘中建立5个卷,5个卷的文件系统都是NTFS。再制作一个镜像文件,在镜像文件中建立一个MBR分区,对应文件系统也是NTFS。将镜像文件克隆到GPT磁盘中,造成GPT磁盘中原来5个卷对应分区丢失。对克隆后的GPT磁盘结构进行分析,提出了恢复GPT磁盘各卷的基本思路、方法与步骤,即恢复克隆前的GPT头和GPT头备份。实验结果表明:除第1个分区中的部分数据被覆盖无法恢复外,GPT磁盘中剩余4个卷的数据均可完整恢复。     

Range Query Processing in Multidisk Systems

In order to reduce the disk access time,a database can be stored on several simultaneously accessible disks.In this paper,we are concerned with the dynamic d-attribute database allocation problem for range queries,An allocation method,called coordinate moule allocation method,is proposed to allocate data in a d-attribute database among disks so that the maximum disk accessing concurrency can be achieved for range queries.Our analysis and experiments show that the method achieves the optimum or near-optimum parallelism for range queries.The paper offers the conditions under which the method is optimal .The worst case bounds of the performance of the method are also given.In addition,the parallel algorithm of processing range queries in described at the end of the paper.The method has been used in the statistic and scientific database management system whic is being designed by us.     

Optimization of I/O systems by cache disks and file migration: A summary

The file system, and the components of the computer system associated with it (disks, drums, channels, mass storage, tapes and tape drives, controllers, I/O drivers, etc.) comprise a very substantial fraction of most computer systems; substantial in several aspects, including amount of operating system code, expense for components, physical size and effect on performance. In a companion paper, we surveyed the traditional methods for optimizing the I/O system. We then examined disk and I/O system architecture in IBM type systems, and indicated shortcomings and future directions. In this paper we go one step further and summarize research by the author on two topics: cache disks and file migration. Cache disks are disks which have an associated cache which buffers recently used tracks of data. The case for cache disks is presented, and some of the issues are discussed. Parameter values for some aspects of the cache design are suggested. The second part of this paper summarizes the author's work on file migration, by which files are migrated between disk and mass storage as needed in order to effectively maintain on-line a much larger amount of information than the disks can hold. Some of the algorithms investigated are discussed, and the basic results are presented.     

Optimization of I/O systems by cache disks and file migration: A summary

The file system, and the components of the computer system associated with it (disks, drums, channels, mass storage tapes and tape drives, controllers, I/O drivers, etc.) comprise a very substantial fraction of most computer systems; substantial in several aspects, including amount of operating system code, expense for components, physical size and effect on performance. In a comparison paper, we surveyed the traditional methods for optimizing the I/O system. We then examined disk and I/O system architecture in IBM type systems, and indicated shortcomings and future directions. In this paper we go one step further and summarize research by the author on two topics: cache disks and file migration. Cache disks are disks which have an associated cache which buffers recently used tracks of data. The case for cache disks is presented, and some of the issues are discussed. Parameter values for some aspects of the cache design are suggested. The second part of this paper summarizes the author's work on file migration, by which files are migrated between disk and mass storage as needed in order to effectively maintain on-line a much larger amount of information than the disks can hold. Some of the algorithms investigated are discussed, and the basic results are presented.     

进化存储系统中的物理进化

系统整体结构不能很好地适应系统磁盘的动态变化,这是现有存储系统中普遍存在的一个问题。而我们提出的进化存储系统ERAID（Evolving RAID system）是一个动态存储系统,能够在不停止系统I／O服务的前提下,采用DAA、HDAA、e-HDAA算法分别实现存储系统中同构磁盘的添加、异构磁盘的添加以及异构磁盘的替换,即实现存储系统的物理进化。仿真实验结果表明：在较小的系统开销下,DAA、HDAA、e-HDAA算法能逐渐吸收添加或替换到ERAID系统的（同构或异构）磁盘,使ERAID系统获得优化的存储客量和存储性能。     

A comprehensive analytical performance model for disk devices underrandom workloads

Our goal is to contribute a common theoretical framework for studying the performance of disk-storage devices. Understanding the performance behavior of these devices will allow prediction of the I/O cost in modern applications. Current disk technologies differ in terms of the fundamental modeling characteristics, which include the magnetic/optical nature, angular and linear velocities, storage capacities, and transfer rates. Angular and linear velocities, storage capacities, and transfer rates are made constant or variable in different existing disk products. Related work in this area has studied Constant Angular Velocity (CAV) magnetic disks and Constant Linear Velocity (CLV) optical disks. We present a comprehensive analytical model, validated through simulations, for the random retrieval performance of disk devices which takes into account all the above-mentioned fundamental characteristics and includes, as special cases, all the known disk-storage devices. Such an analytical model can be used, for example, in the query optimizer of large traditional databases as well as in an admission controller of multimedia storage servers. Besides the known models for magnetic CAV and optical CLV disks, our unifying model is also reducible to a model for a more recent disk technology, called zoned disks, the retrieval performance of which has not been modeled in detail before. The model can also be used to study the performance retrieval of possible future technologies which combine a number of the above characteristics and in environments containing different types of disks (e.g., magnetic-disk-based secondary storage and optical-disk-based tertiary storage). Using our model, we contribute an analysis of the performance behavior of zoned disks and we compare it against that for the traditional CAV disks, as well as against that of some possible/future technologies. This allows us to gain insights into the fundamental performance trade-offs     

基于遗传算法的RAID磁盘阵列中磁盘负载均衡方法

该文对RAID磁盘阵列内逻辑磁盘和物理磁盘之间的映射和负载关系进行分析,提出了一种基于遗传算法的物理磁盘间负载均衡方法,以提高磁盘阵列的吞吐量。仿真实验证明该方法是有效的。     

BASE: an assistant tool to precisely simulate energy consumption and reliability of energy‐efficient storage systems

The concept of green storage in cluster computing has recently attracted enormous interest among researchers. Consequently, several energy‐efficient solutions, such as multi‐speed disks and disk spin down methods, have been proposed to conserve power in storage systems and improve disk access. Some researchers have assessed their proposed solutions via simulations, while others have used real‐world experiments. Both methods have advantages and disadvantages. Simulations can more swiftly assess the benefits of energy‐efficient solutions, but various measurement errors can arise from procedural shortcomings. For instance, many power simulation tools fail to consider how heat increases the power overhead of disk operations. Some researchers claim that their modeling methods reduce the measurement error to 5% in the single disk model. However, the demand for large‐scale storage systems is growing rapidly. Traditional power measurement using a single disk model is unsuited to such systems because of their complex storage architecture and the unpredictability of numerous disks. Consequently, a number of studies have conducted real machine experiments to assess the performance of their solutions in terms of power conservation, but such experiments are time consuming. To address this problem, this study proposes an efficient simulation tool called Benchmark Analysis Software for Energy‐efficient Solution (BASE), which can accurately estimate disks' power consumption in large‐scale storage systems. We evaluate the performance of BASE on real‐world traces of Academia Sinica (Taiwan) and Florida International University. BASE incorporates an analytical method for assessing the reliability of energy‐efficient solutions. The analytical results demonstrate that the measurement error of BASE is 2.5% lower than that achieved in real‐world experiments involving energy‐estimation experiments. Moreover, the results of simulations to assess solution reliability are identical to those obtained through real‐world experiments. Copyright © 2015 Copyright © 2015 John Wiley & Sons, Ltd.     

Hardware design of a new genetic based disk scheduling method

Disk management is an increasingly important aspect of operating systems research and development because it has great effect on system performance. As the gap between processor and disk performance continues to increase in modern systems, access to mass storage is a common bottleneck that ultimately limits overall system performance. In this paper, we propose hardware architecture of a new genetic based real-time disk scheduling method. Also, to have a precise simulation, a neural network is proposed to simulate seek-time of disks. Simulation results showed the hardware implementation of proposed algorithm outperformed software implementation in term of execution time, and other related works in terms of number of tasks that miss deadlines and average seeks.     

Improving multimedia systems performance using constant-density recording disks

Multimedia systems store and retrieve large amounts of data which require extremely high disk bandwidth and their performance critically depends on the efficiency of disk storage. However, existing magnetic disks are designed for small amounts of data retrievals geared to traditional operations; with speed improvements mainly focused on how to reduce seek time and rotational latency. When the same mechanism is applied to multimedia systems, overheads in disk I/O can result in dramatic deterioration in system performance. In this paper, we present a mathematical model to evaluate the performance of constant-density recording disks, and use this model to analyze quantitatively the performance of multimedia data request streams. We show that high disk throughput may be achieved by suitably adjusting the relevant parameters. In addition to demonstrating quantitatively that constant-density recording disks perform significantly better than traditional disks for multimedia data storage, a novel disk-partitioning scheme which places data according to their bandwidths is presented.     

Strip-oriented asynchronous prefetching for parallel disk systems

Sequential prefetching schemes are widely employed in storage servers to mask disk latency and improve system throughput. However, existing schemes cannot benefit parallel disk systems as expected due to the fact that they ignore the distinct internal characteristics of the parallel disk system, in particular, data striping. Moreover, their aggressive prefetching pattern suffers from premature evictions and prolonged request latencies. In this paper, we propose a strip-oriented asynchronous prefetching (SoAP) technique, which is dedicated to the parallel disk system. It settles the above-mentioned problems by providing multiple novel features, e.g., enhanced prediction accuracy, adaptive prefetching strength, physical data layout awareness, and timely prefetching. To validate SoAP, we implement a prototype by modifying the software redundant arrays of inexpensive disks (RAID) under Linux. Experimental results demonstrate that SoAP can consistently offer improved average response time and throughput to the parallel disk system under non-random workloads compared with STEP, SP, ASP, and Linux-like SEQPs.     

双拷贝磁盘技术及其性能评价

本文首先介绍了多种冗余存储技术,然后提出了囊使用双拷贝技术减少磁盘找道时间的模型。     

基于磁盘冗余空间的数据隐藏

为保护计算机磁盘上的敏感数据, 提出基于磁盘冗余空间的数据隐藏方法。该方法在分析磁盘分区策略和簇式文件系统的文件管理机制的基础上, 将分散的文件簇冗余空间有机组合以存储敏感数据, 并利用存储于分区策略冗余空间的数据结构来维护恢复原始数据所需数据。实验结果表明, 基于磁盘冗余空间的数据隐藏方法不占用文件系统有效空间, 具有隐蔽性高、系统开销小、隐藏容量与文件系统内部文件总量正相关, 以及抗干扰性易受到宿主文件稳定性影响等特点。此外, 当文件总量较大时, 隐藏容量将十分可观, 而通过选取稳定性强的文件作为宿主文件, 可提高该方法的抗干扰性。     

Disk load balancing for video-on-demand systems

For a video-on-demand computer system, we propose a scheme which balances the load on the disks, thereby helping to solve a performance problem crucial to achieving maximal video throughput. Our load-balancing scheme consists of two components. The static component determines good assignments of videos to groups of striped disks. The dynamic component uses these assignments, and features a “DASD dancing” algorithm which performs real-time disk scheduling in an effective manner. Our scheme works synergistically with disk striping. We examine the performance of the proposed algorithm via simulation experiments.     

海量存储网络中的虚拟盘副本容错技术

大规模存储网络中的数据可用性和读写性能越来越重要．在海量存储虚拟化系统的基础上,实现了多副本虚拟盘技术来提高网络存储的数据容错能力．同时,通过多副本选择调度与异步副本更新以及副本盘空间布局的动态调整算法,提高了系统的数据读写能力．测试结果表明,加入虚拟盘副本后,在设备数量充足情况下的读性能可提高26％;即使少量磁盘失效,读写操作也能正确执行,且读性能仍然比无副本时提高10％以上．     

高性能动态虚拟盘阵系统结构

尽管外存储设备的容量增加很快,但是仍无法满足用户应用程序的需要;性能上,外存储设备已成为计算机系统的瓶颈;在集群环境下,将分布式的外设构成一种动态虚拟存储系统能够较好地解决这个问题。通过很好地组织数据,动态存储系统能够随用户的需求而动态扩容和收缩,并且具有高并发性和高可靠性等特点。论文从当今的应用需求出发,分析了用户存储特点及提出动态虚拟盘阵存储系统的原理,介绍了动态虚拟盘阵存储的体系结构和特性。     

Feature based robust watermarking using image normalization

This paper presents a robust watermarking scheme based on feature point detection and image normalization. Firstly some stable feature points are detected from the original image using the proposed multiresolution feature point detection filter. Then, image normalization is applied to the disks centered at these feature points. The watermark is embedded in the subband coefficients of DFT domain of each disk separately. And the watermark detection uses the correlation between the watermark embedding coefficients and the original watermark, and does not need the original image. The proposed scheme combines the advantages of feature point detection and image normalization, which can achieve strong robustness to signal processing and geometrical distortions. The experimental results also demonstrate good performance of the proposed scheme.     

A scalable bandwidth guaranteed distributed continuous media file system using network attached autonomous disks

Repository for continuous media data differs from that of the traditional text-based data both in storage space and streaming bandwidth requirements. The file systems used for continuous media streams need to support large volumes and high bandwidth. We propose a scalable distributed continuous media file system built using autonomous disks. Autonomous disks are attached directly to the network and are able to perform lightweight processing. We discuss different ways to realize the autonomous disk, and describe a prototype implementation on a Linux platform using PC-based hardware. We present the basic requirements of the continuous media file system and present the design methodology and a prototype Linux-based implementation of the distributed file system that supports the requirements. We present experimental results on the performance of the proposed file system prototyped using autonomous disks. We show that the performance of the file system scales linearly with the number of disks and the number of clients. The file system performs much superior to NFS running on the same hardware platform and can deliver higher raw disk bandwidth to the applications. We also present bandwidth and time sensitive read/write procedures for the file system and show that the file system can provide strict bandwidth guarantees for continuous media streams.