All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Optimization of the tasks and virtual machines allocation problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F17%3A50013581" target="_blank" >RIV/62690094:18450/17:50013581 - isvavai.cz</a>

  • Result on the web

    <a href="http://fim2.uhk.cz/mme/conferenceproceedings/mme2017_conference_proceedings.pdf" target="_blank" >http://fim2.uhk.cz/mme/conferenceproceedings/mme2017_conference_proceedings.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimization of the tasks and virtual machines allocation problem

  • Original language description

    The tasks and virtual machines allocation are one of the most important problems in efficient use of IT infrastructure including the physical, virtualization or computing technology. Depending on the exact setup of the computing scenario, the optimization problem can be stated in different ways. Most optimization works concern single data centers, multiple infrastructure-as-a-service (IAAS) systems, virtual machine - physical machine assignment problem and task allocation. Much work at the above problems has been done and interesting results have been found. Yet, several aspects were neglected and need to be addressed in more details. Traditional distribution of task or virtual machine allocation is based on simple load balancing techniques, e.g. round robin, in coming data stream selection, etc. This kind of distribution does not reflect the real utilization of resource or problem such as communication between virtual machines, virtual machine co-location interference, composition of power consumption optimization at multiple levels of components, or physical machine with multi-core CPU. The paper is focused on implementation of online bin packing algorithm for workload optimization based on computing task categorization.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    35th International Conference Mathematical Methods in Economics

  • ISBN

    978-80-7435-678-0

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    6

  • Pages from-to

    590-595

  • Publisher name

    Univerzita Hradec Králové

  • Place of publication

    Hradec Králové

  • Event location

    Hradec Králové

  • Event date

    Sep 13, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000427151400101