We study the maximum remaining service time in M(2)∣G2∣∞ fork -join queueing systems where an incoming task forks on arrival for service into two subtasks, each of them being served in one of two infinite-sever subsystems. The following cases for the arrival rate are considered: (1) time-independent, (2) given by a function of time, (3) given by a stochastic process. As examples of service time distributions, we consider exponential, hyperexponential, Pareto, and uniform distributions. In a number of cases we find copula functions and the Blomqvist coefficient. We prove asymptotic independence of maximum remaining service times under high load conditions.