This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Concurrent Algorithms for Real-Time Memory Management
September/October 1988 (vol. 5 no. 5)
pp. 10-23

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.

Index Terms:
real-time memory management; performance demands; real-time systems; shared-resource; high-level languages; concurrency control; optimized optimistic version; real-time systems; storage allocation; storage management
Citation:
Ray Ford, "Concurrent Algorithms for Real-Time Memory Management," IEEE Software, vol. 5, no. 5, pp. 10-23, Sept.-Oct. 1988, doi:10.1109/52.7940
Usage of this product signifies your acceptance of the Terms of Use.