{'fraction_non_alphanumeric': 0.01984126984126984, 'fraction_numerical': 0.0, 'mean_word_length': 5.4743589743589745, '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}}
NP-Completeness of Memory-Aware Virtual Machine Scheduling Problem

Increasing energy consumption in server consolidation environments leads to high maintenance costs for data centers. Main memory, no less than processor, is a major energy consumer in this environment. This paper proposes a problem of reducing memory energy consumption using virtual machine scheduling in multi-core systems. We prove that scheduling virtual machines to minimize the memory energy consumption is an NP-Complete problem.