ACM Transactions on Programming Languages and Systems (TOPLAS)
Transactional memory: architectural support for lock-free data structures
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Priority ceiling protocol in Ada
Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada
Monitors and Concurrent Pascal: a personal history
History of programming languages---II
Transactional memory should be an implementation technique, not a programming interface
HotPar'09 Proceedings of the First USENIX conference on Hot topics in parallelism
| Hi-index | 0.00 |
The Ravenscar profile defined by Ada prevents deadlock and starvation of conforming Ada programs on monoprocessor systems, allowing for better reasoning about real-time behavior. While defined in terms of mutual exclusion, we show Ada's protected types are general enough to allow an enhanced compiler to automatically generate appropriate lock-free synchronization code even on multiprocessors for some basic datastructures. In the context of real-time systems this allows for a more deterministic real-time response and improves the ability to statically analyze generated code.