The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] data placement(4hit)

1-4hit
  • A Logical Model and Data Placement Strategies for MEMS Storage Devices

    Yi-Reun KIM  Kyu-Young WHANG  Min-Soo KIM  Il-Yeol SONG  

     
    PAPER-Database

      Vol:
    E92-D No:11
      Page(s):
    2218-2234

    MEMS storage devices are new non-volatile secondary storages that have outstanding advantages over magnetic disks. MEMS storage devices, however, are much different from magnetic disks in the structure and access characteristics in the following ways. They have thousands of heads called probe tips and provide the following two major access facilities: (1) flexibility : freely selecting a set of probe tips for accessing data, (2) parallelism: simultaneously reading and writing data with the set of probe tips selected. Due to these characteristics, it is nontrivial to find data placements that fully utilize the capability of MEMS storage devices. In this paper, we propose a simple logical model called the Region-Sector (RS) model that abstracts major characteristics affecting data retrieval performance, such as flexibility and parallelism, from the physical MEMS storage model. We also suggest heuristic data placement strategies based on the RS model. To show the usability of the RS model, we derive new data placements for relational data and two-dimensional spatial data by using these strategies. Experimental results show that the proposed data placements improve the data retrieval performance by up to 4.7 times for relational data and by up to 18.7 times for two-dimensional spatial data of approximately 320 Mbytes compared with those of existing data placements. Further, these improvements are expected to be more marked as the database size grows.

  • A Zone-Based Data Placement and Retrieval Scheme for Video-on-Demand Applications Regardless of Video Popularity

    Ming-Jen CHEN  Chwan-Chia WU  

     
    PAPER-Multimedia Systems

      Vol:
    E86-B No:10
      Page(s):
    3094-3102

    This paper presents a novel data placement and retrieval scheme for video-on-demand systems. In particular, a zone-based data placement scheme is employed to reduce the average seek time of the disk array storage system and thus increase the disk access bandwidth to allow the video server provide more services of video programs concurrently. Furthermore, due to the inherent nature of video access, a popular program always requires more accesses and therefore occupies more disk I/O bandwidth as request for serving such program increases. A new retrieval strategy is proposed to maintain a single copy of each video program disregarding the popularity of the video programs, and to achieve maximum I/O throughput of the video server.

  • Striping in a Disk Array with Data/Parity Placement Scheme RM2 Tolerating Double Disk Failures*

    Chan-Ik PARK  

     
    PAPER-Disk array

      Vol:
    E79-D No:8
      Page(s):
    1072-1085

    There is a growing demand for high reliability beyond what current RAID can provide and there are various levels of user demand for data reliability. An efficient data placement scheme called RM2 has been proposed in [10], which makes a disk array system resistant to double disk failures. In this paper, we consider how to choose an optimal striping unit for RM2 particularly when no workload information is available except read/write ratio. For experimental purposes, we develop a disk array simulator incorporating RM2 as one of the data placement schemes including other schemes of RAID levels. In the case of disk read operations, it is shown that RM2 has an optimal striping unit of 4/3T for large requests and 8/3T for small requests, where T represents the size of a single track. We have also shown that, if any disk write operations are involved, an optimal striping unit becomes 1/3T for large requests and 8/3T for small requests.

  • An Efficient Storage Scheme for Multimedia Server*

    Jooyoung SON  Yanghee CHOI  

     
    PAPER

      Vol:
    E79-D No:6
      Page(s):
    712-718

    Storage system in a multimedia server must satisfy two contradicting requirements: real-timeliness and large number of parallel user requests. Efficient algorithms for data placement, disk head scheduling, and request admission control schemes are needed to support the requirements. In this paper, we propose efficient schemes to maximize system resource utilization and service availability: cyclic placement scheme, subgroup retrieval scheme, and measurement-based request admission control scheme. Performance analysis through simulation revealed that the amount of system buffers required can be reduced by 70% approximately.