Enlarged-Maximum-Scannable-Groups for Real-Time Disk Scheduling in a Multimedia System

  • Authors:
  • Hsung-Pin Chang;Ruei-Chuan Chang;Ray-I Chang;Wei Kuan Shih

  • Affiliations:
  • -;-;-;-

  • Venue:
  • COMPSAC '00 24th International Computer Software and Applications Conference
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

In a multimedia system, disk I/O subsystem is the most important component due to its relatively limited throughput and large delay. Previously, by applying SCAN to reschedule tasks having the same deadline, SCAN-EDF tries to improve disk throughput while real-time constraints can be satisfied. In DM-SCAN, groups of tasks that can be successfully rescheduled by SCAN under specified real-time requirements are identified. They are called MSGs (maximum-scannable-groups). In this paper, an enlarged-MSG (E-MSG) is proposed to further expand the MSG concept and thus to obtain more improvement in disk throughput. By removing some excess constraints on MSG, E-MSG merges several MSGs as a new scannable group. Experiment results show that the E-MSG scheme is better than both SCAN-EDF and MSG in the disk throughput obtained.