Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://ruomo.lib.uom.gr/handle/7000/270
Πλήρης εγγραφή μεταδεδομένων
Πεδίο DC | Τιμή | Γλώσσα |
---|---|---|
dc.contributor.author | Souravlas, Stavros | - |
dc.contributor.author | Sifaleras, Angelo | - |
dc.date.accessioned | 2019-10-29T10:35:32Z | - |
dc.date.available | 2019-10-29T10:35:32Z | - |
dc.date.issued | 2017 | - |
dc.identifier | 10.1109/ISCC.2017.8024703 | en_US |
dc.identifier.isbn | 978-1-5386-1629-1 | en_US |
dc.identifier.uri | https://doi.org/10.1109/ISCC.2017.8024703 | en_US |
dc.identifier.uri | https://ruomo.lib.uom.gr/handle/7000/270 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | FRASCATI::Natural sciences::Computer and information sciences | en_US |
dc.subject | FRASCATI::Engineering and technology::Electrical engineering, Electronic engineering, Information engineering | en_US |
dc.subject.other | Replication Optimization | en_US |
dc.subject.other | Data Grid | en_US |
dc.subject.other | Pipeline | en_US |
dc.subject.other | Estimation | en_US |
dc.title | On minimizing memory and computation overheads for binary-tree based data replication | en_US |
dc.type | Book chapter | en_US |
dc.contributor.department | Τμήμα Εφαρμοσμένης Πληροφορικής | en_US |
local.identifier.firstpage | 1296 | en_US |
local.identifier.lastpage | 1299 | en_US |
local.identifier.volumetitle | 22nd IEEE Symposium on Computers and Communications (ISCC 2017) | en_US |
Εμφανίζεται στις Συλλογές: | Τμήμα Εφαρμοσμένης Πληροφορικής |
Αρχεία σε αυτό το Τεκμήριο:
Αρχείο | Περιγραφή | Μέγεθος | Μορφότυπος | |
---|---|---|---|---|
On_minimizing_memory_and_computation_overheads_for_binary-tree_based_data_replication.pdf | 356,07 kB | Adobe PDF | Προβολή/Ανοιγμα |
Τα τεκμήρια στο Αποθετήριο προστατεύονται από πνευματικά δικαιώματα, εκτός αν αναφέρεται κάτι διαφορετικό.