نتایج جستجو برای: 200 cm

تعداد نتایج: 276544  

2007
Oliver A. McBryan

We describe the implementation of a fluid dynamical benchmark on two Thinking Machines Corporation parallel computers the 65,536 processor CM-200 computer and the 1024-node CM-5 computer. The benchmark, the Shallow Water Equations, is frequently used as a model for both oceanographic and atmospheric circulation. We describe the steps involved in implementing the algorithm on the computers and w...

2011
D. Bemmerer T. Cowan Z. Elekes M. Kempe M. Röder M. Sobiella D. Stach A. Wagner D. Yakorev K. Zuber

A detector for high-resolution momentum measurements of neutrons in the energy range 0.2-1.0 GeV is being developed for the RB experiment at FAIR. Two solutions are currently being studied: A pure scintillator concept and an approach based on a sequence of converter material (iron) to produce secondary charged particles, and Multigap Resistive Plate Chambers (MRPC’s) to detect these particles. ...

2007
Oliver A. McBryan

We describe the implementation of a fluid dynamical benchmark on the 2048 vector node CM-200 parallel computer and on the 1024-node CM-5 computer. The benchmark, the Shallow Water Equations, is frequently used as a model for both oceanographic and atmospheric circulation. We describe the steps involved in implementing the algorithm on the two Thinking Machines Corporation computers and we provi...

Journal: :Scientific Programming 1994
William George Ralph G. Brickner S. Lennart Johnsson

We describe the use and implementation of a polyshift function PSHIFT for circular shifts and end{oo shifts. Polyshift is useful in many scientiic codes using regular grids, such as nite diierence codes in several dimensions, multigrid codes, molecular dynamics computations, and in lattice gauge physics computations , such as Quantum Chromodynamics (QCD) calculations. Our implementation of the ...

2007
Claus Bendtsen

The CMSSL library only includes a limited amount of mathematical algorithms. Hence, when writing code for the Connection Machine one often has to implement LAPACK-style routines already developed for other architec-tures, in the hope that acceptable performance can thus be obtained relatively quickly. Due to the massively parallel structure of the CM, algorithms with a serial or global structur...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید