Optimistic scheduling algorithm for mobile transactions based on reordering

SungSuk Kim; Chong Sun Hwang; Heonchang Yu; Sang-Geun Lee

doi:10.1007/3-540-44498-x_9

Optimistic scheduling algorithm for mobile transactions based on reordering

SungSuk Kim, Chong Sun Hwang, Heonchang Yu, Sang-Geun Lee

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

In this paper, we propose transaction processing algorithms in the broadcast environment. We take an optimistic approach for mobile transactions because (a) it needs a small number of messages for maintaining transactional consistency, and (b) it can make good use of broadcasting facilities from the servers. The more data conflicts occur, however, the more mobile transactions may be aborted. Thus, we accept reordering technique to reduce the number of aborted transactions; that is, whenever any kind of conflict is found from broadcast information, the system determine the operation orders without violating transactional consistency, not just aborting the mobile transactions unconditionally. The proposed algorithms - O-Post algorithm for update transaction and O-Pre algorithm for read-only transaction - do not need much information from the server while resulting in serializable executions. Finally, we also evaluate the performance behavior through simulation study.

Original language	English
Title of host publication	Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings
Editors	Kian-Lee Tan, Michael J. Franklin, John Chi-Shing Lui
Publisher	Springer Verlag
Pages	105-117
Number of pages	13
ISBN (Print)	3540414541
DOIs	https://doi.org/10.1007/3-540-44498-x_9
Publication status	Published - 2001
Event	2nd International Conference on Mobile Data Management, MDM 2001 - Hong Kong, China Duration: 2001 Jan 8 → 2001 Jan 10

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1987
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	2nd International Conference on Mobile Data Management, MDM 2001
Country/Territory	China
City	Hong Kong
Period	01/1/8 → 01/1/10

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-44498-x_9

Cite this

Kim, S., Hwang, C. S., Yu, H., & Lee, S.-G. (2001). Optimistic scheduling algorithm for mobile transactions based on reordering. In K.-L. Tan, M. J. Franklin, & J. C.-S. Lui (Eds.), Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings (pp. 105-117). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1987). Springer Verlag. https://doi.org/10.1007/3-540-44498-x_9

Optimistic scheduling algorithm for mobile transactions based on reordering. / Kim, SungSuk; Hwang, Chong Sun; Yu, Heonchang et al.
Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings. ed. / Kian-Lee Tan; Michael J. Franklin; John Chi-Shing Lui. Springer Verlag, 2001. p. 105-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1987).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kim, S, Hwang, CS, Yu, H & Lee, S-G 2001, Optimistic scheduling algorithm for mobile transactions based on reordering. in K-L Tan, MJ Franklin & JC-S Lui (eds), Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1987, Springer Verlag, pp. 105-117, 2nd International Conference on Mobile Data Management, MDM 2001, Hong Kong, China, 01/1/8. https://doi.org/10.1007/3-540-44498-x_9

Kim S, Hwang CS, Yu H , Lee SG. Optimistic scheduling algorithm for mobile transactions based on reordering. In Tan KL, Franklin MJ, Lui JCS, editors, Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings. Springer Verlag. 2001. p. 105-117. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44498-x_9

Kim, SungSuk ; Hwang, Chong Sun ; Yu, Heonchang et al. / Optimistic scheduling algorithm for mobile transactions based on reordering. Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings. editor / Kian-Lee Tan ; Michael J. Franklin ; John Chi-Shing Lui. Springer Verlag, 2001. pp. 105-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a0eec63b6fc4487aa915cc56fd9e32ce,

title = "Optimistic scheduling algorithm for mobile transactions based on reordering",

abstract = "In this paper, we propose transaction processing algorithms in the broadcast environment. We take an optimistic approach for mobile transactions because (a) it needs a small number of messages for maintaining transactional consistency, and (b) it can make good use of broadcasting facilities from the servers. The more data conflicts occur, however, the more mobile transactions may be aborted. Thus, we accept reordering technique to reduce the number of aborted transactions; that is, whenever any kind of conflict is found from broadcast information, the system determine the operation orders without violating transactional consistency, not just aborting the mobile transactions unconditionally. The proposed algorithms - O-Post algorithm for update transaction and O-Pre algorithm for read-only transaction - do not need much information from the server while resulting in serializable executions. Finally, we also evaluate the performance behavior through simulation study.",

author = "SungSuk Kim and Hwang, {Chong Sun} and Heonchang Yu and Sang-Geun Lee",

year = "2001",

doi = "10.1007/3-540-44498-x_9",

language = "English",

isbn = "3540414541",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "105--117",

editor = "Kian-Lee Tan and Franklin, {Michael J.} and Lui, {John Chi-Shing}",

booktitle = "Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings",

note = "2nd International Conference on Mobile Data Management, MDM 2001 ; Conference date: 08-01-2001 Through 10-01-2001",

}

TY - GEN

T1 - Optimistic scheduling algorithm for mobile transactions based on reordering

AU - Kim, SungSuk

AU - Hwang, Chong Sun

AU - Yu, Heonchang

AU - Lee, Sang-Geun

PY - 2001

Y1 - 2001

N2 - In this paper, we propose transaction processing algorithms in the broadcast environment. We take an optimistic approach for mobile transactions because (a) it needs a small number of messages for maintaining transactional consistency, and (b) it can make good use of broadcasting facilities from the servers. The more data conflicts occur, however, the more mobile transactions may be aborted. Thus, we accept reordering technique to reduce the number of aborted transactions; that is, whenever any kind of conflict is found from broadcast information, the system determine the operation orders without violating transactional consistency, not just aborting the mobile transactions unconditionally. The proposed algorithms - O-Post algorithm for update transaction and O-Pre algorithm for read-only transaction - do not need much information from the server while resulting in serializable executions. Finally, we also evaluate the performance behavior through simulation study.

AB - In this paper, we propose transaction processing algorithms in the broadcast environment. We take an optimistic approach for mobile transactions because (a) it needs a small number of messages for maintaining transactional consistency, and (b) it can make good use of broadcasting facilities from the servers. The more data conflicts occur, however, the more mobile transactions may be aborted. Thus, we accept reordering technique to reduce the number of aborted transactions; that is, whenever any kind of conflict is found from broadcast information, the system determine the operation orders without violating transactional consistency, not just aborting the mobile transactions unconditionally. The proposed algorithms - O-Post algorithm for update transaction and O-Pre algorithm for read-only transaction - do not need much information from the server while resulting in serializable executions. Finally, we also evaluate the performance behavior through simulation study.

UR - http://www.scopus.com/inward/record.url?scp=84944053454&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944053454&partnerID=8YFLogxK

U2 - 10.1007/3-540-44498-x_9

DO - 10.1007/3-540-44498-x_9

M3 - Conference contribution

AN - SCOPUS:84944053454

SN - 3540414541

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 105

EP - 117

BT - Mobile Data Management - 2nd International Conference, MDM 2001, Proceedings

A2 - Tan, Kian-Lee

A2 - Franklin, Michael J.

A2 - Lui, John Chi-Shing

PB - Springer Verlag

T2 - 2nd International Conference on Mobile Data Management, MDM 2001

Y2 - 8 January 2001 through 10 January 2001

ER -

Optimistic scheduling algorithm for mobile transactions based on reordering

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this