Köhler, SvenSvenKöhlerTurau, VolkerVolkerTurau2019-09-302019-09-302015-08-02Theoretical Computer Science (591): 15-27 (2015-08-02)http://hdl.handle.net/11420/3467Large scale distributed systems require replication of resources to amplify availability and to provide fault tolerance. The placement of replicated resources significantly impacts performance. This paper considers local k-placements: Each node of a network has to place k replicas of a resource among its direct neighbors. The load of a node in a given local k-placement is the number of replicas it stores. The local k-placement problem is to achieve a preferably homogeneous distribution of the loads. We present a novel self-stabilizing, distributed, asynchronous, scalable algorithm for the k-placement problem such that the standard deviation of the distribution of the loads assumes a local minimum.en0304-397520151527Backup placementReplicationSelf-stabilizing algorithmsJournal Article10.1016/j.tcs.2015.04.019Other