Jump to content

Hilbert curve scheduling

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Helpful Pixie Bot (talk | contribs) at 05:23, 19 March 2012 (ISBNs (Build J/)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

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

References

  1. ^ Scheduling for Parallel Processing by Maciej Drozdowski 2009 ISBN 1-84882-309-6 page 166
  2. ^ a b Job Scheduling Strategies for Parallel Processing: by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 ISBN 3-642-04632-0 pages 138-144
Stub icon

This computer-engineering-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hilbert_curve_scheduling&oldid=482672022"