This project implements a part of the APSR (Adaptive Partial State Random) algorithm for VM placement with high throughput and provable success guarantees. The APSR algorithm is described in the papers:

1. I. Cohen, G. Einziger, M. Goldstein, Y. Sa’ar, G. Scalosub, and E. Waisbard. High Throughput VMs Placement with Constrained Communication Overhead and Provable Guarantees, IEEE Transactions on Network and Service Management, early access, 2023.

2. I. Cohen, G. Einziger, M. Goldstein, Y. Sa’ar, G. Scalosub, and E. Waisbard. Parallel VM Deployment with Provable Guarantees, IFIP Networking, 2021, pp. 1-9.

The project includes an implementation of the MaximizeParallelism (Algorithm 2 in the above papers), which maximizes the number of parallel VM placement schedulers, while providing success guarantees. The algorithm is implemented both in Java and in Python.