Implementing Replica Placements: Feasibility and Cost Minimization

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.

[1]  Cho-Li Wang,et al.  Load balancing in distributed Web server systems with partial document replication , 2002, Proceedings International Conference on Parallel Processing.

[2]  Chatschik Bisdikian,et al.  Cost-Based Program Allocation for Distributed Multimedia-on-Demand Systems , 1996, IEEE Multim..

[3]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[4]  Frode Eika Sandnes,et al.  Toward a realistic task scheduling model , 2006, IEEE Transactions on Parallel and Distributed Systems.

[5]  Pavlin Radoslavov,et al.  Topology-informed Internet replica placement , 2002, Comput. Commun..

[6]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[7]  Thanasis Loukopoulos,et al.  INVESTIGATING THE REPLICA TRANSFER SCHEDULING PROBLEM , 2006 .

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[9]  John M. Wilson,et al.  An exact algorithm for a milk tanker scheduling and sequencing problem , 1999, Ann. Oper. Res..

[10]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[11]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[12]  Kavitha Ranganathan,et al.  Evolving Toward the Perfect Schedule: Co-scheduling Job Assignments and Data Replication in Wide-Area Systems Using a Genetic Algorithm , 2005, JSSPP.

[13]  Magnus Karlsson,et al.  Choosing replica placement heuristics for wide-area systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[14]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[15]  Jianliang Xu,et al.  On replica placement for QoS-aware content distribution , 2004, IEEE INFOCOM 2004.

[16]  Ishfaq Ahmad,et al.  Continuous Replica Placement schemes in distributed systems , 2005, ICS '05.

[17]  Avishai Wool,et al.  Replication, consistency, and practicality: are these mutually exclusive? , 1998, SIGMOD '98.

[18]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Antoine Vernois,et al.  Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid , 2005, Journal of Grid Computing.

[20]  Azer Bestavros,et al.  Mistreatment in Distributed Caching Groups: Causes and Implications , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Yves Robert,et al.  Optimal algorithms for scheduling divisible workloads on heterogeneous systems , 2003, Proceedings International Parallel and Distributed Processing Symposium.