The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Num ambiente de computação móvel, em que os canais de comunicação são limitados e têm baixas larguras de banda, as transações móveis são de longa duração e frequentemente desconectadas da sua rede sem fio durante o processamento. Tais peculiaridades das transações móveis tornam os esquemas de agendamento de transações existentes inadequados e levantam novos e desafiadores problemas de pesquisa. Neste artigo, propomos um novo esquema de escalonamento denominado OTS/MT (Optimistic Timestamp Scheme for Mobile Transactions) para escalonamento de transações móveis. OTS/MT é baseado em uma abordagem otimista que é adequada para baixa contenção de dados e evita adiamento indefinido e atraso em cascata, que são grandes desvantagens do esquema de controle de simultaneidade otimista existente e do esquema de pedido de carimbo de data/hora. Além disso, o algoritmo OTS/MT é inerentemente um esquema de escalonamento sem deadlocks. Para agendar transações móveis, o OTS/MT adia a detecção de conflitos entre transações móveis até o momento de confirmação da transação para melhorar a deterioração do desempenho do TO. Neste artigo, tentamos mostrar que esta aplicação de otimismo ao TO é justificada por meio de simulação.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
MinKyo LEE, JongHyun LEE, Songchun MOON, "Optimistic Scheduling for Transaction Management in Mobile Database Systems" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 3, pp. 654-667, March 1999, doi: .
Abstract: In a mobile computing environment, in which communication channels are limited and have low-bandwidths, mobile transactions are long-lived and frequently disconnected with their wireless network in processing. Such peculiarities of mobile transactions make existing transaction scheduling schemes inadequate and raise new challenging research problems. In this paper, we propose a new scheduling scheme called OTS/MT (Optimistic Timestamp Scheme for Mobile Transactions) for mobile transaction scheduling. OTS/MT is based on an optimistic approach that is suitable for low data contention, and prevents indefinite postponement and cascading delay which are major drawbacks of the existing optimistic concurrency control scheme and the timestamp ordering scheme. In addition, the OTS/MT algorithm is inherently a deadlock-free scheduling scheme. In order to schedule mobile transactions, OTS/MT postpones the detection of conflict between mobile transactions until transaction commit time to improve the performance deterioration of TO. In this paper, we attempt to show that this application of optimism to TO is justified by way of simulation.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_3_654/_p
Copiar
@ARTICLE{e82-d_3_654,
author={MinKyo LEE, JongHyun LEE, Songchun MOON, },
journal={IEICE TRANSACTIONS on Information},
title={Optimistic Scheduling for Transaction Management in Mobile Database Systems},
year={1999},
volume={E82-D},
number={3},
pages={654-667},
abstract={In a mobile computing environment, in which communication channels are limited and have low-bandwidths, mobile transactions are long-lived and frequently disconnected with their wireless network in processing. Such peculiarities of mobile transactions make existing transaction scheduling schemes inadequate and raise new challenging research problems. In this paper, we propose a new scheduling scheme called OTS/MT (Optimistic Timestamp Scheme for Mobile Transactions) for mobile transaction scheduling. OTS/MT is based on an optimistic approach that is suitable for low data contention, and prevents indefinite postponement and cascading delay which are major drawbacks of the existing optimistic concurrency control scheme and the timestamp ordering scheme. In addition, the OTS/MT algorithm is inherently a deadlock-free scheduling scheme. In order to schedule mobile transactions, OTS/MT postpones the detection of conflict between mobile transactions until transaction commit time to improve the performance deterioration of TO. In this paper, we attempt to show that this application of optimism to TO is justified by way of simulation.},
keywords={},
doi={},
ISSN={},
month={March},}
Copiar
TY - JOUR
TI - Optimistic Scheduling for Transaction Management in Mobile Database Systems
T2 - IEICE TRANSACTIONS on Information
SP - 654
EP - 667
AU - MinKyo LEE
AU - JongHyun LEE
AU - Songchun MOON
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1999
AB - In a mobile computing environment, in which communication channels are limited and have low-bandwidths, mobile transactions are long-lived and frequently disconnected with their wireless network in processing. Such peculiarities of mobile transactions make existing transaction scheduling schemes inadequate and raise new challenging research problems. In this paper, we propose a new scheduling scheme called OTS/MT (Optimistic Timestamp Scheme for Mobile Transactions) for mobile transaction scheduling. OTS/MT is based on an optimistic approach that is suitable for low data contention, and prevents indefinite postponement and cascading delay which are major drawbacks of the existing optimistic concurrency control scheme and the timestamp ordering scheme. In addition, the OTS/MT algorithm is inherently a deadlock-free scheduling scheme. In order to schedule mobile transactions, OTS/MT postpones the detection of conflict between mobile transactions until transaction commit time to improve the performance deterioration of TO. In this paper, we attempt to show that this application of optimism to TO is justified by way of simulation.
ER -