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. Other space filling curves may also be used in various computing applications for similar purposes.
|This computer engineering–related article is a stub. You can help Wikipedia by expanding it.|