Schedulability and performance analysis of the similarity stack protocol
Journal
IEEE Transactions on Computers
Journal Volume
52
Journal Issue
5
Pages
658-669
Date Issued
2003
Author(s)
Mok, A.K.
Abstract
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.
SDGs
Type
journal article