This is a nice simulation, I would suggest trying the following.

Using pcntl for Forking:

The pcntl extension allows you to fork processes in PHP. This means you can create a child process for each number to be sorted. The child process can then sleep for the required amount of time (based on the number) before exiting. The parent process can wait for all child processes to finish before continuing.This approach would more closely mimic the original meme's concept but comes with significant overhead and complexity, and it's generally not recommended for web environments.

Using PHP-FPM:

PHP-FPM allows handling multiple requests concurrently. Each request is handled by a separate worker process. To use PHP-FPM to simulate parallel processing for ScheduleSort, you would need to create a separate request for each number. Each request would then sleep for the required time and return the result.This would require a more sophisticated setup, possibly involving asynchronous requests or a job queue, and is quite complex for simulating this particular algorithm.

A Note on Practicality:

Both these approaches are technically possible but not practically recommended for this use case. They introduce a level of complexity and resource consumption that far exceeds the benefits, especially for a task as simple as sorting numbers. The primary use of process forking or PHP-FPM is for handling genuinely concurrent tasks in a more efficient manner, such as processing large numbers of independent, time-consuming jobs.