Before revision:  i.e., the job response time is the maximum of the response times of its tasks  , which is hard to analyze since these task response times are generally not independent. In this paper, we approach this problem by studying when the response times of a job's tasks are close to being independent. We consider a limited fork-join model with n servers, where each job consists of k ^{(n)}  ntasks.
After revision:  i.e., the job response time is the maximum of the response times of its tasks , goes to infinity, and the number of tasks in a job, k^{(n) ^{(n)}  ntasks.