- Full text PDF available (7)
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA increases the flexibility and func-tionalities of applications. There exists a large number of references to this particular issue in the literature. However, the use of DSA has been… (More)
SUMMARY This paper describes the design criteria and implementation details of a dynamic storage allocator for real-time systems. The main requirements that have to be considered when designing a new allocator are concerned with temporal and spatial constraints. The proposed algorithm, called TLSF (two-level segregated fit), has an asymptotic constant cost,… (More)
Based on a previous proposal of a framework of real-time utilities in Ada 2005, this paper deals with the extension of that framework to include operating modes and mode changes.
The inclusion of dynamic ceiling priorities in Ada is a topic of discussion in the Real-Time Ada community. Several approaches have been discussed in previous editions of the International Real-Time Ada Workshop, which have allowed to identify the problems associated with this issue, mainly the interaction of such feature with tasking, consistency and… (More)
Fixed-priority scheduling has become a very important approach for implementing real-time systems. Two key aspects of the method are its support for resource management using priority inheritance protocols and its ability to model modes of operation. In this paper, we discuss the impact of mode changes on the immediate inheritance priority ceiling protocol.… (More)
In this paper we propose an approach for building real-time systems under a combination of requirements: specification and handling of operating modes and mode changes; implementation on top of a multiprocessor platform; integration of both aspects within a common framework; and connection with schedulability analysis procedures. The proposed approach uses… (More)