Data placement in intermittently available environments

Yun Huang, Nalini Venkatasubramanian

Research output: Chapter in Book/Entry/PoemConference contribution

2 Scopus citations

Abstract

In this paper, we address the problem of data placement in a grid based multimedia environment, where the resource providers, i.e. servers, are intermittently available. The goal is to optimize the system performance by admitting maximum number of users into the system while ensuring user Quality of Service (QoS). We define and formulate various placement strategies that determine the degree of replication necessary for video objects by using a cost-based optimization procedure based on predictions of expected requests under various time-map scenarios and QoS demands. We also devise methods for dereplication of videos based on changes in popularity and server usage patterns. Our performance results indicate the benefits obtained the judicious use of dynamic placement strategies.

Original languageEnglish (US)
Title of host publicationHigh Performance Computing - HiPC 2002 - 9th International Conference, Proceedings
EditorsSartaj Sahni, Viktor K. Prasanna, Uday Shukla
PublisherSpringer Verlag
Pages367-376
Number of pages10
ISBN (Print)3540003037, 9783540003038
DOIs
StatePublished - 2002
Externally publishedYes
Event9th International Conference on High Performance Computing, HiPC 2002 - Bangalore, India
Duration: Dec 18 2002Dec 21 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2552
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Conference on High Performance Computing, HiPC 2002
Country/TerritoryIndia
CityBangalore
Period12/18/0212/21/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Data placement in intermittently available environments'. Together they form a unique fingerprint.

Cite this