Revision as of 11:40, 14 June 2017 edit Magic links bot (talk \| contribs) Bots 291,110 edits m Replace magic links with templates per local RfC and MediaWiki RfC ← Previous edit		Latest revision as of 18:40, 13 February 2024 edit undo Cosmia Nebula (talk \| contribs) Extended confirmed users 11,340 edits →top: figure Tag: Visual edit
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/>

Hilbert curve scheduling: Difference between revisions