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]
Hilbert curves.
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]
hilbert, curve, scheduling, parallel, processing, method, turns, multidimensional, task, allocation, problem, into, dimensional, space, filling, problem, using, hilbert, curves, assigning, related, tasks, locations, with, higher, levels, proximity, other, spac. 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 Hilbert curves 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 editJob scheduling Supercomputer operating systemsReferences edit Scheduling for Parallel Processing by Maciej Drozdowski 2009 ISBN 1 84882 309 6 page 166 a b Job Scheduling Strategies for Parallel Processing by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 ISBN 3 642 04632 0 pages 138 144 nbsp This computer engineering related article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Hilbert curve scheduling amp oldid 1207006812, wikipedia, wiki, book, books, library,
