Name
Abstract | ||
|---|---|---|
Multi-threaded shared memory machines, like the commercial Tera MTA or the experimental SB-PRAM, have an extremely good performance
on the Integer Sort benchmark of the NAS Parallel Benchmark Suite and are expected to scale. The number of CPU cycles is an
order of magnitude lower than the numbers reported of general purpose distributed memory or shared memory machines; even vector
computers are slower. The reasons for this behavior are investigated. It turns out that both machines can take advantage of
a fetch-and-add operation and that due to multi-threading no time is lost waiting for memory accesses to complete. Except
for non-scalable vector computers, the Cray T3E, which supports fetch-and-add but not multi-threading, is the only parallel
computer that could challenge these machines.
|
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0057960 | Euro-Par |
Keywords | Field | DocType |
nas integer sort,multi-threaded shared memory machines,parallel computer,distributed memory,shared memory | Interleaved memory,Uniform memory access,Shared memory,Computer science,Parallel computing,Distributed memory,Distributed shared memory,Flat memory model,Instruction cycle,Operating system,Memory module | Conference |
Volume | ISSN | ISBN |
1470 | 0302-9743 | 3-540-64952-2 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Grün | 1 | 0 | 0.34 |
| Mark A. Hillebrand | 2 | 200 | 15.17 |