The contraction of control implementations
Computer Languages
Reference Manual for the ADA Programming Language
Reference Manual for the ADA Programming Language
The architecture of concurrent programs
The architecture of concurrent programs
A less dynamic memory allocation scheme for algol-like languages
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
| Hi-index | 0.00 |
The efficient implementation of high level languages which support concurrency is imperative, particularly in such application areas as embedded real-time systems. Various storage management schemes have been proposed for the implementation concurrency. In this work, a methodology is presented for evaluating the performance of these schemes including the standard heap, Berryheap, cactus stack and quantized heap when used for Ada programs. The methodology involves the generation of workload traces from an executing program and the use of simulators of the alternative storage management schemes to produce measures of the performances of the schemes. The performance evaluation metrics used are space, time and the space-time product.