In parallel processing, the Hilbert curve scheduling approach 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]
See also
References
- ^ Scheduling for Parallel Processing by Maciej Drozdowski 2009 ISBN 1848823096 page 166
 | This computer-engineering-related article is a stub. You can help Wikipedia by expanding it. |