Issue No.05 - May (2003 vol.52)
Tei-Wei Kuo , IEEE
Aloysius K. Mok , IEEE
<p><b>Abstract</b>—We propose a class of real-time data access protocols called SSP (Similarity Stack Protocol). The correctness of SSP schedules is justified by the concept of similarity which allows different but sufficiently timely data to be used in a computation without adversely affecting the outcome. SSP schedules are deadlock-free, subject to limited blocking, and do not use locks. We give a schedulability bound for SSP and also report simulation results which show that SSP is especially useful for scheduling real-time data access on multiprocessor systems. Finally, we present a variation of SSP which can be implemented in an autonomous fashion in the sense that scheduling decisions can be made with local information only.</p>
Real-time databases, concurrency control, real-time data access, data similarity, \Delta-serializability, distributed data management, process scheduling.
Tei-Wei Kuo, Aloysius K. Mok, "Schedulability and Performance Analysis of the Similarity Stack Protocol", IEEE Transactions on Computers, vol.52, no. 5, pp. 658-669, May 2003, doi:10.1109/TC.2003.1197131