We define the bounds of two gang service algorithms, namely time balanced and instruction balanced, using interactivity and throughput based metrics. The workload is composed of V-RAM jobs, and the architectural model chosen is LogP. We also analyze the effect of workload and space sharing strategies on the bounds found. The following results are demonstrated: when interactivity is considered, instruction balanced gang service is the best possible non-clairvoyant algorithm. When the objective is to increase throughput Instruction balanced and time balanced gang service are equivalent algorithms. In this case the preemption strategy is not a determinant factor in performance