A novel data caching scheme for multimedia servers

    Authors

    J. Z. Wang;R. K. Guha

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Simul. Pract. Theory

    Keywords

    multimedia servers; pipelining; data caching scheme; buffer management; disk I/O bandwidth; Computer Science, Interdisciplinary Applications; Computer Science, ; Software Engineering

    Abstract

    In this paper, we propose a Bi-directional Fragmental Pipelining (BFP) technique and its variable buffer size data-caching scheme BFP(V) to reduce the disk I/O bandwidth requirement for multimedia servers. Our mathematical analysis shows that the BFP technique is superior to the traditional unidirectional pipelining technique in terms of memory buffer space requirement. We further demonstrate that the memory buffer management using BFP(V) is better than that of using the fixed buffer size approach BFP(F). We have mathematically proved that BFP(V) saves more disk I/O bandwidth than BFP(F) does using the same memory buffer space. Our simulation results have quantitatively confirmed our analysis. (C) 2001 Elsevier Science B.V. All rights reserved.

    Journal Title

    Simulation Practice and Theory

    Volume

    9

    Issue/Number

    3-5

    Publication Date

    1-1-2002

    Document Type

    Article; Proceedings Paper

    Language

    English

    First Page

    193

    Last Page

    213

    WOS Identifier

    WOS:000176090000006

    ISSN

    0928-4869

    Share

    COinS