Proceedings Article10.1145/137097.137858
Distributed algorithms for dynamic replication of data
Ouri Wolfson,Sushil Jajodia +1 more
- 01 Jul 1992
- pp 149-163
113
TL;DR: Two distributed algorithms for dynamic replication of a data-item in communication networks are presented, each of which continuously moves the replication scheme towards an optimal one, where optimality is defined with respect to different objective functions.
read more
Abstract: We present two distributed algorithms for dynamic replication of a data-item in communication networks. The algorithms are adaptive in the sense that they change the replication scheme of the item (i.e. the set of processors at which the data-item is replicated), as the read-write pattern of the processors in the network changes. Each algorithm continuously moves the replication scheme towards an optimal one, where optimality is defined with respect to different objective functions. One algorithm optimizes the communication cost objective function, and the other optimizes the communication time. We also provide a lower bound on the performance of any dynamic replication algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Systems and methods for backing up data files
Christopher Midgley,John Webb +1 more
- 16 Dec 1999
TL;DR: In this paper, the authors propose a synchronization process that replicates selected source data files data stored on the network and creates a corresponding set of replicated data files, called the target data files that are stored on a back up server.
969
Patent
Method for the distribution of code and data updates
Arthur A. van Hoff,Jonathan Payne,Sami Shaio +2 more
- 24 Jul 1996
TL;DR: In this article, a system and method for distributing software applications and data to many thousands of clients over a network is described, where applications are called channels, the server is called the transmitter, and the client is referred to as the tuner.
504
Data partitioning and load balancing in parallel disk systems
Peter Scheuermann,Gerhard Weikum,Peter Zabback +2 more
- 01 Feb 1998
TL;DR: This paper outlines the main components of an intelligent, self-reliant file system that aims to optimize striping by taking into account the requirements of the applications, and performs load balancing by judicious file allocation and dynamic redistributions of the data when access patterns change.
GOLD infrastructure for virtual organizations
P. Periorellis,N Cook,Hugo Hiden,A Conlin,M. D. Hamilton,J Wu,Jeremy Bryans,X Gong,F Zhu,R Smith,Paul Watson,AR Wright +11 more
TL;DR: The GOLD project as discussed by the authors is a Grid-based Information Models to Support the Rapid Innovation of New High Value-added Chemicals (GEM) project, whose principal aim is to carry out research and development into enabling technologies to support the formation, operation and termination of virtual organizations.
203
Data management for mobile computing
Tomasz Imieĺinski,B. R. Badrinath +1 more
- 01 Mar 1993
TL;DR: New research problems include management of location dependent data, wireless data broadcasting, disconnection management and energy efficient data access in mobile computing.
197
References
•Book
Concurrency Control and Recovery in Database Systems
Philip A. Bernstein,Vassco Hadzilacos,Nathan Goodman +2 more
- 01 Feb 1987
TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.
4.2K
•Book
Principles of Distributed Database Systems
M. Tamer zsu,Patrick Valduriez +1 more
- 01 Aug 1990
TL;DR: This third edition of a classic textbook can be used to teach at the senior undergraduate and graduate levels and concentrates on fundamental theories as well as techniques and algorithms in distributed data management.
2.7K
Amortized efficiency of list update and paging rules
TL;DR: This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.
2.5K
A study of replacement algorithms for a virtual-storage computer
TL;DR: One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.
•Book
Distributed Databases: Principles and Systems
Stefano Ceri,Giuseppe Pelagatti +1 more
- 01 Jan 1984
TL;DR: It is necessary to consider the architecture of the distributed database as a system of principles rather than as a black-box of values.
809
Related Papers (5)
Yixiu Huang,Prasad Sistla,Ouri Wolfson +2 more
- 24 May 1994
B. R. Badrinath,Tomasz Imielinski +1 more
- 12 Nov 1992
M. Tamer zsu,Patrick Valduriez +1 more
- 01 Aug 1990