Schedulability and Performance Analysis of the Similarity Stack Protocol

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)658-669
Journal / PublicationIEEE Transactions on Computers
Volume52
Issue number5
Publication statusPublished - May 2003
Externally publishedYes

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.

Research Area(s)

  • Δ-serializability, Concurrency control, Data similarity, Distributed data management, Process scheduling, Real-time data access, Real-time databases