Enhanced virtual release advancing algorithm for real-time task scheduling
| Autor: | D. Duy, K. Tanaka |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Journal of Information and Telecommunication, Vol 2, Iss 3, Pp 246-264 (2018) |
| Druh dokumentu: | article |
| ISSN: | 2475-1839 2475-1847 24751839 |
| DOI: | 10.1080/24751839.2018.1423789 |
| Popis: | In real-time task scheduling, response time and time complexity are two of important requirements that draw many attentions. Virtual release advancing (VRA) [Tanaka, K. (2015, June). Virtual release advancing for earlier deadlines. ACM SIGBED Review, 12(3), 28–31] is an effective technique for shorter response times in the Earliest Deadline First scheduling [Liu, C. L., & Layland, J. W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery, 20(1), 46–61], but not adaptive to precise systems due to its high time complexity. In order to mitigate the time complexity, a new technique, called enhanced VRA, is presented in this paper. Applied to the Total Bandwidth Server context, the enhanced technique significantly improves the time complexity while guaranteeing the responsiveness and schedulability. The technique is implemented on an ITRON real-time operating system running on an ARM Cortex-A9 processing core with a field programmable gate array. With supporting of accelerator hardware, the new algorithm shows that the maximum additional runtime overhead per tick is reduced by up to 30% compared with that of the original (software) VRA. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|