Hilbert curve scheduling

On this page

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.

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.

We don't have any images related to Hilbert curve scheduling yet.

You can add one yourself here.

We don't have any YouTube videos related to Hilbert curve scheduling yet.

You can add one yourself here.

We don't have any PDF documents related to Hilbert curve scheduling yet.

You can add one yourself here.

We don't have any Books related to Hilbert curve scheduling yet.

You can add one yourself here.

We don't have any archived web articles related to Hilbert curve scheduling yet.

You can submit a link to a page to archive here.

References

Scheduling for Parallel Processing by Maciej Drozdowski 2009 ISBN 1-84882-309-6 page 166 /wiki/ISBN_(identifier) ↩
Job Scheduling Strategies for Parallel Processing: by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 ISBN 3-642-04632-0 pages 138-144 /wiki/ISBN_(identifier) ↩
Job Scheduling Strategies for Parallel Processing: by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 ISBN 3-642-04632-0 pages 138-144 /wiki/ISBN_(identifier) ↩

See also

References