| dc.creator | Tziritas, N. | en |
| dc.creator | Loukopoulos, T. | en |
| dc.creator | Lampsas, P. | en |
| dc.creator | Lalis, S. | en |
| dc.date.accessioned | 2015-11-23T10:52:50Z | |
| dc.date.available | 2015-11-23T10:52:50Z | |
| dc.date.issued | 2009 | |
| dc.identifier | 10.1007/978-3-642-03869-3_24 | |
| dc.identifier.isbn | 3642038689 | |
| dc.identifier.issn | 3029743 | |
| dc.identifier.uri | http://hdl.handle.net/11615/34145 | |
| dc.description.abstract | Performing replica migrations in the minimum possible time, also called the Replica Migration Problem (RMP), is crucial in distributed systems using replication. In this paper we tackle RMP when multicast transfers are available. We give a formal problem statement as a Mixed Integer Programming problem. It turns out that the problem is NP-hard. Therefore, we resolve to scheduling heuristics in order to find good solutions. Through simulations we identify different tradeoffs between performance and execution time and conclude on the most attractive approaches. © 2009 Springer. | en |
| dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-70350680931&partnerID=40&md5=88cb5cc0469598049654ab6bd88e0654 | |
| dc.subject | Distributed systems | en |
| dc.subject | Execution time | en |
| dc.subject | Mixed integer programming | en |
| dc.subject | Multicasts | en |
| dc.subject | NP-hard | en |
| dc.subject | Problem statement | en |
| dc.subject | Scheduling heuristics | en |
| dc.subject | Artificial intelligence | en |
| dc.subject | Bioinformatics | en |
| dc.subject | Computational complexity | en |
| dc.subject | Heuristic methods | en |
| dc.subject | Multicasting | en |
| dc.subject | Scheduling | en |
| dc.subject | Integer programming | en |
| dc.title | Using multicast transfers in the replica migration problem: Formulation and scheduling heuristics | en |
| dc.type | other | en |
