Caching and scheduling in NAD-based multimedia servers

Nabil J. Sarhan, Chita R. Das

Research output: Contribution to journalArticle

32 Scopus citations

Abstract

Multimedia-on-Demand/(MOD) applications have grown dramatically in popularity, especially in the domains of education, business, and entertainment. Current MOD servers waste precious resources in performing store-and-forward copying. This excessive overhead increases cost and severely limits the scalability of these servers. In this paper, we propose using the Network-Attached Disk (NAD) architecture to design highly scalable and cost-effective MOD servers. In order to ensure enhanced performance, we propose a scheme, called Distributed Interval Caching (DIC), which utilizes the on-disk buffers for caching intervals between successive streams. We also propose another scheme, called Multi-Objective Scheduling (MOS), which increases the degrees of resource sharing by scheduling the waiting requests for service intelligently. We then integrate the two schemes and study the overall performance benefits through extensive simulation. The results demonstrate that the integrated policy works very well in increasing the number of customers that can be serviced concurrently while decreasing their waiting times for service. The performance benefits vary with several architectural, system workload, and scheduling parameters. We conclude this study by developing an analytical model for ideal DIC in order to estimate the performance limits which may be achieved through various optimizations.

Original languageEnglish (US)
Pages (from-to)921-933
Number of pages13
JournalIEEE Transactions on Parallel and Distributed Systems
Volume15
Issue number10
DOIs
StatePublished - Oct 1 2004

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Caching and scheduling in NAD-based multimedia servers'. Together they form a unique fingerprint.

  • Cite this