G. M. Lauderdale, "Performance Prediction of Packet-Switched Multistage Interconnection Networks in an Execution-Driven Environment," M. S. Thesis, Electrical and Computer Engineering Department, Rice University, Sept. 1989.  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Efficient Simulation of Parallel Computer Systems - Covington, Dwarkada, al. (1991) (47 citations) (Correct)
....run was chosen as the most likely to match the results from the RPPT model. 512 1024 4096 8192 16384 0 10 20 30 data size real simulation Fig. 13. Validation FFT (LCMP; 4 Processors) In addition to the Radix 2 FFT and GDLS algorithms described above, we used a fast Hadamard transform (FHT) [26]. The FHT utilizes floating point adds extensively and has 19 relatively little communication, like the FFT. The LCMP is best suited for algorithms with this very coarse grain type of parallelism. The results for the FFT and FHT are very similar (Figures 13 and 14) Again, these are primarily ....
G. M. Lauderdale, "Performance Prediction of Packet-Switched Multistage Interconnection Networks in an Execution-Driven Environment," M. S. Thesis, Electrical and Computer Engineering Department, Rice University, Sept. 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC