Software transactional memory for dynamic-sized data structures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Toward a theory of transactional contention managers
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
The art of multiprocessor programming
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Composable memory transactions
Communications of the ACM - Designing games with a purpose
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
ChronOS Linux: a best-effort real-time multiprocessor Linux kernel
Proceedings of the 48th Design Automation Conference
STM concurrency control for embedded real-time software with tighter time bounds
Proceedings of the 49th Annual Design Automation Conference
STM concurrency control for multicore embedded real-time software: time bounds and tradeoffs
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
We consider software transactional memory (STM) concurrency control for embedded multicore real-time software, and present a novel contention manager for resolving transactional conflicts, called FBLT. We upper bound transactional retries and task response times under FBLT, and identify when FBLT has better real-time schedulability than the previous best contention manager, PNF. Our implementation in the Rochester STM framework reveals that FBLT yields shorter or comparable retry costs than competitor methods.