Reliability Comparison of Schedulability Test in Ubiquitous Computing
The development of ubiquitous intelligent has increased the real-time requirements for computing system. If one real-time computation does not complete before its deadline, it is as worse as that the computation is never executed at all. Ineffective computation not only wastes computational resources, but also might bring system overload and collapse. Hence, a schedulability test is necessary to ensure the stability of ubiquitous system. The schedulability test is concerned with determining whether a set of tasks is schedulable on a cluster. Although a number of schedulability tests have been developed, they can not be compared due to distinct test principles. In this paper, we propose a reliability indicator, through which the probability that a random task set succeeds in schedulability test can be evaluated. The larger the probability is, the better the test is. The reliability of two sufficient deadline monotonic tests are compared, and the comparison result is further validated by detailed experiments. Both analysis and experimental results show that the performance discrepancy of schedulability test is determined by a prerequisite pattern. Since this pattern can be deduce by reliability indicator, it may help system designers choose a good schedulability test in advance.
KeywordsUbiquitous Computing Schedulability Test Relative Deadline Aperiodic Task Task Utilization
Unable to display preview. Download preview PDF.
- 3.Masrur, A., Chakraborty, S., Färber, G.: Constant-time admission control for deadline monotonic tasks. In: Proceedings of the Conference on Design, Automation and Test in Europe (DATE), pp. 220–225 (2010)Google Scholar
- 12.Lehoczky, J.P.: Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the 11th Real-Time Systems Symposium, pp. 201–209 (1990)Google Scholar
- 13.Sjodin, M., Hansson, H.: Improved response-time analysis calculations. In: Proceedings of IEEE Real-Time Systems Symposium, pp. 399–408 (1998)Google Scholar
- 14.Abdelzaher, T.F., Lu, C.: Schedulability analysis and utilization bounds for highly scalable real-time service. In: Proceedings of IEEE Real Time Technology and Applications Symposium, pp. 15–25 (2001)Google Scholar
- 17.Fisher, N., Baruah, S.K.: A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines. Journal of Embedded Computing 2(3-4), 291–299 (2006)Google Scholar
- 18.Teng, F., Yu, L., Magoules, F.: SimMapReduce: a simulator for modeling MapReduce framework. In: Proceedings of International Conference on Multimedia and Ubiquitous Engineering, Loutraki, Greece, pp. 277–282 (June 2011)Google Scholar