plan.getStep()) { Resource excessCap = Resources.subtract(plan.getTotalCommittedResources(t), totCap);
plan.getStep()) { Resource excessCap = Resources.subtract(plan.getTotalCommittedResources(t), totCap);
t += plan.getStep()) { Resource excessCap = Resources.subtract(plan.getTotalCommittedResources(t), totCap);
Resources.addTo(netAvailableRes, oldResCap); Resources.subtractFrom(netAvailableRes, plan.getTotalCommittedResources(t)); Resources.subtractFrom(netAvailableRes, tempAssigned.getCapacityAtTime(t));
Resources.addTo(netAvailableRes, oldResCap); Resources.subtractFrom(netAvailableRes, plan.getTotalCommittedResources(t)); Resources.subtractFrom(netAvailableRes, tempAssigned.getCapacityAtTime(t));
private void checkAllocation(Plan plan, int[] alloc, int start, long periodicity) { long end = start + alloc.length; if (periodicity > 0) { end = end + maxPeriodicity; } RLESparseResourceAllocation userCons = plan.getConsumptionForUserOverTime(user, start, end * 3); for (int i = 0; i < alloc.length; i++) { // only one instance for non-periodic reservation if (periodicity <= 0) { assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getTotalCommittedResources(start + i)); assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), userCons.getCapacityAtTime(start + i)); } else { // periodic reservations should repeat long y = 0; Resource res = Resource.newInstance(1024 * (alloc[i]), (alloc[i])); while (y <= end * 2) { assertEquals("At time: " + start + i + y, res, plan.getTotalCommittedResources(start + i + y)); assertEquals(" At time: " + (start + i + y), res, userCons.getCapacityAtTime(start + i + y)); y = y + periodicity; } } } }
Resource currExistingAllocTot = plan.getTotalCommittedResources(t); Resource currNewAlloc = reservation.getResourcesAtTime(t); Resource currOldAlloc = Resource.newInstance(0, 0);
Resource currExistingAllocTot = plan.getTotalCommittedResources(t); Resource currNewAlloc = reservation.getResourcesAtTime(t); Resource currOldAlloc = Resource.newInstance(0, 0);
for (int i = 0; i < alloc.length; i++) { Assert.assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getTotalCommittedResources(start + i)); Assert.assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getConsumptionForUser(user, start + i));
Assert.assertEquals( Resource.newInstance(1024 * (alloc1[i]), (alloc1[i])), plan.getTotalCommittedResources(start + i)); Assert.assertEquals( Resource.newInstance(1024 * (alloc1[i]), (alloc1[i])), Assert.assertEquals( Resource.newInstance(1024 * (alloc1[i] + alloc2[i] + i), alloc1[i] + alloc2[i] + i), plan.getTotalCommittedResources(start + i)); Assert.assertEquals( Resource.newInstance(1024 * (alloc1[i] + alloc2[i] + i), alloc1[i] Assert.assertEquals( Resource.newInstance(1024 * (alloc1[i]), (alloc1[i])), plan.getTotalCommittedResources(start + i)); Assert.assertEquals( Resource.newInstance(1024 * (alloc1[i]), (alloc1[i])), for (int i = 0; i < alloc1.length; i++) { Assert.assertEquals(Resource.newInstance(0, 0), plan.getTotalCommittedResources(start + i)); Assert.assertEquals(Resource.newInstance(0, 0), plan.getConsumptionForUser(user, start + i));
for (int i = 0; i < alloc.length; i++) { Assert.assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getTotalCommittedResources(start + i)); Assert.assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getConsumptionForUser(user, start + i));
Resource currExistingAllocTot = plan.getTotalCommittedResources(t); Resource currExistingAllocForUser = plan.getConsumptionForUser(reservation.getUser(), t);
Resource.newInstance(1024 * (alloc1[i] + alloc2[i] + i), alloc1[i] + alloc2[i] + i), plan.getTotalCommittedResources(start + i)); assertEquals( Resource.newInstance(1024 * (alloc1[i] + alloc2[i] + i), for (int i = 0; i < alloc1.length; i++) { assertEquals(Resource.newInstance(0, 0), plan.getTotalCommittedResources(start + i)); assertEquals(Resource.newInstance(0, 0), userCons.getCapacityAtTime(start + i));
for (int i = 0; i < alloc.length; i++) { Assert.assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getTotalCommittedResources(start + i)); Assert.assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getConsumptionForUser(user, start + i)); Assert.assertEquals( Resource.newInstance(1024 * (updatedAlloc[i] + i), updatedAlloc[i] + i), plan.getTotalCommittedResources(start + i)); Assert.assertEquals( Resource.newInstance(1024 * (updatedAlloc[i] + i), updatedAlloc[i]
Resource currExistingAllocTot = plan.getTotalCommittedResources(t); Resource currExistingAllocForUser = plan.getConsumptionForUser(reservation.getUser(), t);
Assert.assertEquals( Resource.newInstance(1024 * (alloc[i] + i), (alloc[i] + i)), plan.getTotalCommittedResources(start + i)); Assert.assertEquals( Resource.newInstance(1024 * (alloc[i] + i), (alloc[i] + i)), for (int i = 0; i < alloc.length; i++) { Assert.assertEquals(Resource.newInstance(0, 0), plan.getTotalCommittedResources(start + i)); Assert.assertEquals(Resource.newInstance(0, 0), plan.getConsumptionForUser(user, start + i));
assertEquals( Resource.newInstance(1024 * (alloc[i] + i), (alloc[i] + i)), plan.getTotalCommittedResources(start + i)); assertEquals( Resource.newInstance(1024 * (alloc[i] + i), (alloc[i] + i)), for (int i = 0; i < alloc.length; i++) { assertEquals(Resource.newInstance(0, 0), plan.getTotalCommittedResources(start + i)); assertEquals(Resource.newInstance(0, 0), userCons.getCapacityAtTime(start + i));
for (int i = 0; i < alloc.length; i++) { assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), plan.getTotalCommittedResources(start + i)); assertEquals(Resource.newInstance(1024 * (alloc[i]), (alloc[i])), userCons.getCapacityAtTime(start + i)); updatedAlloc[i] + i), plan.getTotalCommittedResources(start + i)); assertEquals(Resource.newInstance(1024 * (updatedAlloc[i] + i), updatedAlloc[i] + i), userCons.getCapacityAtTime(start + i));