Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5761223> ?p ?o }
Showing triples 1 to 15 of
15
with 100 triples per page.
- Q5761223 subject Q8567138.
- Q5761223 subject Q8825807.
- Q5761223 abstract "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.".
- Q5761223 wikiPageWikiLink Q1123036.
- Q5761223 wikiPageWikiLink Q121117.
- Q5761223 wikiPageWikiLink Q1366592.
- Q5761223 wikiPageWikiLink Q1641413.
- Q5761223 wikiPageWikiLink Q232661.
- Q5761223 wikiPageWikiLink Q3459703.
- Q5761223 wikiPageWikiLink Q567843.
- Q5761223 wikiPageWikiLink Q7643164.
- Q5761223 wikiPageWikiLink Q8567138.
- Q5761223 wikiPageWikiLink Q8825807.
- Q5761223 comment "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.".
- Q5761223 label "Hilbert curve scheduling".