Efficient and reliable reservation algorithm for mobile transactions

Ahmed Elmagarmid, Jin Jing, Omran Bukhres

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

In a mobile computing environment, a user carrying a portable computer can execute a mobile transaction by submitting the operations of the transaction to distributed data servers from different locations. As a result of this mobility, the operations of the transaction may be executed at different servers. The distribution of operations implies that the transmission of messages (such as those involved in a two phase commit protocol) may be required among these data servers in order to coordinate the execution of these operations. In this paper, we will address the distribution of operations that update partitioned data in mobile environments. We introduce a new algorithm, the Reservation Algorithm (RA), that does not necessitate the incurring of message overheads (e.g., for a 2PC protocol) for operations pertaining to resource allocation. We address one related issue, termination protocols, which guarantees that the commit decision of a mobile host will not contradict with the unilateral abort decision of a data server.

Original languageEnglish
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Place of PublicationNew York, NY, United States
PublisherACM
Pages90-95
Number of pages6
Publication statusPublished - 1 Dec 1995
Externally publishedYes
EventProceedings of the 1995 ACM CIKM 4th International Conference on Information and Knowledge Management - Baltimore, MD, USA
Duration: 28 Nov 19952 Dec 1995

Other

OtherProceedings of the 1995 ACM CIKM 4th International Conference on Information and Knowledge Management
CityBaltimore, MD, USA
Period28/11/952/12/95

Fingerprint

Reservation
Guarantee
Resource allocation
Termination
Mobile computing

ASJC Scopus subject areas

  • Business, Management and Accounting(all)

Cite this

Elmagarmid, A., Jing, J., & Bukhres, O. (1995). Efficient and reliable reservation algorithm for mobile transactions. In International Conference on Information and Knowledge Management, Proceedings (pp. 90-95). New York, NY, United States: ACM.

Efficient and reliable reservation algorithm for mobile transactions. / Elmagarmid, Ahmed; Jing, Jin; Bukhres, Omran.

International Conference on Information and Knowledge Management, Proceedings. New York, NY, United States : ACM, 1995. p. 90-95.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Elmagarmid, A, Jing, J & Bukhres, O 1995, Efficient and reliable reservation algorithm for mobile transactions. in International Conference on Information and Knowledge Management, Proceedings. ACM, New York, NY, United States, pp. 90-95, Proceedings of the 1995 ACM CIKM 4th International Conference on Information and Knowledge Management, Baltimore, MD, USA, 28/11/95.
Elmagarmid A, Jing J, Bukhres O. Efficient and reliable reservation algorithm for mobile transactions. In International Conference on Information and Knowledge Management, Proceedings. New York, NY, United States: ACM. 1995. p. 90-95
Elmagarmid, Ahmed ; Jing, Jin ; Bukhres, Omran. / Efficient and reliable reservation algorithm for mobile transactions. International Conference on Information and Knowledge Management, Proceedings. New York, NY, United States : ACM, 1995. pp. 90-95
@inproceedings{93bd461cb2994ffbb41f2dcfc9b2332b,
title = "Efficient and reliable reservation algorithm for mobile transactions",
abstract = "In a mobile computing environment, a user carrying a portable computer can execute a mobile transaction by submitting the operations of the transaction to distributed data servers from different locations. As a result of this mobility, the operations of the transaction may be executed at different servers. The distribution of operations implies that the transmission of messages (such as those involved in a two phase commit protocol) may be required among these data servers in order to coordinate the execution of these operations. In this paper, we will address the distribution of operations that update partitioned data in mobile environments. We introduce a new algorithm, the Reservation Algorithm (RA), that does not necessitate the incurring of message overheads (e.g., for a 2PC protocol) for operations pertaining to resource allocation. We address one related issue, termination protocols, which guarantees that the commit decision of a mobile host will not contradict with the unilateral abort decision of a data server.",
author = "Ahmed Elmagarmid and Jin Jing and Omran Bukhres",
year = "1995",
month = "12",
day = "1",
language = "English",
pages = "90--95",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",
publisher = "ACM",

}

TY - GEN

T1 - Efficient and reliable reservation algorithm for mobile transactions

AU - Elmagarmid, Ahmed

AU - Jing, Jin

AU - Bukhres, Omran

PY - 1995/12/1

Y1 - 1995/12/1

N2 - In a mobile computing environment, a user carrying a portable computer can execute a mobile transaction by submitting the operations of the transaction to distributed data servers from different locations. As a result of this mobility, the operations of the transaction may be executed at different servers. The distribution of operations implies that the transmission of messages (such as those involved in a two phase commit protocol) may be required among these data servers in order to coordinate the execution of these operations. In this paper, we will address the distribution of operations that update partitioned data in mobile environments. We introduce a new algorithm, the Reservation Algorithm (RA), that does not necessitate the incurring of message overheads (e.g., for a 2PC protocol) for operations pertaining to resource allocation. We address one related issue, termination protocols, which guarantees that the commit decision of a mobile host will not contradict with the unilateral abort decision of a data server.

AB - In a mobile computing environment, a user carrying a portable computer can execute a mobile transaction by submitting the operations of the transaction to distributed data servers from different locations. As a result of this mobility, the operations of the transaction may be executed at different servers. The distribution of operations implies that the transmission of messages (such as those involved in a two phase commit protocol) may be required among these data servers in order to coordinate the execution of these operations. In this paper, we will address the distribution of operations that update partitioned data in mobile environments. We introduce a new algorithm, the Reservation Algorithm (RA), that does not necessitate the incurring of message overheads (e.g., for a 2PC protocol) for operations pertaining to resource allocation. We address one related issue, termination protocols, which guarantees that the commit decision of a mobile host will not contradict with the unilateral abort decision of a data server.

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

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

M3 - Conference contribution

SP - 90

EP - 95

BT - International Conference on Information and Knowledge Management, Proceedings

PB - ACM

CY - New York, NY, United States

ER -