Distributed linearly separable computation, where a user asks some distributed servers to compute function, was recently formulated by the same authors and aims alleviate bottlenecks of stragglers communication cost in computation. The data center assigns subset input datasets each server an uncoded manner, computes coded packets on assigned datasets, which are then sent user. should recover ta...

We consider the k-server problem, with the additional assumptions that (1) the adversary makes only lazy moves (if it has a free server, not matched with our server, then it puts a request on such a server without moving it), and (2) whenever all our servers are matched with his servers, then he announces it to our algorithm. We show a k-competitive algorithm against such an adversary. As with ...