Scheduling and admission testing for jitter constrained periodic threads
In conclusion, we have briefly presented admission tests that ensure that a run time EDF algorithm will be able to maintain the required semantics of jitter constrained threads. The second test involves more admission time overhead, but is able to admit a wider range of candidate thread sets. In the full version of this paper , the tests are derived fully and proofs are given. In addition, the (minimal) necessary adaptations to the run time scheduler are discussed. We also generalise our tests to accommodate fixed priority scheduling schemes.
Unable to display preview. Download preview PDF.
- 1.Coulson, G., Campbell, A., Robin, P., Blair, G. S., Papathomas, M. and D. Shepherd, “The Design of a QoS Controlled ATM Based Communications System in Chorus”, To be published in IEEE JSAC, Special Issue on ATM Local Area Networks, 1994.Google Scholar
- 2.Liu, C. L. and Layland, J. W., “Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment”, Journal of the Association for Computing Machinery, Vol. 20, No. 1, pp 46–61, February 1973.Google Scholar
- 3.Mauthe, A., Schultz, W. and Steinmetz, R., “Inside the Heidelberg Multimedia Operating System Support: Real-Time Processing of Continuous Media in OS/2”, Technical Report No. 43.9214, IBM European Networking Center, Tiergartenstrasse 8, D-6900 Heidelberg 1, 1992.Google Scholar
- 4.Kuo, T.-W. and Mok, A. K., “Load Adjustment in Adaptive Real-Time Systems”, Proc. 12th IEEE Real Time System Symposium, 1991.Google Scholar
- 5.Mauthe, A and G. Coulson, “Scheduling and Admission Testing for Jitter Constrained Periodic Threads”, Internal Report MPG-95-04, Distributed Multimedia Research Group, Department of Computing, Lancaster University, Lancaster LA1 4YR, UK, January 1995.Google Scholar