Английская Википедия: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
References
- ↑ Scheduling for Parallel Processing by Maciej Drozdowski 2009 Шаблон:ISBN page 166
- ↑ 2,0 2,1 Job Scheduling Strategies for Parallel Processing: by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 Шаблон:ISBN pages 138-144