In a distributed computing environment with a high communication cost, limiting the number of balancing instants results in a better performance than the case where load balancing is executed continuously. Therefore, finding the optimal number of balancing instants and optimizing the performance over the interbalancing time and over the load-balancing gain becomes an important problem. In this paper we discuss the performance of a previously reported, control-theoretic motivated single load-balancing strategy on a distributed physical system and the performance is compared to our simulation predictions. Based on the concept of regeneration, we also present a mathematical model for the distributed system with two nodes where a one-shot balancing is done. We obtain a system of four difference-differential equations characterizing the mean of the overall completion time. and compare its predictive capabilities via simulation to the physical system
