Please use this identifier to cite or link to this item:
Title: On minimizing memory and computation overheads for binary-tree based data replication
Authors: Souravlas, Stavros
Sifaleras, Angelo
Type: Book chapter
Subjects: FRASCATI::Natural sciences::Computer and information sciences
FRASCATI::Engineering and technology::Electrical engineering, Electronic engineering, Information engineering
Keywords: Replication Optimization
Data Grid
Issue Date: 2017
Publisher: IEEE
First Page: 1296
Last Page: 1299
Volume Title: 22nd IEEE Symposium on Computers and Communications (ISCC 2017)
Abstract: Data replication is used to track the most popular files (i.e., the ones with most requests) and replicate them in selected nodes. In this way, more requests for such popular files can be completed over a period of time and bandwidth consumption is reduced, since these files do not need to be transferred from remote nodes. In this article, we extend our previous work [1] to make it more efficient in terms of memory and total computation cost, so that it becomes more efficient and suitable for larger grids. To reduce the memory costs, we present a centralized strategy which estimates the potential for selected batches of files. The computations required for these estimations are executed in a pipelined way, so their cost is also reduced.
ISBN: 978-1-5386-1629-1
Other Identifiers: 10.1109/ISCC.2017.8024703
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
On_minimizing_memory_and_computation_overheads_for_binary-tree_based_data_replication.pdf356,07 kBAdobe PDFView/Open

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