About: Transposition-driven scheduling

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

Transposition driven scheduling (TDS) is a load balancing algorithm for parallel computing. It was developed at the Vrije Universiteit in Amsterdam, The Netherlands as an algorithm to solve puzzles. The algorithm provides near-linear speedup with some problems and scales extremely well. It was published about by , , Henri Bal and Jonathan Schaeffer.

Property Value
dbo:abstract
  • Transposition driven scheduling (TDS) is a load balancing algorithm for parallel computing. It was developed at the Vrije Universiteit in Amsterdam, The Netherlands as an algorithm to solve puzzles. The algorithm provides near-linear speedup with some problems and scales extremely well. It was published about by , , Henri Bal and Jonathan Schaeffer. (en)
dbo:wikiPageID
  • 8544850 (xsd:integer)
dbo:wikiPageLength
  • 6270 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1118280351 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Transposition driven scheduling (TDS) is a load balancing algorithm for parallel computing. It was developed at the Vrije Universiteit in Amsterdam, The Netherlands as an algorithm to solve puzzles. The algorithm provides near-linear speedup with some problems and scales extremely well. It was published about by , , Henri Bal and Jonathan Schaeffer. (en)
rdfs:label
  • Transposition-driven 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