In this paper, we study an N server fork-join queue with nearly
deterministic arrival and service times. Specifically, we present a fluid limit
for the maximum queue length as N→∞. This fluid limit depends on the
initial number of tasks. In order to prove these results, we develop extreme
value theory and diffusion approximations for the queue lengths.Comment: 36 pages, 15 figure