Line Plot from Scientific Research

Comparison of the sojourn time bounds of the single-queue fork-join and split-merge models with l=50 servers and k tiny tasks. As a reference, the sojourn time bounds of a system with ideal partition, where a job is partitioned into l equisized tasks, is shown. Jobs have exponential inter-arrival times with parameter lambda =0.5 s-1 and are composed of k exponential tiny tasks with parameter mu = k/l. The bounds are exceeded with probability at most epsilon = 10-6.

DOI