A. Burns
Abstract
Lock-based resource sharing protocols for single processor systems are well understood and supported in programming languages such as Ada. In contrast, multiprocessor resource sharing protocols are less well developed with no agreed best practice. In this paper we consider what the next version of Ada should support. Two proposals are considered, one requiring a minor change to the current language, another requiring a more substantial change.
- A. Block, H. Leontyev, B. B. Brandenburg, and J. H. Anderson. A flexible real-time locking protocol for multiprocessors. In 13th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA '07, pages 47--56. IEEE Computer Society, 2007. Google Scholar
Digital Library
- B.B. Brandenburg and J.H. Anderson. Optimality results for multiprocessor real-time locking. In Real-Time Systems Symposium (RTSS), pages 49--60, 2010. Google ScholarDigital Library
- B.B. Brandenburg and J.H. Anderson. Real-time resource sharing under cluster scheduling. In Proc. EMSOFT. ACM Press, 2011. Google ScholarDigital Library
- Björn B. Brandenburg. Scheduling and Locking in Multiprocessor Real-Time Operating Systems. PhD thesis, The University of North Carolina at Chapel Hill, 2011.Google Scholar
- A. Burns and A.J. Wellings. Dispatching domains for multiprocessor platforms and their representation in Ada. In J. Real and T. Vardanega, editors, Proc. of Reliable Software Technologies - Ada-Europe 2010, volume LNCS 6106, pages 41--53. Springer, 2010. Google ScholarDigital Library
- A. Burns and A.J. Wellings. A schedulability compatible multiprocessor resource sharing protocol - MrsP. In Under Review, 2013.Google ScholarDigital Library
- R.I. Davis and A. Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys, 43(4):35:1--35:44, 2011. Google ScholarDigital Library
- D. Faggioli, G Lipari, and T. Cucinotta. The multiprocessor bandwidth inheritance protocol. In Proc. of the 22nd Euromicro Conference on Real-Time Systems (ECRTS), pages 90--99, 2010. Google ScholarDigital Library
- P. Gai, G. Lipari, and M. Di Natale. Minimizing memory utilization of real-time task sets in single and multiprocessor systems-on-a-chip. In Proc. 22nd RTSS, pages 73--83, 2001. Google ScholarDigital Library
- S. Lin, A. Burns, and A.J. Wellings. Supporting lock-based multiprocessor resource sharing protocols in realtime programming languages. Provisionally accepted for Concurrency and Computation: Practice and Experience, 2012.Google Scholar
- J.P. Lozi, G. Thomas, G. Muller, and J. Lawall. The remote core lock (RCL): Can migrating the execution of critical sections to remote cores improve performance? In EuroSys11, 2011.Google Scholar
- R. Rajkumar. Synchronization in Real-Time Systems: A Priority Inheritance Approach. Kluwer Academic Publishers, 1991. Google ScholarDigital Library
- R. Rajkumar, L. Sha, and J.P. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proc. 9th IEEE Real-Time Systems Symposium, pages 259--269, 1988.Google ScholarCross Ref
- R. Rajkumar, L. Sha, and J.P. Lehoczky. Real-time synchronization protocols for shared memory multiprocessors. In Proc. of the 10th International Conference on Distributed Computing, pages 116--125, 1990.Google ScholarCross Ref
- L. Sha, R. Rajkumar, and J.P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronisation. IEEE Transactions on Computers, 39(9):1175--1185, 1990. Google ScholarDigital Library
- H. Takada and K. Sakamura. A novel apporach to multiprogramming multiprocessor synchronization for realtime kernels. In Proc. 18th IEEE Real-Time Systems Symposium, pages 134--143, 1997. Google ScholarDigital Library
Index Terms
- Locking policies for multiprocessor ada
Recommendations
Freedom from Deadlock of Safe Locking Policies
The usual method for preserving the consistency of a database when accessed (read and updated) concurrently by several transactions, is by locking the transactions according to some locking policy; a locking policy that guarantees the preservation of ...
Pre-analysis locking: a safe and deadlock free locking policy
VLDB '85: Proceedings of the 11th international conference on Very Large Data Bases - Volume 11A safe and deadlock free lock policy is introduced, called pre-analysis locking. Pre-analysis locking is based on an efficient geometric algorithm which inserts lock and unlock operations into the transactions. Pre-analysis locking is the first safe and ...
Comments