Hilbert curve scheduling
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.[1] Other space filling curves may also be used in various computing applications for similar purposes.[2]
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.[2]
See also[]
- Job scheduling
- Supercomputer operating systems
References[]
 | This computer-engineering-related article is a stub. You can help Wikipedia by . |
Categories:
- Computer engineering stubs
- Job scheduling
- Supercomputing