Optimistic transaction processing algorithms in pure-push and adaptive broadcast environments

S. S. Kim, I. Y. Chung, S. Y. Jung, C. S. Hwang

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

Considering the properties of mobile computing environments, push-based data dissemination systems have lately attracted considerable interests. However, skewed access pattern of mobile clients makes average wait time worse and they may want to request the data object to the server explicitly through backchannel. We call the broadcast model supporting backchannel as adaptive broadcast. In this paper, we devise new algorithms for adaptive broadcast based on our previous works; that is, we divide data objects which the server maintains into push data and pull data. Clients have to explicitly request data objects in pull data. Maintaining transactional consistency in both pure-push and adaptive broadcast environments is our main concerns. We also evaluate the performance behavior through simulation study.

Original languageEnglish
Pages61-68
Number of pages8
Publication statusPublished - 2001 Jan 1
Event8th International Conference on Parallel and Distributed Systems - Kyongju, Korea, Republic of
Duration: 2001 Jun 262001 Jun 29

Other

Other8th International Conference on Parallel and Distributed Systems
CountryKorea, Republic of
CityKyongju
Period01/6/2601/6/29

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Kim, S. S., Chung, I. Y., Jung, S. Y., & Hwang, C. S. (2001). Optimistic transaction processing algorithms in pure-push and adaptive broadcast environments. 61-68. Paper presented at 8th International Conference on Parallel and Distributed Systems, Kyongju, Korea, Republic of.