Abstract
In this paper, a new real-time disk scheduling algorithm called BFI (bestfitinsertion) is proposed. Notably, different from the conventional realtime problem, the service time of a disk request depends on its schedule result. As the service time is not a constant value, it is time-consuming to verify the feasibility of a schedule. In this paper, we introduce a temporal parameter called maximum tardiness. With the help of maximum tardiness, we can verify the improvement of an insertion test within a constant time. We have evaluated and implemented our proposed algorithm on operating systems. Experiments show that the proposed algorithm can support more requests and can achieve higher disk throughput than that of the conventional approach.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, D.P., Osawa, Y., Govindan, R.: Real-Time Disk Storage and Retrieval of Digital Audio/Video Data. Tech. Report. Univ. of California, Berkeley, CS (1991)
Anderson, D.P., Osawa, Y., Govindan, R.: A File System for Continuous Media. ACM Trans. Computer Systems. 4 (1992) 311–337
Anderson, D.P.: Metascheduling for Continuous Media. ACM Trans. Computer Systems. 3 (1993) 226–252
Rangan, P.V., Vin, H.M.: Designing File Systems for Digital Video and Audio. Proc. ACM Symp. Operating Systems. (1991) 81–94
Gemmell, DJ., Christodoulakis, S.: Principles of Delay Sensitive Multimedia Data Storage and Retrieval. ACM Trans. Information Systems. 1 (1992) 51–90
Gemmell, D.J., Han, J.: Multimedia Network File Servers: Multichannel Delay Sensitive Data Retrieval. Springer/ACM Multimedia Systems. 6 (1994) 240–252
Vin, H.M., Rangan, P.V.: Designing File Systems for Digital Video and Audio. Proc. ACM Symp. Operating System Principles. (1991) 81–94
Lougher, P., Shepherd, D.: The Design of a Storage Server for Continuous Media. The Computer Journal. 1 (1993) 32–42
Rangan, P.V., Vin, H.M.: Efficient Storage Techniques for Digital Continuous Multimedia. IEEE Trans. Knowledge and Data Eng. 4 (1993) 564–573
Gemmell, D.J., Vin, H.M., Kandlur, D.D., Rangan, P.V., Rowe, L.A.: Multimedia Storage Servers: a Tutorial. IEEE Computers. May. (1995) 40–49
Lin, T.H., Tarng, W.: Scheduling Periodic and Aperiodic Tasks in Hard Real-Time Computing Systems. Proc. SIMMetrics Conf. (1991) 31–38
Chen, M., Kandlur, D.D., Yu, P.S.: Optimization of the Grouped Sweeping Scheduling (GSS) with Heterogeneous Multimedia Streams. Proc. ACM Multimedia Conf. (1993)235–242
Lehoczky, J.P.: Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines. Proc. Real-Time Systems Symp. (1990) 201–212
Yee, J., Varaiya, P.: Disk Scheduling Policies for Real-Time Multimedia Applications. Tech. Report, Univ. of California, Berkeley, Dept. of Computer Science (1991)
Reddy, A.L.N., Wyllie, J.: Disk Scheduling in a Multimedia I/O System. Proc. ACM Multimedia Conf. (1993) 225–233
Reddy, A.L.N., Wyllie, J.: I/O Issues in a Multimedia System. IEEE Comp. March (1994) 69–74
Jeffay, K., Stanat, D.F., Martel, C.U.: On Nonpreemptive Scheduling of Periodic and Sporadic Tasks. Proc. of Real-Time Systems Symp. (1991) 129–139
Peterson, J.L., Silberschatz, A.: Operating System Concepts, 2nd Edition, Addison-Wesley (1985)
Stankovic, J.A., Buttazzo, G.C.: Implications of Classical Scheduling Results for Real-Time Systems. IEEE Computer. June (1995) 16–25
Ruemmler, C, Wilkes, J.: An Introduction to Disk Drive Modeling. IEEE Comp. March (1994) 16–28
King, R.P.: Disk Arm Movement in Anticipation of Future Requests. ACM Trans. Computer Systems. 3 (1990) 214–229
Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of ACM. (1973) 46–61
Dan, A., Sitaram, D., Shahabuddin, P.: Scheduling Policies for an On-Demand Video Server with Batching. Proc. ACM Multimedia Conf. (1994) 15–22
Terry, D.B., Swinehart, D.C.: Managing Stored Voice in the Etherphone System. ACM Trans. Computer Systems. 1 (1988) 3–27
Mok, A.: Fundamental Design Problems for the Hard Real-Time Environment. MIT Ph.D. Dissertation, Cambridge, MA. (1983)
Patterson, D.A., Gibson, G., Katz, R.H.: A Case for Redundant Arrays of Inexpensive Disks (RAID). Proc. ACM SIGMOD Conf. (1988) 109–116
Chen, M., Kandlur, D.D., Yu, P.S.: Support for Fully Interactive Playout in a Disk-Array-Based Video Server. Proc. ACM Multimedia Conf. (1994)
Shih, W.K., Liu, J.W.S., Liu, C.L.: Modified Rate Monotone Algorithm for Scheduling Periodic Jobs with Deferred Deadlines. Tech. Report, Univ. of Illinois, Urbana-Champaign, Dept. of CS. (1992)
Kim, M.Y.: Synchronized Disk Interleaving. IEEE Trans. Comp. 11 (1986) 978–988
Shih, W.K., Liu, J.W.S.: On-Line Scheduling of Imprecise Computations to Minimize Error. Proc. of Real-Time Systems Symp. (1992) 280–289
Chang, R.I., Chen, M., Ho, J.M., Ko, M.T.: Optimizations of Stored VBR Video Transmission on CBR Channel. Proc. SPIE Performance & Control of Network Systems. (1997) 382–392
Wang, Y.C., Tsao, S.L., Chang, R.I., Chen, M., Ho, J.M., Ko, M.T.: A Fast Data Placement Scheme for Video Server with Zoned-Disks. Proc. SPIE MM Storage & Archiving Systems. (1997) 92–102
Chang, R.I.: Real-Time Disk Scheduling in Multimedia Systems.
Gemmell, D.J., Beaton, R.J., Han, J., Christodoulakis, S.: Real-Time Delay Sensitive Multimedia in a Disk-Based Environment. IEEE Multimedia. Fall (1994)
Sahu, S., Zhang, Z., Kurose. J., Towsley, D.: On the Efficient Retrieval of VBR Video in a Multimedia Server. Proc. Intl. Conf. on Multimedia Computing Systems. (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, R.I., Shin, WK., Chang, RC. (1998). A new real-time disk scheduling algorithm and its application to distributed multimedia storage systems. In: Plagemann, T., Goebel, V. (eds) Interactive Distributed Multimedia Systems and Telecommunication Services. IDMS 1998. Lecture Notes in Computer Science, vol 1483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055325
Download citation
DOI: https://doi.org/10.1007/BFb0055325
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64955-7
Online ISBN: 978-3-540-49914-5
eBook Packages: Springer Book Archive