The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2007)
Long Beach, CA, USA
Mar. 26, 2007 to Mar. 30, 2007
ISBN: 1-4244-0909-8
pp: 126
Thanasis Loukopoulos , Department of Computer and Communications Engineering, University of Thessaly, Glavani 37, 38221 Volos, Greece. luke@inf.uth.gr
Nikos Tziritas , Department of Computer and Communications Engineering, University of Thessaly, Glavani 37, 38221 Volos, Greece. nitzirit@inf.uth.gr
Petros Lampsas , Department of Informatics and Computer Technology, Technological Educational Institute of Lamia, 3rd km Old Ntl. Rd., 35100 Lamia, Greece. plam@teilam.gr
Spyros Lalis , Department of Computer and Communications Engineering, University of Thessaly, Glavani 37, 38221 Volos, Greece. lalis@inf.uth.gr
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.
INDEX TERMS
null
CITATION

T. Loukopoulos, S. Lalis, N. Tziritas and P. Lampsas, "Implementing Replica Placements: Feasibility and Cost Minimization," 2007 IEEE International Parallel and Distributed Processing Symposium(IPDPS), Rome, 2007, pp. 126.
doi:10.1109/IPDPS.2007.370316
80 ms
(Ver 3.3 (11022016))