Name
Title | ||
|---|---|---|
A Comparison Study of Heuristics for Mapping Parallel Algorithms to Message-Passing Multiprocessors |
Abstract | ||
|---|---|---|
This paper presents a comparison study of popular clustering and mapping heuristics which areused to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphswhich are representative of important scientific algorithms running on data-sets of practical interest.The annotation which assigns weights to nodes and edges of the task-graphs is realistic. It reflectscurrent trends in processor, communication channel, and message-passing interface technology andtakes... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1080/10637199508915537 | Parallel Algorithms Appl. |
Keywords | Field | DocType |
clustering,message passing interface,parallel algorithm,graph clustering,message passing,communication channels | Annotation,Parallel algorithm,Computer science,Communication channel,Theoretical computer science,Models of communication,Heuristics,Mapping algorithm,Cluster analysis,Message passing | Journal |
Volume | Issue | Citations |
7 | 3-4 | 1 |
PageRank | References | Authors |
0.35 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marios D. Dikaiakos | 1 | 697 | 72.63 |
| Anne Rogers | 2 | 7 | 1.04 |
| Kenneth Steiglitz | 3 | 1128 | 660.13 |