Min–max subsequence problems in multi-zone disk recording

Min–max subsequence problems in multi-zone disk recording

0.00 Avg rating0 Votes
Article ID: iaor20032319
Country: United Kingdom
Volume: 4
Issue: 5
Start Page Number: 271
End Page Number: 283
Publication Date: Sep 2001
Journal: Journal of Scheduling
Authors: ,
Keywords: computers: data-structure
Abstract:

We study the problem of ordering a collection of n numbers such that the maximum sum of k successive numbers is minimized. The problem occurs in the design of video servers and in-home hard disk recorders used for storage of video files. By alternately assigning the successive data blocks of a video file to the different zones of a hard disk one can guarantee a higher transfer rate over a given period of time than otherwise can be guaranteed. We briefly sketch the context of the ordering problem and indicate that it is NP-complete in the strong sense for each k ≥ 3. For k = 2, we present an optimal algorithm. For k ≥ 3, we present an approximation algorithm for which we give performance bounds. Furthermore, we show by an example how the resulting assignment of data blocks to the zones affects the performance of the system.

Reviews

Required fields are marked *. Your email address will not be published.