Hilbert curve scheduling: Difference between revisions

Content deleted Content added

Revision as of 14:38, 28 September 2015 edit BD2412 (talk \| contribs) Autopatrolled, Administrators 2,529,464 edits m minor fixes, mostly disambig links using AWB ← Previous edit		Latest revision as of 18:40, 13 February 2024 edit undo Cosmia Nebula (talk \| contribs) Extended confirmed users 11,336 edits →top: figure Tag: Visual edit
(One intermediate revision by one other user not shown)
Line 1: [[File:Hilbert curve.png\|thumb\|Hilbert curves.]] In [[Parallel computing\|parallel processing]], the '''Hilbert curve scheduling''' method turns a multidimensional [[task scheduling\|task allocation]] problem into a one-dimensional space filling problem using [[Hilbert curve]]s, assigning related tasks to locations with higher levels of proximity.<ref name=Hilbert>''Scheduling for Parallel Processing'' by Maciej Drozdowski 2009 {{ISBN \|1-84882-309-6}} page 166</ref> Other [[space filling curves]] may also be used in various computing applications for similar purposes.<ref name=Eitan/> The [[Simple Linux Utility for Resource Management\|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.<ref name=Eitan>''Job Scheduling Strategies for Parallel Processing:'' by Eitan Frachtenberg and Uwe Schwiegelshohn 2010 {{ISBN \|3-642-04632-0}} pages 138-144</ref> ==See also==