University of Illinois Urbana-Champaign

Performance Analysis of Update Synchronization Algorithms for Distributed Databases

Cheng, Wing Kai

This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.

Permalink

https://hdl.handle.net/2142/66453

Description

Title
Performance Analysis of Update Synchronization Algorithms for Distributed Databases
Author(s)
Cheng, Wing Kai
Issue Date
1981
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
  • One of the most critical problem in the implementation of distributed databases is that of concurrency control. The problem is to preserve the consistency of data (that may otherwise be destroyed by concurrent accesses). One of the major goals in the research of distributed databases is to develop design methodology and guidelines for designing good concurrency control methods for a given system environment. In this thesis, we have set out to approach the goal by analyzing some of the concurrency control schemes in an effort to understand their relative merits, investigate the sensitivity of the performance to different parameters, and to provide some guidelines for designing resilient concurrency algorithms for distributed databases.
  • Several update synchronization algorithms are modelled and analyzed in this dissertation. Algorithms investigated in this dissertation include a resilient centralized locking algorithm, some distributed algorithms using timestamps, and some algorithms using clock messages in addition to timestamps. Results from the analysis allowed us to pinpoint inefficiency and suggest some new algorithms.
Graduation Semester
1981
Type of Resource
text
Permalink
http://hdl.handle.net/2142/66453

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Computer Science
Dissertations and Theses from the Dept. of Computer Science