Jump to content

Hilbert curve scheduling

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by VanishedUserABC (talk | contribs) at 14:10, 26 February 2012. 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 approach turns a multidimensional task allocation problem into a one dimensional space filling problem using Hilbert curves.[1]

See also

References

  1. ^ Scheduling for Parallel Processing (Computer Communications and Networks) by Maciej Drozdowski 2009 ISBN 1848823096 page 166
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=478947854"