Title
A quantification of aborting effect for real-time data accesses
Abstract
This paper proposes a generic framework to integrate real-time scheduling algorithms, conventional concurrency control algorithms, and aborting algorithms. The schedulability of a transaction system is improved by aborting excessive blocking from lower priority transactions. A schedulability analysis model is proposed to better manage the schedulability of a transaction system.
Year
DOI
Venue
2003
10.1109/TC.2003.1197132
IEEE Trans. Computers
Keywords
Field
DocType
real-time data access,schedulability,database management systems,real-time scheduling algorithm,processor scheduling,transaction system,aborting algorithms,concurrency control,concurrency control algorithms,aborting effect,conventional concurrency control algorithm,transaction processing,real-time data accesses,excessive blocking aborting,real-time scheduling algorithms,lower priority transaction,generic framework,aborting algorithm,real-time systems,query processing,schedulability analysis model,measurement,real time data,computer science,scheduling algorithm,priority inversion,real time systems,throughput
Concurrency control algorithms,Transaction processing,Real-time data,Concurrency control,Scheduling (computing),Computer science,Parallel computing,Real-time computing,Priority inversion,Processor scheduling,Database transaction,Distributed computing
Journal
Volume
Issue
ISSN
52
5
0018-9340
Citations 
PageRank 
References 
5
0.43
11
Authors
3
Name
Order
Citations
PageRank
Ming-Chung Liang1161.47
Tei-Wei Kuo23203326.35
Lihchyun Shu313017.32