• DocumentCode
    776268
  • Title

    Random redundant storage in disk arrays: complexity of retrieval problems

  • Author

    Aerts, Joep ; Korst, Jan ; Spieksma, Frits ; Verhaegh, Wim ; Woeginger, Gerhard

  • Author_Institution
    Philips Res. Labs., Eindhoven, Netherlands
  • Volume
    52
  • Issue
    9
  • fYear
    2003
  • Firstpage
    1210
  • Lastpage
    1214
  • Abstract
    Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.
  • Keywords
    RAID; computational complexity; multimedia servers; complexity classification; data storage; multimedia servers; random redundant storage in disk arrays; retrieval problem complexity; Bandwidth; Bit rate; Buffer storage; Hard disks; Information retrieval; Load management; Network servers; Random access memory; Read-write memory; Streaming media;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2003.1228515
  • Filename
    1228515
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=776268