A Read-Write-Validate approach to optimistic concurrency control for energy efficiency of resource-constrained systems

Modern smartphones feature multiple applications which access shared data on the solid state storage within the device. As applications become more complex, contention over this memory resource is becoming an issue. This leads to increased battery drain as the applications are forced to touch the solid state device repeatedly after failing to retrieve or store data due to contention from other applications. We describe an optimistic concurrency control algorithm, combining a novel Read-Write-Validate phase sequence with virtual execution. The protocol is suitable for governing transactions operating on databases residing on resource-constrained devices. Increasing energy efficiency and reducing latency are primary goals for our algorithm. We show that this is achieved by reducing persistent store access, and satisfy real-time requirements via transaction scheduling that affords greater determinism.

[1]  Miron Livny,et al.  Concurrency control performance modeling: alternatives and implications , 1987, TODS.

[2]  Thki Hder,et al.  OBSERVATIONS ON OPTIMISTIC CONCURRENCY CONTROL SCHEMES , 2003 .

[3]  Cory C. Beard,et al.  Analytical models for understanding space, backoff, and flow correlation in CSMA wireless networks , 2012, Wireless Networks.

[4]  Tei-Wei Kuo,et al.  Concurrency control in mobile distributed real-time database systems , 2000, Inf. Syst..

[5]  John A. Stankovic,et al.  Concurrency Control in Real-Time Database System: Optimistic Scheme vs. Two-Phase Locking , 1990 .

[6]  Daniel Gómez Ferro,et al.  A critique of snapshot isolation , 2012, EuroSys '12.

[7]  Alexander Thomasian,et al.  Access invariance and its use in high contention environments , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[8]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[9]  Sungwon Jung,et al.  An energy-efficient mobile transaction processing method using random back-off in wireless broadcast environments , 2009, J. Syst. Softw..

[10]  Miron Livny,et al.  Earliest deadline scheduling for real-time database systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[11]  Sang Hyuk Son,et al.  Using dynamic adjustment of serialization order for real-time database systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[12]  Cory C. Beard,et al.  Competition, cooperation, and optimization in Multi-Hop CSMA networks , 2011, PE-WASUN '11.

[13]  Juhnyoung Lee Concurrency control algorithms for real-time database systems , 1994 .

[14]  Antti-Pekka Tuovinen,et al.  Feature Interaction Control on Smartphones , 2007, 2007 International Symposium on Industrial Embedded Systems.

[15]  Sungwon Jung,et al.  A concurrency control scheme for mobile transactions in broadcast disk environments , 2009, Data Knowl. Eng..

[16]  Tei-Wei Kuo,et al.  Efficient validation of mobile transactions in wireless environments , 2004, J. Syst. Softw..

[17]  Juhnyong Lee,et al.  Precise Serialization for Optimistic Concurrency Control , 1999, Data Knowl. Eng..

[18]  Graham Morgan,et al.  Later Validation/Earlier Write: Concurrency Control for Resource-Constrained Systems with Real-Time Properties , 2011, 2011 IEEE 30th Symposium on Reliable Distributed Systems Workshops.

[19]  Stefan Manegold,et al.  Understanding, modeling, and improving main-memory database performance , 2002 .

[20]  Laurence T. Yang,et al.  A Real-Time Flash Translation Layer for NAND Flash Memory Storage Systems , 2012, IEEE Transactions on Multi-Scale Computing Systems.

[21]  Philip S. Yu,et al.  Analysis of Hybrid Concurrency Control Schemes For a High Data Contention Environment , 1992, IEEE Trans. Software Eng..

[22]  Yuelong Zhao,et al.  Concurrency control in mobile distributed real-time database systems , 2009, J. Parallel Distributed Comput..

[23]  Krithi Ramamritham,et al.  Efficient concurrency control for broadcast environments , 1999, SIGMOD '99.