By Topic

Lattice field theory on cluster computers: vector- vs. cache-centric programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Best, C. ; Inst. for Comput., Forschungszentrum Julich GmbH, Germany ; Eicker, N. ; Lipper, T. ; Peardon, M.
more authors

We evaluate the possibility of moving medium-sized calculation in lattice field theory from vector supercomputers to cluster computers, namely clusters built from Alpha processors and Myrinet interconnect, and find that a medium-sized system with a performance of 10 to 20 GFlop/s can be easily and cost-effectively built from current off-the-shelf components. The performance of the algorithms is analyzed with respect to memory bandwidth problems by experiment and using a cache simulator that uses C++ operator overloading. It seems that cluster systems, while hampered by poor memory bandwidth as compared to supercomputers, might offer opportunities for some algorithms that have good locality but are not vectorizable and thus will not perform well on vector systems

Published in:

Cluster Computing, 1999. Proceedings. 1st IEEE Computer Society International Workshop on

Date of Conference: