Guaranteed response times in a distributed hard-real-time environment
IEEE Transactions on Software Engineering
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling
IEEE Transactions on Software Engineering
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Using the observer design pattern for implementation of data flow analyses
Proceedings of the 2002 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Scalability of dynamic storage allocation algorithms
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
A constant-time dynamic storage allocator for real-time systems
Real-Time Systems
Mixed virtual/real prototypes for incremental system design – a proof of concept
SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
| Hi-index | 0.00 |
The conflict between the performance demands of real-time systems and the shared-resource needs of high-level languages (Ada in particular) is examined. Shared memory requires carefully designed concurrency control, but the traditional approach, which is to embed the entire allocate-release implementation code in critical sections, is unsuitable for real-time applications because it results in excessively high response time. The design and performance of three memory-management systems for real-time applications are evaluated, and it is shown that one system, an optimized optimistic version, does deliver performance that is acceptable for real-time applications.