| dc.creator | Loukopoulos, T. | en |
| dc.creator | Tziritas, N. | en |
| dc.creator | Lampsas, P. | en |
| dc.creator | Lalis, S. | en |
| dc.date.accessioned | 2015-11-23T10:38:12Z | |
| dc.date.available | 2015-11-23T10:38:12Z | |
| dc.date.issued | 2007 | |
| dc.identifier | 10.1109/IPDPS.2007.370316 | |
| dc.identifier.isbn | 9781424409105 | |
| dc.identifier.isbn | 1424409101 | |
| dc.identifier.uri | http://hdl.handle.net/11615/30427 | |
| dc.description.abstract | Given two replication schemes Xold and Xnew, the Replica Transfer Scheduling Problem (RTSP) aims at reaching Xnew, starting from Xold, with minimal implementation cost. In this paper we generalize the problem description to include special cases, where deadlocks can occur while in the process of implementing Xnew. We address this impediment by introducing artificial (dummy) transfers. We then prove that RTSP-decision is NP-complete and propose two kinds of heuristics. The first attempts to replace dummy transfers with valid ones, while the second minimizes the implementation cost. Experimental evaluation of the algorithms illustrates the merits of our approach. ©2007 IEEE. | en |
| dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-34548727303&partnerID=40&md5=d9d707320b146d34095adb94dbd29e94 | |
| dc.subject | Computational complexity | en |
| dc.subject | Data transfer | en |
| dc.subject | Heuristic methods | en |
| dc.subject | Optimization | en |
| dc.subject | Problem solving | en |
| dc.subject | Dummy transfers | en |
| dc.subject | Replica Transfer Scheduling | en |
| dc.subject | Replication schemes | en |
| dc.subject | Scheduling | en |
| dc.title | Implementing replica placements: Feasibility and cost minimization | en |
| dc.type | conferenceItem | en |