{'fraction_non_alphanumeric': 0.023668639053254437, 'fraction_numerical': 0.01873767258382643, 'mean_word_length': 4.576923076923077, '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}}
A study of interleaved memory systems by trace driven simulation

A model of interleaved memory systems for IBM System/360 and System/370 architecture has been investigated by means of a trace driven simulation. The model used is an extension of one due to G. J. Burnett and E. G. Coffman, Jr. The trace data to drive the simulation was obtained from instruction-by-instruction traces of typical IBM 360/370 programs and of the OS/VS2 operating system. The predictions of the Burnett-Coffman model are found to fit well with the simulation results for the fetching of instructions. For the fetching of operands, however, the simulation results show only about half the increase in the memory bandwidth that the Burnett-Coffman analysis predicts. This indicates that data references on the IBM 360/370 are not random in the way assumed by Burnett and Coffman. In fact, repetitive references to the same memory location occur often enough to limit the memory bandwidth increase which can be obtained by interleaving.