𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of static data replication in data grids

✍ Scribed by Uroš Čibej; Boštjan Slivnik; Borut Robič

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
161 KB
Volume
31
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

Data replication is a well-known technique used in distributed computing to improve access to data and/or system fault-tolerance. Recently, studies of its applications to grid computing have also been initiated. In this article we describe data replication on data grids as a static optimization problem. We show that this problem is NP-hard and non-approximable. We discuss two approaches to solving it, i.e. integer programming and simplifications.

📜 SIMILAR VOLUMES

Minimizing message complexity of partial
Minimizing message complexity of partially replicated data on hypercubes
✍ Humenik, Keith; Matthews, Peter; Stephens, A. B.; Yesha, Yelena 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 663 KB

Within the framework of distributed and parallel computing, we consider partially replicated data on a hypercube. We address the problem of placing copies on the hypercube in order to minimize message complexity. With realistic restrictions on the read/write ratio and the number of copies, we find t