In parallel processing, the Hilbert curve scheduling method turns a multidimensional task allocation problem into a one-dimensional space filling problem using Hilbert curves, assigning related tasks to locations with higher levels of proximity.Scheduling for Parallel Processing by Maciej Drozdowski 2009 page 166 Other space filling curves may also be used in various computing applications for similar purposes.
The SLURM job scheduler which is used on a number of supercomputers uses a best fit algorithm based on Hilbert curve scheduling in order to optimize locality of task assignments.Job Scheduling Strategies for Parallel Processing: by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 pages 138-144
See also Job scheduling Automate Schedule Supercomputer operating systems
References