C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Minimizing Stretch and Makespan of Multiple Parallel Task Graphs via Malleable Allocations.
Henri Casanova
Frédéric Desprez
Frédéric Suter
Published in:
ICPP (2010)
Keyphrases
</>
graph matching
graph theoretic
resource allocation
parallel processing
graph representation
real time
pairwise
flowshop
bipartite graph
shared memory
graph databases
multiple independent