41 search results - page 9 / 9 » Clustering Large Attributed Graphs: An Efficient Incremental... |
111
Voted
JSA
2000
15 years 26 days ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...