Dynamic assignment based on a probabilistic matching: Application to server-container assignment
Open Access
- 1 January 2020
- journal article
- research article
- Published by Elsevier in Procedia Computer Science
- Vol. 176, 3863-3872
Abstract
No abstract availableKeywords
Funding Information
- Takahashi Industrial and Economic Research Foundation
This publication has 6 references indexed in Scilit:
- Defining Network Switch Preference by Network Traffic Using Stable Marriage Problem2019
- The Container Deployment Strategy Based on Stable Matching2019
- A New Docker Swarm Scheduling Strategy2017
- A Performance Study of Containers in Cloud Environment2016
- On randomized matching mechanismsEconomic Theory, 1996
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962