An inter-group seek-optimizing disk scheduling algorithm for real-time system

作者：Yao, Nianmin^*; Chen, Jinzhong; Li, Ang

来源：Journal of Computational Information Systems, 2012, 8(18): 7579-7586.

• Data throughput
• Disk scheduling algorithms
• Earliest deadline first
• GSR
• High throughput
• Initial schedule
• Inter-group
• Local groups
• Multimedia applications
• Real time scheduling
• Realtime multimedia
• TGGSR
• Time constraints

Disk scheduling algorithm plays an important role in the real-time multimedia applications. Earliestdeadline-first (EDF) meets time constraints, but it does not achieve high throughput. By contrast, SCAN can yield significant throughput, but may miss the deadline. SCAN-EDF and Reschedulable-Group- SCAN (RG-SCAN) resolve the real-time scheduling problem by rescheduling tasks in a local group, and these scheduling algorithms are locally seek-optimizing scheme. Globally seek-optimizing rescheduling (GSR) scheme reschedule task to anywhere in the input schedule to improve data throughput. However, GSR does not consider initial schedule generation and the track difference between the last task of current scan-group and the first task of the next scan-group. In this paper, we have proposed the Track Group GSR (TGGSR) algorithm based on GSR algorithm. The TGGSR algorithmfinds a rescheduled result where GSR may fail. In addition, it is more Efficient than GSR in terms of response time. Experimental results indicate that the data throughput of TGGSR is 1.2 times of GSR, 1.25 times of RG-SCAN, and 1.27 times of DM-SCAN.

• 出版日期2012
• 单位哈尔滨工程大学