About: Loop scheduling

An Entity of Type: disease, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In parallel computing, loop scheduling is the problem of assigning proper iterations of parallelizable loops among n processors to achieve load balancing and maintain data locality with minimum dispatch overhead. Typical loop scheduling methods are:

Property Value
dbo:abstract
  • In parallel computing, loop scheduling is the problem of assigning proper iterations of parallelizable loops among n processors to achieve load balancing and maintain data locality with minimum dispatch overhead. Typical loop scheduling methods are: * static even scheduling: evenly divide loop iteration space into n chunks and assign each chunk to a processor * dynamic scheduling: a chunk of loop iteration is dispatched at runtime by an idle processor. When the chunk size is 1 iteration, it is also called self-scheduling. * guided scheduling: similar to dynamic scheduling, but the chunk sizes per dispatch keep shrinking until reaching a preset value. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 7336551 (xsd:integer)
dbo:wikiPageLength
  • 1183 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1061136684 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In parallel computing, loop scheduling is the problem of assigning proper iterations of parallelizable loops among n processors to achieve load balancing and maintain data locality with minimum dispatch overhead. Typical loop scheduling methods are: (en)
rdfs:label
  • Loop scheduling (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License