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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages105-117
Number of pages13
Volume1987
ISBN (Print)3540414541
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Reordering
Scheduling algorithms
Scheduling Algorithm
Transactions
Servers
Broadcast
Server
Broadcasting
Transaction Processing
Processing
Update
Simulation Study
Evaluate

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kim, S., Hwang, C. S., Yu, H., & Lee, S-G. (2001). Optimistic scheduling algorithm for mobile transactions based on reordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1987, pp. 105-117). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1987). Springer Verlag.

Optimistic scheduling algorithm for mobile transactions based on reordering. / Kim, SungSuk; Hwang, Chong Sun; Yu, Heonchang; Lee, Sang-Geun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1987 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 proceedingConference contribution

Kim, S, Hwang, CS, Yu, H & Lee, S-G 2001, Optimistic scheduling algorithm for mobile transactions based on reordering. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1987, 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.
Kim S, Hwang CS, Yu H, Lee S-G. Optimistic scheduling algorithm for mobile transactions based on reordering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1987. Springer Verlag. 2001. p. 105-117. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kim, SungSuk ; Hwang, Chong Sun ; Yu, Heonchang ; Lee, Sang-Geun. / Optimistic scheduling algorithm for mobile transactions based on reordering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1987 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",
language = "English",
isbn = "3540414541",
volume = "1987",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "105--117",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

M3 - Conference contribution

AN - SCOPUS:84944053454

SN - 3540414541

VL - 1987

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

SP - 105

EP - 117

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

PB - Springer Verlag

ER -