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 proceedingConference 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 languageEnglish
Title of host publicationMobile Data Management - 2nd International Conference, MDM 2001, Proceedings
EditorsKian-Lee Tan, Michael J. Franklin, John Chi-Shing Lui
PublisherSpringer Verlag
Pages105-117
Number of pages13
ISBN (Print)3540414541
DOIs
Publication statusPublished - 2001
Event2nd International Conference on Mobile Data Management, MDM 2001 - Hong Kong, China
Duration: 2001 Jan 82001 Jan 10

Publication series

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

Other

Other2nd International Conference on Mobile Data Management, MDM 2001
CountryChina
CityHong Kong
Period01/1/801/1/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimistic scheduling algorithm for mobile transactions based on reordering'. Together they form a unique fingerprint.

  • 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