Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling

suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the real-time disk scheduling problem to balance the trade-off between satisfying real-time constraints and minimizing the disk service time is considered. It is an interesting and practical problem for real-time storage management. Real-time disk scheduling is important to multimedia systems support for digital audio and video. In these years, various approaches are presented to use the seekoptimizing scheme to improve the disk throughput of a real-time guaranteed schedule. However, as these conventional approaches apply SCAN only to the requests with the same deadline or within the same constant-sized group, their improvements are limited. In this paper, we introduce the DM-SCAN (deadlinemodification-SCAN) algorithm with an idea of MSG (maximum-scannable-group). The proposed DM-SCAN method can apply SCAN to MSG it...

• Type: Conference
• Year: 1998
• Where: RTSS
• Authors: Ray-I Chang, Wei Kuan Shih, Ruei-Chuan Chang
• Keywords: Control Systems, Disk Scheduling Problem, Real-time Disk Scheduling, RTSS 1998, Suitable Disk Layout