|
|||||
|
|
Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems |
|
| Affiliation: | 1. II-Univ. Fed. do Rio Grande do Sul, Caixa Postal 15064, 91501-970 Porto Alegre-RS, Brazil;2. LCMI/DAS-Univ. Fed. de Santa Catarina, Caixa Postal 476, 88040-900 Florianopolis-SC, Brazil;1. Institute of Process Equipment, College of Energy Engineering, Zhejiang University, Hangzhou 310027, PR China;2. SUFA Technology Industry Co., Ltd., CNNC, Suzhou 215129, PR China;3. Hefei General Machinery Research Institute, China National Machinery Industry Co., Ltd., Hefei 230031, PR China;4. State Key Laboratory of Fluid Power and Mechatronic Systems, Zhejiang University, Hangzhou 310027, PR China |
| Abstract: | This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have fixed priorities and hard end-to-end deadlines that are equal to or less than the respective period. We develop a method to transform arbitrary precedence relations into release jitter. By eliminating all precedence relations in the task set one can apply any available schedulability test that is valid for independent task sets. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |