A Hierarchical Scheme for Open System Environments Review

Article Preview

Abstract:

This paper focus on hierarchical scheduling for real-time applications for open embedded system environments constructed by the total bandwidth server, according to its algorithms, when a job at the head of the server's ready queue completes, the server budget is replenished immediately if the ready queue is not empty. This paper gives some examples to the solutions proposed by Deng et al for a two-level hierarchical scheduling model in which the global level of the system is earliest deadline first, and the local scheduler could be any algorithm. The scheduling algorithms and schedulability analysis for the tasks are reviewed in an open system where the applications could be modeled as executing on a slow processor.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

181-184

Citation:

Online since:

June 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Z. Deng, J.W.S. Liu, J. Sun. A Scheme for Scheduling Hard Real-Time Applications in Open System Environment. Proceedings of 9th Euromicro Workshop on Real-Time Systems, pp.191-199, (1997).

DOI: 10.1109/emwrts.1997.613785

Google Scholar

[2] L. Abeni, G. Buttazzo. Integrating Multimedia Applications in Hard Real-Time Systems. Proceedings 19th IEEE Real-Time Systems Symposium, pp.4-13, (1998).

DOI: 10.1109/real.1998.739726

Google Scholar

[3] L. Abeni, G. Lipari, G. Buttazzo. Constant Bandwidth vs Proportional Share Resource Allocation. IEEE International Conference on Multimedia Computing and Systems, pp.107-111, (1999).

DOI: 10.1109/mmcs.1999.778154

Google Scholar

[4] G. Buttazzo, E. Bini. Optimal Dimensioning of a Constant Bandwidth Server. Proceedings 27th IEEE International Real-Time Systems Symposium, pp.169-177, (2006).

DOI: 10.1109/rtss.2006.31

Google Scholar

[5] G. Lipari, S. Baruah. Greedy Reclaimation of Unused Bandwidth in Constant-Bandwidth Servers. Proceedings of Euromicro Conference on Real-Time Systems, pp.193-200, (2000).

DOI: 10.1109/emrts.2000.854007

Google Scholar

[6] G. Lipari, S. Baruah. A Hierarchical Extension to the Constant Bandwidth Server Framework. Proceedings of the 7th IEEE Real-Time Technology and Applications Symposium, pp.26-35, (2001).

DOI: 10.1109/rttas.2001.929863

Google Scholar

[7] M. Spuri, G. Buttazzo. Scheduling Aperiodic Tasks in Dynamic Priority Systems. Real-Time Systems, 10(2): 179-210, (1996).

DOI: 10.1007/bf00360340

Google Scholar

[8] Z. Deng, J.W.S. Liu. Scheduling Real-Time Applications in an Open Environment. Proceedings IEEE 18th Real-Time Systems Symposium, pp.308-319, (1997).

DOI: 10.1109/real.1997.641292

Google Scholar