Title :
A characterization of re-execution costs for real-time abort-oriented protocols
Author_Institution :
Dept. of Inf. Manage., Chang Jung Univ., Tainan, Taiwan
Abstract :
Abort-oriented protocols for hard real-time systems were proposed mainly to cope with the situation when block-at-most-once property provided by pure locking protocols such as priority ceiling protocol and stack resource protocol is incapable of scheduling a given transaction set due to excessive blocking. The underlying principle is to abort a transaction if it causes other higher-priority transactions unschedulable due to excessive blocking. By aborting the lower-priority transaction, what we gain is reduced blocking for higher-priority transactions, but what we must pay for is to re-execute the aborted lower-priority transaction. To guarantee schedulability for the whole transaction set, we must put an upper bound on the re-execution costs. In this paper, we use a tree-structured transaction framework adapted from Chakravarthy et al. (1998) and we roll back aborted transactions partially in an attempt to more accurately characterize and to reduce re-execution costs for aborted transactions
Keywords :
concurrency control; distributed databases; protocols; real-time systems; scheduling; abort-oriented protocols; concurrency control; database; hasaccessed trees; higher-priority transactions; locking protocols; lower-priority transaction; priority ceiling protocol; real-time systems; reexecution costs; scheduling; tree-structured transaction; Concurrency control; Costs; Councils; Information management; Processor scheduling; Protocols; Real time systems; Testing; Transaction databases; Upper bound;
Conference_Titel :
Real-Time Computing Systems and Applications, 1998. Proceedings. Fifth International Conference on
Conference_Location :
Hiroshima
Print_ISBN :
0-8186-9209-X
DOI :
10.1109/RTCSA.1998.726429