{'fraction_non_alphanumeric': 0.01731399157697707, 'fraction_numerical': 0.0, 'mean_word_length': 5.830670926517572, '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}}
Architecture of a time‐sensitive provisioning system for cloud‐native software

Application development paradigms and composition of technology services are decisively moving in the direction of hybrid and multi clouds. Enterprises are stitching new cloud‐native business models that leverage containerized multi‐tier microservice architecture, heterogeneity of cloud deployment models, and diversity of cloud providers. Scalability and resiliency are key components of this new world architecture, but these are also functions of the predictability of provisioning the underpinning compute instances on cloud. Thus, a major challenge to surmount before complex multicloud aware applications can be designed is the problem of unpredictable latencies associated with the provisioning of compute services on cloud. In the first part of this article, we develop a technique for time‐sensitive provisioning of virtual compute on demand, while also allowing deprovisioning on demand. Using the technique we propose, a cloud broker will be able to operate on a pool of reserved instances sourced from cloud providers and multiplex them profitably across cloud customers with associated provisioning time guarantees, but without usage commitment restrictions. We articulate this challenge in the form of the Reserved Instance Allocation Problem (RIAP), which we first prove to be NP‐hard. We then design a heuristic‐based method to solve the intractable RIAP in polynomial time. We evaluate the effectiveness of our heuristic‐based mechanism through a combination of deep simulations and practical validation on mainstream public clouds. We demonstrate that our algorithm consistently yields a high profit‐to‐investment ratio for a broker who seeks to operate a commerce of virtual machines with time‐sensitive provisioning. In the second part of this article, we tackle the problem of unpredictable provisioning latencies in bare metal commerce. We build and evaluate an allocation model to calculate optimal supporting bare metal inventory to maximize cost‐sensitive fulfillment of bare metal provisioning requests in a time‐sensitive manner.