{'fraction_non_alphanumeric': 0.022328548644338118, 'fraction_numerical': 0.001594896331738437, 'mean_word_length': 5.5025906735751295, '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}}
Performance Analysis of Grid Architecture via Queueing Theory

With the remarkable development of grid technologies, many grid architectures have been proposed which have evolved greatly in recent years. One of the major challenges for grid technologies is to build the scientific and technological base for share, collaboration, large-scale distributed systems. Theories and models of grid architectures are crucial to this attempt as well as to underpinning the foundations for constructing grid systems working effectively. On the basis of a coarse-grain classification of grid applications, we present a novel taxonomy of grid architectures: interaction-intensive architecture and computation-intensive architecture. In this paper, two new grid performance metrics are proposed to measure performance of grid systems. Then, we model grid architectures mathematically via queueing system M/M/1 and M/M/1/K; mean waiting time and total spending time are given. Furthermore, we investigate the performance of two grid architectures and compare them with each other; meanwhile a series of simulations are carried out to demonstrate the analysis results. Finally, we obtain some scientific principles guiding the grid architecture design and optimization.