Name
Abstract | ||
|---|---|---|
In this paper we extend the practical range of simulationsof parallel executions by what we call "functionalalgorithm simulation," that is, simulation withoutactually performing most of the numerical computationsinvolved. We achieve this by introducing anew approach for generating and collecting communicationand computation characteristics for a classof parallel scientific algorithms. We describe FAST(Fast Algorithm Simulation Testbed), a prototype systemthat we developed to implement... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/MASCOT.1994.284432 | MASCOTS |
Keywords | Field | DocType |
functional algoritm simulation testbed,parallel computing,parallel algorithms,computational complexity,virtual machines | Analysis of parallel algorithms,Virtual machine,Computer science,Parallel algorithm,Parallel computing,Algorithm,Testbed,Interconnection,Computation,Distributed computing,Computational complexity theory,Cost efficiency | Conference |
ISBN | Citations | PageRank |
0-8186-5292-6 | 12 | 1.11 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marios D. Dikaiakos | 1 | 697 | 72.63 |
| Anne Rogers | 2 | 157 | 35.76 |
| Kenneth Steiglitz | 3 | 1128 | 660.13 |