{'fraction_non_alphanumeric': 0.024861878453038673, 'fraction_numerical': 0.019337016574585635, 'mean_word_length': 4.753968253968254, 'pattern_counts': {'":': 0, '<': 1, '<?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}}
2-D matrix multiplication on a 3-D systolic array

The introduction of systolic arrays in the late 1970s had an enormous impact on the area of special purpose computing. However, most of the work so far has been done with onedimensional and two-dimensional (2D) systolic arrays. Recent advances in three-<limensional VLSI (3D VLSI) and 3D packaging of2D VLSI components, has made the idea of 3D systolic arrays feasible in the near future. In this paper we introduce one algorithm for 2D matrix multiplication, using a 3D systolic array. We analyze advantages and disadvantages of 3D systolic arrays in the context of the analysis algorithm. The analytical work is combined with examples and discussions of relevant details.