On bounding response times under software transactional memory in distributed multiprocessor real-time systems

We consider multiprocessor distributed real-time systems where concurrency control is managed using software transactional memory (or STM). For such a system, we propose an algorithm to compute an upper bound on the response time.The proposed algorithm can be used to study the behavior of systems where node crash failures are possible. We compare the result of the proposed algorithm to a simulation of the system being studied in order to determine its efficacy. The results of our study indicate that it is possible to provide timeliness guarantees for multiprocessor distributed systems programmed using STM.

• Type: Conference
• Year: 2009
• Where: DATE
• Authors: Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Jensen
• Keywords: DATE 2009, Hardware, Node Crash Failures, Software Transactional Memory, Time.The Proposed Algorithm