In a winter morning one man shovels the snow from his driveway. When the job is finished he can get out with the car. In the neighbouring driveway p men remove the same amount of snow in one p-th of time. The next morning is snowy. As the single shoveler goes on, new snow falls making his job harder. The neighbouring shovelers work for a shorter time, and a smaller amount of snow falls meanwhile, so that they clean the driveway in less than one p-th of time. This seems to conflict with a folklore theorem on parallel speed-up.
/lp/association-for-computing-machinery/the-p-shovelers-problem-computing-with-time-varying-data-Pqin7tHquq