{'fraction_non_alphanumeric': 0.02748091603053435, 'fraction_numerical': 0.0007633587786259542, 'mean_word_length': 5.333333333333333, '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}}
Large-scale Service Systems with Packing Constraints and Heterogeneous Servers

A service system with multiple types of arriving customers and multiple types of servers is considered. Several customers (possibly of different types) can be placed for concurrent service into same server, subject to "packing" constraints, which depend on the server type. Service times of different customers are independent, even if served simultaneously by the same server. The largescale asymptotic regime is considered such that the customer arrival rates grow to infinity. We consider two variants of the model. For the infinite-server model, we prove asymptotic optimality of the Greedy Random (GRAND) algorithm in the sense of minimizing the weighted (by type) number of occupied servers in steadystate. (This version of GRAND generalizes that introduced in [1] for the homogeneous systems, with all servers of same type.) We then introduce a natural extension of GRAND algorithm for finite-server systems with blocking. Assuming subcritical system load, we prove existence, uniqueness, and local stability of the large-scale system equilibrium point such that no blocking occurs. This result strongly suggests a conjecture that the steady-state blocking probability under the algorithm vanishes in the large-scale limit.