{'fraction_non_alphanumeric': 0.011111111111111112, 'fraction_numerical': 0.0, 'mean_word_length': 5.300699300699301, '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}}
Application of greedy algorithms to Virtual Machine Distribution across Data Centers

Cloud computing allows users to access resources on demand. The size of data centers increase with the increasing demand for resources by users. Increase in the size of data centers is directly proportional to energy consumption. The total energy requirement has to be minimized by distributing virtual machine requests over data centers optimally, with the consideration of prices of distribution of virtual machines. These two parameters are taken into account to frame the objective function for the Virtual Machine Distribution across Data Centers. Here both servers and workloads are classified as IO bound and CPU bound. A greedy algorithm framework has been used to obtain sub-optimal solutions for virtual machine distribution problem. Simulation results obtained indicates in favor of best fit allocation.