Clustered scheduling algorithms for mixed-media disk workloads in a multimedia server

Balafoutis, E., Paterakis, M., Triantafillou, P., Nerjes, G., Muth, P. and Weikum, G. (2003) Clustered scheduling algorithms for mixed-media disk workloads in a multimedia server. Cluster Computing, 6(1), pp. 75-86. (doi: 10.1023/A:1020923202104)

Abstract

Divisible load scenarios occur in modern media server applications since most multimedia applications typically require access to continuous and discrete data. A high performance Continuous Media (CM) server greatly depends on the ability of its disk IO subsystem to serve both types of workloads efficiently. Disk scheduling algorithms for mixed media workloads, although they play a central role in this task, have been overlooked by related research efforts. These algorithms must satisfy several stringent performance goals, such as achieving low response time and ensuring fairness, for the discrete-data workload, while at the same time guaranteeing the uninterrupted delivery of continuous data, for the continuous-data workload. The focus of this paper is on disk scheduling algorithms for mixed media workloads in a multimedia information server. We propose novel algorithms, present a taxonomy of relevant algorithms, and study their performance through experimentation. Our results show that our algorithms offer drastic improvements in discrete request average response times, are fair, serve continuous requests without interruptions, and that the disk technology trends are such that the expected performance benefits can be even greater in the future.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Triantafillou, Professor Peter
• Authors: Balafoutis, E., Paterakis, M., Triantafillou, P., Nerjes, G., Muth, P., and Weikum, G.
• College/School: College of Science and Engineering > School of Computing Science
• Journal Name: Cluster Computing
• ISSN: 1386-7857
• ISSN (Online): 1573-7543