Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase low-complexityheuristic (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1994 (1)
Publication types (Num. hits)
article(1)
Venues (Conferences, Journals, ...)
IEEE Trans. Parallel Distribut...(1)
Authors
Apostolos Gerasoulis(1) Tao Yang 0009(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 13 occurrences of 13 keywords
Results
Found 1 publication records. Showing 1 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
43Tao Yang 0009, Apostolos Gerasoulis DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling
Displaying result #1 - #1 of 1 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license