use of java.util.Random in project flink by apache.
the class SchedulerSlotSharingTest method testConcurrentAllocateAndRelease.
@Test
public void testConcurrentAllocateAndRelease() {
final ExecutorService executor = Executors.newFixedThreadPool(20);
try {
for (int run = 0; run < 50; run++) {
final JobVertexID jid1 = new JobVertexID();
final JobVertexID jid2 = new JobVertexID();
final JobVertexID jid3 = new JobVertexID();
final JobVertexID jid4 = new JobVertexID();
final SlotSharingGroup sharingGroup = new SlotSharingGroup(jid1, jid2, jid3, jid4);
final Scheduler scheduler = new Scheduler(TestingUtils.defaultExecutionContext());
scheduler.newInstanceAvailable(getRandomInstance(4));
final AtomicInteger enumerator1 = new AtomicInteger();
final AtomicInteger enumerator2 = new AtomicInteger();
final AtomicBoolean flag3 = new AtomicBoolean();
final AtomicInteger enumerator4 = new AtomicInteger();
final Random rnd = new Random();
// use atomic boolean as a mutable boolean reference
final AtomicBoolean failed = new AtomicBoolean(false);
// use atomic integer as a mutable integer reference
final AtomicInteger completed = new AtomicInteger();
final Runnable deploy4 = new Runnable() {
@Override
public void run() {
try {
SimpleSlot slot = scheduler.allocateSlot(new ScheduledUnit(getTestVertex(jid4, enumerator4.getAndIncrement(), 4), sharingGroup), false).get();
sleepUninterruptibly(rnd.nextInt(5));
slot.releaseSlot();
if (completed.incrementAndGet() == 13) {
synchronized (completed) {
completed.notifyAll();
}
}
} catch (Throwable t) {
t.printStackTrace();
failed.set(true);
}
}
};
final Runnable deploy3 = new Runnable() {
@Override
public void run() {
try {
if (flag3.compareAndSet(false, true)) {
SimpleSlot slot = scheduler.allocateSlot(new ScheduledUnit(getTestVertex(jid3, 0, 1), sharingGroup), false).get();
sleepUninterruptibly(5);
executor.execute(deploy4);
executor.execute(deploy4);
executor.execute(deploy4);
executor.execute(deploy4);
slot.releaseSlot();
if (completed.incrementAndGet() == 13) {
synchronized (completed) {
completed.notifyAll();
}
}
}
} catch (Throwable t) {
t.printStackTrace();
failed.set(true);
}
}
};
final Runnable deploy2 = new Runnable() {
@Override
public void run() {
try {
SimpleSlot slot = scheduler.allocateSlot(new ScheduledUnit(getTestVertex(jid2, enumerator2.getAndIncrement(), 4), sharingGroup), false).get();
// wait a bit till scheduling the successor
sleepUninterruptibly(rnd.nextInt(5));
executor.execute(deploy3);
// wait a bit until release
sleepUninterruptibly(rnd.nextInt(5));
slot.releaseSlot();
if (completed.incrementAndGet() == 13) {
synchronized (completed) {
completed.notifyAll();
}
}
} catch (Throwable t) {
t.printStackTrace();
failed.set(true);
}
}
};
final Runnable deploy1 = new Runnable() {
@Override
public void run() {
try {
SimpleSlot slot = scheduler.allocateSlot(new ScheduledUnit(getTestVertex(jid1, enumerator1.getAndIncrement(), 4), sharingGroup), false).get();
// wait a bit till scheduling the successor
sleepUninterruptibly(rnd.nextInt(5));
executor.execute(deploy2);
// wait a bit until release
sleepUninterruptibly(rnd.nextInt(5));
slot.releaseSlot();
if (completed.incrementAndGet() == 13) {
synchronized (completed) {
completed.notifyAll();
}
}
} catch (Throwable t) {
t.printStackTrace();
failed.set(true);
}
}
};
final Runnable deploy0 = new Runnable() {
@Override
public void run() {
sleepUninterruptibly(rnd.nextInt(10));
executor.execute(deploy1);
}
};
executor.execute(deploy0);
executor.execute(deploy0);
executor.execute(deploy0);
executor.execute(deploy0);
//noinspection SynchronizationOnLocalVariableOrMethodParameter
synchronized (completed) {
while (!failed.get() && completed.get() < 13) {
completed.wait(1000);
}
}
assertFalse("Thread failed", failed.get());
while (scheduler.getNumberOfAvailableSlots() < 4) {
sleepUninterruptibly(5);
}
assertEquals(1, scheduler.getNumberOfAvailableInstances());
assertEquals(1, scheduler.getNumberOfInstancesWithAvailableSlots());
assertEquals(4, scheduler.getNumberOfAvailableSlots());
assertEquals(13, scheduler.getNumberOfUnconstrainedAssignments());
}
} catch (Exception e) {
e.printStackTrace();
fail(e.getMessage());
}
}
use of java.util.Random in project flink by apache.
the class MemoryManagerLazyAllocationTest method setUp.
@Before
public void setUp() {
this.memoryManager = new MemoryManager(MEMORY_SIZE, 1, PAGE_SIZE, MemoryType.HEAP, false);
this.random = new Random(RANDOM_SEED);
}
use of java.util.Random in project flink by apache.
the class MemorySegmentSimpleTest method setUp.
@Before
public void setUp() throws Exception {
try {
this.manager = new MemoryManager(MANAGED_MEMORY_SIZE, 1, PAGE_SIZE, MemoryType.HEAP, true);
this.segment = manager.allocatePages(new DummyInvokable(), 1).get(0);
this.random = new Random(RANDOM_SEED);
} catch (Exception e) {
e.printStackTrace();
fail("Test setup failed.");
}
}
use of java.util.Random in project flink by apache.
the class BufferPoolFactoryTest method testAllDistributed.
@Test
public void testAllDistributed() throws IOException {
// try multiple times for various orders during redistribution
for (int i = 0; i < 1_000; ++i) {
Random random = new Random();
List<BufferPool> pools = new ArrayList<BufferPool>();
int numPools = numBuffers / 32;
long maxTotalUsed = 0;
for (int j = 0; j < numPools; j++) {
int numRequiredBuffers = random.nextInt(7 + 1);
// make unbounded buffers more likely:
int maxUsedBuffers = random.nextBoolean() ? Integer.MAX_VALUE : Math.max(1, random.nextInt(10) + numRequiredBuffers);
pools.add(networkBufferPool.createBufferPool(numRequiredBuffers, maxUsedBuffers));
maxTotalUsed = Math.min(numBuffers, maxTotalUsed + maxUsedBuffers);
// after every iteration, all buffers (up to maxTotalUsed) must be distributed
int numDistributedBuffers = 0;
for (BufferPool pool : pools) {
numDistributedBuffers += pool.getNumBuffers();
}
assertEquals(maxTotalUsed, numDistributedBuffers);
}
verifyAllBuffersReturned();
setupNetworkBufferPool();
}
}
use of java.util.Random in project flink by apache.
the class IOManagerITCase method parallelChannelsTest.
// ------------------------------------------------------------------------
/**
* This test instantiates multiple channels and writes to them in parallel and re-reads the data in
* parallel. It is designed to check the ability of the IO manager to correctly handle multiple threads.
*/
@Test
@SuppressWarnings("unchecked")
public void parallelChannelsTest() throws Exception {
final Random rnd = new Random(SEED);
final AbstractInvokable memOwner = new DummyInvokable();
FileIOChannel.ID[] ids = new FileIOChannel.ID[NUM_CHANNELS];
BlockChannelWriter<MemorySegment>[] writers = new BlockChannelWriter[NUM_CHANNELS];
BlockChannelReader<MemorySegment>[] readers = new BlockChannelReader[NUM_CHANNELS];
ChannelWriterOutputView[] outs = new ChannelWriterOutputView[NUM_CHANNELS];
ChannelReaderInputView[] ins = new ChannelReaderInputView[NUM_CHANNELS];
int[] writingCounters = new int[NUM_CHANNELS];
int[] readingCounters = new int[NUM_CHANNELS];
// instantiate the channels and writers
for (int i = 0; i < NUM_CHANNELS; i++) {
ids[i] = this.ioManager.createChannel();
writers[i] = this.ioManager.createBlockChannelWriter(ids[i]);
List<MemorySegment> memSegs = this.memoryManager.allocatePages(memOwner, rnd.nextInt(MAXIMUM_NUMBER_OF_SEGMENTS_PER_CHANNEL - 1) + 1);
outs[i] = new ChannelWriterOutputView(writers[i], memSegs, this.memoryManager.getPageSize());
}
Value val = new Value();
for (int i = 0; i < NUMBERS_TO_BE_WRITTEN; i++) {
int channel = skewedSample(rnd, NUM_CHANNELS - 1);
val.value = String.valueOf(writingCounters[channel]++);
val.write(outs[channel]);
}
// close all writers
for (int i = 0; i < NUM_CHANNELS; i++) {
this.memoryManager.release(outs[i].close());
}
outs = null;
writers = null;
// instantiate the readers for sequential read
for (int i = 0; i < NUM_CHANNELS; i++) {
List<MemorySegment> memSegs = this.memoryManager.allocatePages(memOwner, rnd.nextInt(MAXIMUM_NUMBER_OF_SEGMENTS_PER_CHANNEL - 1) + 1);
final BlockChannelReader<MemorySegment> reader = this.ioManager.createBlockChannelReader(ids[i]);
final ChannelReaderInputView in = new ChannelReaderInputView(reader, memSegs, false);
int nextVal = 0;
try {
while (true) {
val.read(in);
int intValue = 0;
try {
intValue = Integer.parseInt(val.value);
} catch (NumberFormatException nfex) {
Assert.fail("Invalid value read from reader. Valid decimal number expected.");
}
Assert.assertEquals("Written and read values do not match during sequential read.", nextVal, intValue);
nextVal++;
}
} catch (EOFException eofex) {
// expected
}
Assert.assertEquals("NUmber of written numbers differs from number of read numbers.", writingCounters[i], nextVal);
this.memoryManager.release(in.close());
}
// instantiate the readers
for (int i = 0; i < NUM_CHANNELS; i++) {
List<MemorySegment> memSegs = this.memoryManager.allocatePages(memOwner, rnd.nextInt(MAXIMUM_NUMBER_OF_SEGMENTS_PER_CHANNEL - 1) + 1);
readers[i] = this.ioManager.createBlockChannelReader(ids[i]);
ins[i] = new ChannelReaderInputView(readers[i], memSegs, false);
}
// read a lot of values in a mixed order from the channels
for (int i = 0; i < NUMBERS_TO_BE_WRITTEN; i++) {
while (true) {
final int channel = skewedSample(rnd, NUM_CHANNELS - 1);
if (ins[channel] != null) {
try {
val.read(ins[channel]);
int intValue;
try {
intValue = Integer.parseInt(val.value);
} catch (NumberFormatException nfex) {
Assert.fail("Invalid value read from reader. Valid decimal number expected.");
return;
}
Assert.assertEquals("Written and read values do not match.", readingCounters[channel]++, intValue);
break;
} catch (EOFException eofex) {
this.memoryManager.release(ins[channel].close());
ins[channel] = null;
}
}
}
}
// close all readers
for (int i = 0; i < NUM_CHANNELS; i++) {
if (ins[i] != null) {
this.memoryManager.release(ins[i].close());
}
readers[i].closeAndDelete();
}
ins = null;
readers = null;
// check that files are deleted
for (int i = 0; i < NUM_CHANNELS; i++) {
File f = new File(ids[i].getPath());
Assert.assertFalse("Channel file has not been deleted.", f.exists());
}
}
Aggregations