According to the safety-critical Java specification, priority ceiling emulation is a requirement for implementations, as it has preferable properties, such as avoiding priority inversion and being deadlock free on uni-core systems. In this paper we explore our hardware supported implementation of priority ceiling emulation on the multicore Java optimized processor, and compare it to the existing hardware locks on the Java optimized processor. We find that the additional overhead for priority ceiling emulation on a multicore processor is several times higher than simpler, non-premptive locks, mainly due to slow access to shared memory. We also find that PCE is mostly viable with large critical sections.
|Title of host publication||Proceedings of the 18th IEEE International Symposium on Real-Time Distributed Computing (ISORC 2015)|
|Publication status||Published - 2015|
|Event||18th IEEE International Symposium on Real-time Computing - Auckland, New Zealand|
Duration: 13 Apr 2015 → 17 Apr 2015
Conference number: 18
|Conference||18th IEEE International Symposium on Real-time Computing|
|Period||13/04/2015 → 17/04/2015|