[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tpds/SelvakumarM94>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/C._Selvakumar>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/C._Siva_Ram_Murthy>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F71.277783>
foaf:homepage <https://doi.org/10.1109/71.277783>
dc:identifier DBLP journals/tpds/SelvakumarM94 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F71.277783 (xsd:string)
dcterms:issued 1994 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tpds>
rdfs:label Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/C._Selvakumar>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/C._Siva_Ram_Murthy>
swrc:number 3 (xsd:string)
swrc:pages 328-336 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tpds/SelvakumarM94/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tpds/SelvakumarM94>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tpds/tpds5.html#SelvakumarM94>
rdfs:seeAlso <https://doi.org/10.1109/71.277783>
dc:subject computational complexity; multiprocessing systems; multiprocessor interconnectionnetworks; scheduling; heuristic programming; parallel algorithms; graph theory;multiprocessing programs; precedence constrained task graphs; intertask communication;multiprocessors; multiprocessor scheduling problem; parallel program; completion time;heuristic algorithm; list scheduling; communication channels (xsd:string)
dc:title Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 5 (xsd:string)