{'fraction_non_alphanumeric': 0.022222222222222223, 'fraction_numerical': 0.004678362573099415, 'mean_word_length': 5.248175182481752, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Lattice field theory on cluster computers: vector- vs. cache-centric programming

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.