A Scheduling Algorithm for Long Duration Transaction Based on Strong Orderability Criterion

Wang Jinling, Jin Beihong, and Li Jing

Journal of Computer Research and Development > 2005 > 42(8): 1355-1361.

Wang Jinling, Jin Beihong, and Li Jing. A Scheduling Algorithm for Long Duration Transaction Based on Strong Orderability Criterion[J]. Journal of Computer Research and Development, 2005, 42(8): 1355-1361.

Citation:

PDF (370 KB)

A Scheduling Algorithm for Long Duration Transaction Based on Strong Orderability Criterion

Wang Jinling, Jin Beihong, and Li Jing

(Technology Center of Software Engineering, Institute of Software, Chinese Academy of Sciences, Beijing 100080)

More Information

Published Date: August 14, 2005

Graphical Abstract

Abstract

Abstract

Existing concurrency control mechanisms for long duration transactions need human's participation when solving concurrent conflicts or performing rollback, and the cost for rolling back a long duration transaction is high. In this paper, a new correctness criterion—The strong orderability criterion for the concurrency control of long duration transactions is defined, and a scheduling algorithm based on the criterion is proposed. The algorithm makes use of the semantic knowledge of transactions to provide a higher degree of concurrency for long duration transactions. At the same time, the recovery mechanism of long duration transactions is greatly simplified, and the cost for rollback is decreased. Simulation results show that the algorithm has sound concurrency management ability and recovery efficiency.
- long duration transaction,
- concurrency control,
- recovery,
- scheduling algorithm

FullText(HTML)

References (0)

[1]	Yang Yong, Meng Xiangru, Kang Qiaoyan, Chen Gang. Dynamic Service Function Chain Migration Method Based on Resource Requirements Prediction[J]. Journal of Computer Research and Development, 2023, 60(5): 1151-1163. DOI: 10.7544/issn1000-1239.202111206
[2]	Wang Kai, Hou Zifeng. An Idle Virtual CPU Scheduling Algorithm on Xen Virtual Machines[J]. Journal of Computer Research and Development, 2013, 50(11): 2429-2435.
[3]	Kang Guosheng, Liu Jianxun, Tang Mingdong, Liu Xiaoqing. Global Optimal Web Service Selection Model for Multiple Service Requests[J]. Journal of Computer Research and Development, 2013, 50(7): 1524-1533.
[4]	Wang Kai, Hou Zifeng. A Relaxed Co-Scheduling Method of Virtual CPUs on Xen Virtual Machines[J]. Journal of Computer Research and Development, 2012, 49(1): 118-127.
[5]	Wang Xianzhi, Wang Zhongjie, Xu Xiaofei, Liu Ying. A Service Composition Method for Tradeoff Between Satisfactions of Multiple Requirements[J]. Journal of Computer Research and Development, 2011, 48(4): 627-637.
[6]	Li Ji, Zeng Huaxin, Xu Dengyuan. A New Service Guaranteed Scheduling Policy for Buffered Crossbar Switches[J]. Journal of Computer Research and Development, 2007, 44(11): 1873-1880.
[7]	Ding Ding, Luo Siwei, and Gao Zhan. An Object-Adjustable Heuristic Scheduling Strategy in Grid Environments[J]. Journal of Computer Research and Development, 2007, 44(9): 1572-1578.
[8]	Li Zhong, Wang Gang, Liu Jing. Quality of Service Aware Dynamic Priority Scheduling Scheme for the Mixed Class Multimedia Workloads in the Storage Systems[J]. Journal of Computer Research and Development, 2006, 43(11): 2027-2032.
[9]	Liu Anfeng, Chen Zhigang, Long Guoping, and Zeng Zhiwen. A Resource Optimizing Scheduling Algorithm of Differentiated Service of Double Minimum Balance in Web Clusters[J]. Journal of Computer Research and Development, 2005, 42(11): 1969-1976.
[10]	Xu Mingwei, Hu Chunming, Liu Xudong, and Ma Dianfu. Research and Implementation of Web Service Differentiated QoS[J]. Journal of Computer Research and Development, 2005, 42(4): 669-675.