This paper describes a general model for pre-run-time scheduling of distributed real-time systems that are composed of abstract data types (definable in languages such as Ada, Clu and Modula-2) and abstract data objects (which can be defined in C++, Eiffel and RT Euclid). An architecture model, a programming paradigm, and execution and communication paradigms form the basis for this general model. The model includes absolute timing constraints to represent periodicity and deadlines, relative timing constraints to model several kinds of timed precedence relations and synchronization requirements, independency constraints to capture non-determinism of conditionals and repetitions, and consistency constraints to enforce consistent use of resources. In this paper, the model is formalized to obtain a mathematical foundation on which assignment (Verhoosel et al. 1993a) and pre-rua-fime scheduling problems (Verhoosel et al. I991, Verhoosel 1992, 1993a, 1993c are defined. Additionally, the model is extended to allow exploitation of parallelism fl'om programs, a technique that can be used during assignment and scheduling for meeting timing constraints.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.