Dynamic assignment based on a probabilistic matching: Application to server-container assignment | Zendy

Akhmad Alimudin | Zendy; Yoshiteru Ishida | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Dynamic assignment based on a probabilistic matching: Application to server-container assignment

Author(s) -

Akhmad Alimudin,

Yoshiteru Ishida

Publication year - 2020

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2020.09.002

Subject(s) - computer science , probabilistic logic , matching (statistics) , container (type theory) , simplicity , server , virtual machine , distributed computing , artificial intelligence , operating system , mechanical engineering , philosophy , statistics , mathematics , epistemology , engineering

Matching algorithm has been used in broad domains of assignment problems because of its simplicity and efficiency. We also studied a probabilistic matching focusing on the application to digital systems including IoT. This note reports a modification of the probabilistic matching aiming application to the dynamic assignment of computational resources and devices This note discusses the dynamic assignment between servers and containers. Container technology is widely used because of its simplicity and efficiency compared with the virtual machines. This note reports the merit and demerit of using the dynamic matching with the simulation of the scenario using CPU resource and memory as dynamic parameters reflecting the changing environment.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research