Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13646
Title: Design and analysis of object replacement policies on dynamic data allocation and replication algorithm with buffer constraints
Authors: GU XIN
Keywords: Object allocation, distributed database, competitiveness, replacement algorithm, caching, communication cost, distributed database management system
Issue Date: 6-Jan-2004
Source: GU XIN (2004-01-06). Design and analysis of object replacement policies on dynamic data allocation and replication algorithm with buffer constraints. ScholarBank@NUS Repository.
Abstract: This thesis addresses the performance of distributed database systems. Specifically, the basic idea underlying this thesis is to design and analyze effcient data allocation algorithms to minimize the total servicing cost for an arbitrary request schedule including read and write requests. In all research works so far, the available resources at the single server are considered to be infinite. However, in practice, each node has only a finite-size local database buffer to hold the copies of the object. When the available buffer space in a node is not enough to store a new copy of an object, the decision has to be made by each site to save or not to save the newly equested object, or to evict an object copy in use to give room for the new object copy. Thus we are naturally confronted with a problem of allocating and replicating the object with the consideration of buffer constraints. We design and analyze the allocation strategies with revised model of Dynamic Window Mechanism (DWM) algorithm jointly implemented with different types of object replacement strategies. We will show the impact on the allocation and replication strategies due to the limited local database buffer capacities. The performances of different algorithms are analyzed theoretically and experimentally. We consider the competitive performance of different algorithms and present algorithms with their competitive ratios. In a general sense, we consider the above mentioned scenario in a model in which the object size is assumed to be equal. We also consider the situation wherein the object size is different from each other. Thus we attack the problem in a more generalized scenario.
URI: http://scholarbank.nus.edu.sg/handle/10635/13646
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis_Final_GuXin_ECE.pdf638.58 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

165
checked on Dec 11, 2017

Download(s)

109
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.