Hilbert curve scheduling: Difference between revisions

Revision as of 14:10, 26 February 2012

Revision as of 14:11, 26 February 2012

Line 1:

In [[parallel processing]], the '''Hilbert curve scheduling''' approach turns a multidimensional [[task scheduling|task allocation]] problem into a one dimensional space filling problem using [[Hilbert curve]]s.<ref name=Hilbert>''Scheduling for Parallel Processing (Computer Communications and Networks)'' by Maciej Drozdowski 2009 ISBN 1848823096 page 166</ref>

==See also==