{'fraction_non_alphanumeric': 0.020036429872495445, 'fraction_numerical': 0.0, 'mean_word_length': 5.3895348837209305, '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}}
ASSIGNMENT OF TASKS ON PARALLEL AND DISTRIBUTED COMPUTER SYSTEMS WITH NETWORK CONTENTION

Rapid advances in communications technology and the proliferation of inexpensive PCs and workstations have created a wide avenue for Distributed Computing Systems to move into mainstream computing. A Distributed Computing System (DCS) consists of a number of PCs or workstations interconnected through PPP, LAN or WAN. These systems provide a higher performance, better reliability and throughput over centralized mainframe systems. Clearly, we have a set of M tasks connected in some fashion and a heterogeneous DCS composed of N computers of different capabilities. Tasks of a given application require certain computer resources (memory, processor and communication link). Indeed, computers and communication resources in the system are also capacitated. For these reasons, the issue is how to assign (allocate/schedule) the tasks of a given application onto the available computers of the system so as to maximize the system throughput i.e. to minimize the total sum of execution and communication costs.