On Improving the Schedulability of Real-Time Data-Intensive Applications:Preemptibility versus Non-Preemptibility

Abstract

This paper proposes a class of simple and efficient concurrency control algorithms based on the notion of compatibility. We consider a schedulability analysis model to better manage the schedulability of a transaction system. The schedulability of a transaction system is improved by aborting excessive blocking from lower priority transactions and, at the same time, blocking excessive aborting from highly priority transactions. We consider the criticality of transactions and provide a uniform mechanism to tune up the tolerable blocking time of transactions. The strengths of this work is demonstrated by improving the worstcase schedulability of an avionics example [16] and a satellite control system[5].