Search

Search Funnelback University

Search powered by Funnelback
1 - 10 of 255 search results for news
  1. Fully-matching results

  2. 1. Introduction

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper4/node1.html
    7 Jan 2000: In this paper, we present a new method for performing FFTs on parallel computers which minimises the latency cost and thus offers the prospect of scaling plane-wave electronic structure calculations ... 2 we outline those aspects of the derivation of the
  3. 2. Formulation of the problem

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper5/node2.html
    11 Jul 2000: 8). When Eq. (7) is solved, a new output electron density. ... is obtained and a new input electron density for the next iteration can be constructed by a linear (or more sophisticated [18]) mixing scheme e.g.
  4. 3. Traditional parallel implementation

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper4/node3.html
    7 Jan 2000: Next: 4. New parallel implementation Up: Parallel fast Fourier transforms Previous: 2. ... Figure 1: Distribution of data for traditional implementation. Next: 4. New parallel implementation Up: Parallel fast Fourier transforms Previous: 2.
  5. 3D ultrasound examination of large organs G.M. Treece, R.W. ...

    mi.eng.cam.ac.uk/reports/svr-ftp/treece_tr367.pdf
    12 May 2000: That plane for which thedot product of its normal with v is greatest is selected for defining the new dividing plane.In the case of Figure 7(b), the planes defined
  6. 4. New parallel implementation

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper4/node4.html
    7 Jan 2000: Another advantage of the new method is that the Hamiltonian matrix is now effectively blocked. ... operations. The new method distributes the data such that each block of the matrix can be applied in.
  7. 5. Cost comparison

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper4/node5.html
    7 Jan 2000: Next: 6. Results Up: Parallel fast Fourier transforms Previous: 4. New parallel implementation.. ... Next: 6. Results Up: Parallel fast Fourier transforms Previous: 4. New parallel implementation.
  8. 6. Results

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper4/node6.html
    7 Jan 2000: 5, we would not expect this machine to give particularly favourable results for the new method because its latency cost is small. ... On the machine used here, the new method is out-performed by the old method for the reasons given above, and would only
  9. 7. Load balancing

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper4/node7.html
    7 Jan 2000: We note here that the new method automatically satisifies the demand of load balancing. ... In fact, the cutoff sphere on the full FFT grid is transformed into a cutoff sphere on the FFT grid on each node in the new method.
  10. 8. Conclusions

    www.tcm.phy.cam.ac.uk/~pdh1001/papers/paper4/node8.html
    7 Jan 2000: 8. Conclusions. We have presented a new method for performing FFTs on parallel computers which scales to a larger number of nodes than the traditional method due to the reduced latency ... The new method automatically satsifies the demand of load
  11. A Method for Direct Audio Search with Applications to Indexing and…

    mi.eng.cam.ac.uk/reports/full_html/johnson_icassp00.html/
    16 Jun 2000: Method. CPUs. non-news. news. window, 5@1s. 3514. 5459s=60.8%. 110s=0.5%. window, 10@2s. ... windows. (s). non-news. news. 5s long, 1s shift. 0. 60.8%. 0.49%.

Refine your results

Format

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.