Adaptive block rearrangement algorithms for video-on-demand server

N. J. Sarhan, Chitaranjan Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Video-on-demand (VOD) is increasingly becoming one of the most important and successful services due to the recent advances in storage subsystems, compression technology and, networking. Therefore, the investigation of various alternatives to improve the performance of VOD servers has become a major research focus. The reduction of disk access time through intelligent data placement strategies is one such avenue and is the theme of this paper: Movie rental patterns indicate that accesses to movies are highly localized with only a small number of movies receiving most of the accesses. In this paper we exploit the access patterns and propose an adaptive rearrangement of the blocks on each disk within the server. With this approach, the blocks of the movies with comparable access frequencies are kept closer to each other We analyze two rearrangement schemes, called centered and sequential. In the centered layout, blocks are placed according to their access patterns starting with the most popular movie at the center. The sequential layout places movies in the order of their popularity starting at the edge of the disk. We compare and evaluate, through an intensive simulation study, the effectiveness of these layouts with respect to arbitrary layouts. The simulation results indicate that significant disk improvements could be attained by adopting the proposed schemes, and that the centered layout is the best performer.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Parallel Processing, ICPP 2001
EditorsLionel M. Ni, Mateo Valero
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages452-459
Number of pages8
ISBN (Electronic)0769512577
DOIs
StatePublished - Jan 1 2001
EventInternational Conference on Parallel Processing, ICPP 2001 - Valencia, Spain
Duration: Sep 3 2001Sep 7 2001

Publication series

NameProceedings of the International Conference on Parallel Processing
Volume2001-January
ISSN (Print)0190-3918

Other

OtherInternational Conference on Parallel Processing, ICPP 2001
CountrySpain
CityValencia
Period9/3/019/7/01

Fingerprint

Video on Demand
Video on demand
Rearrangement
Servers
Server
Layout
Data Placement
Networking
Subsystem
Compression
Simulation Study
Evaluate
Alternatives
Arbitrary
Simulation

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Sarhan, N. J., & Das, C. (2001). Adaptive block rearrangement algorithms for video-on-demand server. In L. M. Ni, & M. Valero (Eds.), Proceedings - International Conference on Parallel Processing, ICPP 2001 (pp. 452-459). [952092] (Proceedings of the International Conference on Parallel Processing; Vol. 2001-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPP.2001.952092
Sarhan, N. J. ; Das, Chitaranjan. / Adaptive block rearrangement algorithms for video-on-demand server. Proceedings - International Conference on Parallel Processing, ICPP 2001. editor / Lionel M. Ni ; Mateo Valero. Institute of Electrical and Electronics Engineers Inc., 2001. pp. 452-459 (Proceedings of the International Conference on Parallel Processing).
@inproceedings{8c61c8e57e034e8bb8c7f5984c3ad0df,
title = "Adaptive block rearrangement algorithms for video-on-demand server",
abstract = "Video-on-demand (VOD) is increasingly becoming one of the most important and successful services due to the recent advances in storage subsystems, compression technology and, networking. Therefore, the investigation of various alternatives to improve the performance of VOD servers has become a major research focus. The reduction of disk access time through intelligent data placement strategies is one such avenue and is the theme of this paper: Movie rental patterns indicate that accesses to movies are highly localized with only a small number of movies receiving most of the accesses. In this paper we exploit the access patterns and propose an adaptive rearrangement of the blocks on each disk within the server. With this approach, the blocks of the movies with comparable access frequencies are kept closer to each other We analyze two rearrangement schemes, called centered and sequential. In the centered layout, blocks are placed according to their access patterns starting with the most popular movie at the center. The sequential layout places movies in the order of their popularity starting at the edge of the disk. We compare and evaluate, through an intensive simulation study, the effectiveness of these layouts with respect to arbitrary layouts. The simulation results indicate that significant disk improvements could be attained by adopting the proposed schemes, and that the centered layout is the best performer.",
author = "Sarhan, {N. J.} and Chitaranjan Das",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/ICPP.2001.952092",
language = "English (US)",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "452--459",
editor = "Ni, {Lionel M.} and Mateo Valero",
booktitle = "Proceedings - International Conference on Parallel Processing, ICPP 2001",
address = "United States",

}

Sarhan, NJ & Das, C 2001, Adaptive block rearrangement algorithms for video-on-demand server. in LM Ni & M Valero (eds), Proceedings - International Conference on Parallel Processing, ICPP 2001., 952092, Proceedings of the International Conference on Parallel Processing, vol. 2001-January, Institute of Electrical and Electronics Engineers Inc., pp. 452-459, International Conference on Parallel Processing, ICPP 2001, Valencia, Spain, 9/3/01. https://doi.org/10.1109/ICPP.2001.952092

Adaptive block rearrangement algorithms for video-on-demand server. / Sarhan, N. J.; Das, Chitaranjan.

Proceedings - International Conference on Parallel Processing, ICPP 2001. ed. / Lionel M. Ni; Mateo Valero. Institute of Electrical and Electronics Engineers Inc., 2001. p. 452-459 952092 (Proceedings of the International Conference on Parallel Processing; Vol. 2001-January).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Adaptive block rearrangement algorithms for video-on-demand server

AU - Sarhan, N. J.

AU - Das, Chitaranjan

PY - 2001/1/1

Y1 - 2001/1/1

N2 - Video-on-demand (VOD) is increasingly becoming one of the most important and successful services due to the recent advances in storage subsystems, compression technology and, networking. Therefore, the investigation of various alternatives to improve the performance of VOD servers has become a major research focus. The reduction of disk access time through intelligent data placement strategies is one such avenue and is the theme of this paper: Movie rental patterns indicate that accesses to movies are highly localized with only a small number of movies receiving most of the accesses. In this paper we exploit the access patterns and propose an adaptive rearrangement of the blocks on each disk within the server. With this approach, the blocks of the movies with comparable access frequencies are kept closer to each other We analyze two rearrangement schemes, called centered and sequential. In the centered layout, blocks are placed according to their access patterns starting with the most popular movie at the center. The sequential layout places movies in the order of their popularity starting at the edge of the disk. We compare and evaluate, through an intensive simulation study, the effectiveness of these layouts with respect to arbitrary layouts. The simulation results indicate that significant disk improvements could be attained by adopting the proposed schemes, and that the centered layout is the best performer.

AB - Video-on-demand (VOD) is increasingly becoming one of the most important and successful services due to the recent advances in storage subsystems, compression technology and, networking. Therefore, the investigation of various alternatives to improve the performance of VOD servers has become a major research focus. The reduction of disk access time through intelligent data placement strategies is one such avenue and is the theme of this paper: Movie rental patterns indicate that accesses to movies are highly localized with only a small number of movies receiving most of the accesses. In this paper we exploit the access patterns and propose an adaptive rearrangement of the blocks on each disk within the server. With this approach, the blocks of the movies with comparable access frequencies are kept closer to each other We analyze two rearrangement schemes, called centered and sequential. In the centered layout, blocks are placed according to their access patterns starting with the most popular movie at the center. The sequential layout places movies in the order of their popularity starting at the edge of the disk. We compare and evaluate, through an intensive simulation study, the effectiveness of these layouts with respect to arbitrary layouts. The simulation results indicate that significant disk improvements could be attained by adopting the proposed schemes, and that the centered layout is the best performer.

UR - http://www.scopus.com/inward/record.url?scp=84951064509&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84951064509&partnerID=8YFLogxK

U2 - 10.1109/ICPP.2001.952092

DO - 10.1109/ICPP.2001.952092

M3 - Conference contribution

AN - SCOPUS:84951064509

T3 - Proceedings of the International Conference on Parallel Processing

SP - 452

EP - 459

BT - Proceedings - International Conference on Parallel Processing, ICPP 2001

A2 - Ni, Lionel M.

A2 - Valero, Mateo

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Sarhan NJ, Das C. Adaptive block rearrangement algorithms for video-on-demand server. In Ni LM, Valero M, editors, Proceedings - International Conference on Parallel Processing, ICPP 2001. Institute of Electrical and Electronics Engineers Inc. 2001. p. 452-459. 952092. (Proceedings of the International Conference on Parallel Processing). https://doi.org/10.1109/ICPP.2001.952092