{'fraction_non_alphanumeric': 0.019144144144144143, 'fraction_numerical': 0.0022522522522522522, 'mean_word_length': 5.786259541984733, '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}}
Structured Data Access Mechanisms for a Decoupled Computer Architecture

Decoupled computer architectures attempt to achieve superscalar performance by exploiting the fine-grain parallelism between the data access and data execute tasks of a computer program. In this paper, we examine the major bottlenecks in the performance of decoupled architectures. These consist of the load unbalance between the access and execute processors, the limited access processor's instruction issue rate, and the memory bandwidth. We introduce a decoupled architecture that (1) eliminates the access processor's instruction issue bottleneck by reducing the number of data access instructions, and (2) reduces the effects of the memory bandwidth by allowing better data prefetching. The architecture employs special data access mechanisms that take advantage of the regularity of structure data's storage.