Based on Regularity District Scheduling of Resources for Embedded Systems

Embedded computers have become pervasive and complex. This approach entails at least three serious consequences: firstly, profligate and rigid usage of resources necessitated by the binding of subsystems to hardware platforms; secondly, significantly more difficult system integration because individually developed and tested systems are not guaranteed to work in combination; thirdly, the lack of higher-level system control because conceptually indivisible functions are isolated on the hardware level. These problems have caused not only financial loss such as unusable systems due to the high cost of unjustified resource redundancy and integration failures, but also the loss of human lives as exemplified by a number of fatal accidents induced by the third problem. It is critical that system engineers have a solid basis for addressing these fundamental design problems in large-scale real-time embedded systems. Towards this end, in this dissertation we introduce the notion of a Real-Time Virtual Resource (RTVR) which operates at a fraction of the rate of the shared physical resource and whose rate of operation varies with time but is bounded. Tasks within the same task group are scheduled by a task level scheduler that is specialized to the real-time requirements of the tasks in the group. The scheduling problems on both task level and resource level are analyzed.

[1]  Sang Hyuk Son,et al.  New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems , 1995, IEEE Trans. Computers.

[2]  Francis Y. L. Chin,et al.  General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction , 1992, IEEE Trans. Computers.

[3]  Christopher D. Gill,et al.  Group scheduling in systems software , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[4]  Sang Hyuk Son,et al.  Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems , 1994 .

[5]  Riccardo Bettati,et al.  End-to-end scheduling to meet deadlines in distributed systems , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[6]  Douglas C. Schmidt,et al.  Flexible scheduling in middleware for distributed rate-based real-time applications , 2002 .

[7]  Francis Y. L. Chin,et al.  Schedulers for larger classes of pinwheel instances , 1993, Algorithmica.

[8]  Alan Burns,et al.  Effective Analysis for Engineering Real-Time Fixed Priority Schedulers , 1995, IEEE Trans. Software Eng..

[9]  Marco Caccamo,et al.  Aperiodic servers with resource constraints , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[10]  Giuseppe Lipari,et al.  Sharing resources among periodic and aperiodic tasks with dynamic deadlines , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[11]  Lise Getoor,et al.  Collective Classification in Network Data , 2008, AI Mag..