[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tpds/YangG94>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Apostolos_Gerasoulis>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Tao_Yang_0009>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F71.308533>
foaf:homepage <https://doi.org/10.1109/71.308533>
dc:identifier DBLP journals/tpds/YangG94 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F71.308533 (xsd:string)
dcterms:issued 1994 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tpds>
rdfs:label DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Apostolos_Gerasoulis>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Tao_Yang_0009>
swrc:number 9 (xsd:string)
swrc:pages 951-967 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tpds/YangG94/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tpds/YangG94>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tpds/tpds5.html#YangG94>
rdfs:seeAlso <https://doi.org/10.1109/71.308533>
dc:subject scheduling; directed graphs; computational complexity; parallel algorithms; trees(mathematics); parallel programming; DSC; parallel task scheduling; low-complexityheuristic; dominant sequence clustering algorithm; completely connected processor;unbounded number; performance; nonzero communication overhead; arbitrary directedacyclic task graphs; DAGs; NP-complete; optimal schedules; special classes; fork; join;coarse-grain trees; fine-grain trees; general scheduling algorithms; ETF; MD (xsd:string)
dc:title DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 5 (xsd:string)