Sync classes: A framework for optimal scheduling of requests in multimedia storage servers

Leana Golubchik*, V. S. Subrahmanian, Sherry Marcus, Joachim Biskup

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


There have been many proposals on how media-on-demand servers can effectively allow clients to share resources. In this paper, given a set of clients, we show how these clients may be partitioned into "sync-classes" - sets of clients who can be serviced through allocation of a single set of resources. As a set of clients may be partitioned into sync-classes in many different ways, we show that a very large class of cost functions may be used to determine which partition to choose. We provide algorithms to compute such optimal splits. Our framework is very generic in the following ways: 1) The system may plug-in any cost function whatsoever, as long as it satisfies four common-sense axioms that evaluate costs, and 2) the system may evaluate the future anticipated requests of a user using any user model (e.g., a Markovian model) that has a specified I/O interface. Thus, a wide variety of predictive methods (of what the user will do) and a wide variety of costing methods may be used within our framework.

Original languageEnglish (US)
Pages (from-to)60-77
Number of pages18
JournalIEEE Transactions on Knowledge and Data Engineering
Issue number1
StatePublished - Jan 2000
Externally publishedYes


  • Interactive systems
  • Media-on-demand servers
  • Optimization
  • Scheduling
  • Storage servers

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'Sync classes: A framework for optimal scheduling of requests in multimedia storage servers'. Together they form a unique fingerprint.

Cite this