2 problems

Let $V$ be a set of $v$ servers, and let a data placement be a family of $b$ blocks, each of size $k$, on $V$. For a placement $(V,\mathcal{F})$, let … where $v_j$ is the number of…

Let $n$ be the number of servers, let $\bar{F}_X$ be the survival function of a task's service time, and let $\rX$ denote the service-time distribution. For a fork-join system, let…